59.16/30.67 YES 59.16/30.67 59.16/30.67 Ultimate: Cannot open display: 59.16/30.67 This is Ultimate 0.1.24-8dc7c08-m 59.16/30.67 [2019-03-28 12:41:00,818 INFO L170 SettingsManager]: Resetting all preferences to default values... 59.16/30.67 [2019-03-28 12:41:00,820 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 59.16/30.67 [2019-03-28 12:41:00,831 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 59.16/30.67 [2019-03-28 12:41:00,832 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 59.16/30.67 [2019-03-28 12:41:00,833 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 59.16/30.67 [2019-03-28 12:41:00,834 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 59.16/30.67 [2019-03-28 12:41:00,836 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 59.16/30.67 [2019-03-28 12:41:00,837 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 59.16/30.67 [2019-03-28 12:41:00,838 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 59.16/30.67 [2019-03-28 12:41:00,839 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 59.16/30.67 [2019-03-28 12:41:00,839 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 59.16/30.67 [2019-03-28 12:41:00,840 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 59.16/30.67 [2019-03-28 12:41:00,841 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 59.16/30.67 [2019-03-28 12:41:00,842 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 59.16/30.67 [2019-03-28 12:41:00,842 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 59.16/30.67 [2019-03-28 12:41:00,843 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 59.16/30.67 [2019-03-28 12:41:00,845 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 59.16/30.67 [2019-03-28 12:41:00,847 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 59.16/30.67 [2019-03-28 12:41:00,848 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 59.16/30.67 [2019-03-28 12:41:00,849 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 59.16/30.67 [2019-03-28 12:41:00,850 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 59.16/30.67 [2019-03-28 12:41:00,852 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 59.16/30.67 [2019-03-28 12:41:00,853 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 59.16/30.67 [2019-03-28 12:41:00,853 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 59.16/30.67 [2019-03-28 12:41:00,854 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 59.16/30.67 [2019-03-28 12:41:00,854 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 59.16/30.67 [2019-03-28 12:41:00,855 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 59.16/30.67 [2019-03-28 12:41:00,855 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 59.16/30.67 [2019-03-28 12:41:00,856 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 59.16/30.67 [2019-03-28 12:41:00,857 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 59.16/30.67 [2019-03-28 12:41:00,857 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 59.16/30.67 [2019-03-28 12:41:00,858 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 59.16/30.67 [2019-03-28 12:41:00,858 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 59.16/30.67 [2019-03-28 12:41:00,859 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 59.16/30.67 [2019-03-28 12:41:00,859 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 59.16/30.67 [2019-03-28 12:41:00,860 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 59.16/30.67 [2019-03-28 12:41:00,861 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 59.16/30.67 [2019-03-28 12:41:00,861 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 59.16/30.67 [2019-03-28 12:41:00,861 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 59.16/30.67 [2019-03-28 12:41:00,876 INFO L110 SettingsManager]: Loading preferences was successful 59.16/30.67 [2019-03-28 12:41:00,876 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 59.16/30.67 [2019-03-28 12:41:00,877 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 59.16/30.67 [2019-03-28 12:41:00,878 INFO L133 SettingsManager]: * Rewrite not-equals=true 59.16/30.67 [2019-03-28 12:41:00,878 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 59.16/30.67 [2019-03-28 12:41:00,878 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 59.16/30.67 [2019-03-28 12:41:00,878 INFO L133 SettingsManager]: * Use SBE=true 59.16/30.67 [2019-03-28 12:41:00,878 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 59.16/30.67 [2019-03-28 12:41:00,879 INFO L133 SettingsManager]: * Use old map elimination=false 59.16/30.67 [2019-03-28 12:41:00,879 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 59.16/30.67 [2019-03-28 12:41:00,879 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 59.16/30.67 [2019-03-28 12:41:00,879 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 59.16/30.67 [2019-03-28 12:41:00,879 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 59.16/30.67 [2019-03-28 12:41:00,879 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 59.16/30.67 [2019-03-28 12:41:00,880 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 59.16/30.67 [2019-03-28 12:41:00,880 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 59.16/30.67 [2019-03-28 12:41:00,880 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 59.16/30.67 [2019-03-28 12:41:00,880 INFO L133 SettingsManager]: * Check division by zero=IGNORE 59.16/30.67 [2019-03-28 12:41:00,880 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 59.16/30.67 [2019-03-28 12:41:00,880 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 59.16/30.67 [2019-03-28 12:41:00,881 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 59.16/30.67 [2019-03-28 12:41:00,881 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 59.16/30.67 [2019-03-28 12:41:00,881 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 59.16/30.67 [2019-03-28 12:41:00,881 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 59.16/30.67 [2019-03-28 12:41:00,881 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 59.16/30.67 [2019-03-28 12:41:00,882 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 59.16/30.67 [2019-03-28 12:41:00,882 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 59.16/30.67 [2019-03-28 12:41:00,882 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 59.16/30.67 [2019-03-28 12:41:00,882 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 59.16/30.67 [2019-03-28 12:41:00,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 59.16/30.67 [2019-03-28 12:41:00,921 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 59.16/30.67 [2019-03-28 12:41:00,924 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 59.16/30.67 [2019-03-28 12:41:00,926 INFO L271 PluginConnector]: Initializing CDTParser... 59.16/30.67 [2019-03-28 12:41:00,926 INFO L276 PluginConnector]: CDTParser initialized 59.16/30.67 [2019-03-28 12:41:00,927 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 59.16/30.67 [2019-03-28 12:41:01,053 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/66891480805d495c93c5c618e62cd223/FLAG5185bdf41 59.16/30.67 [2019-03-28 12:41:01,400 INFO L307 CDTParser]: Found 1 translation units. 59.16/30.67 [2019-03-28 12:41:01,401 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 59.16/30.67 [2019-03-28 12:41:01,401 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 59.16/30.67 [2019-03-28 12:41:01,408 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/66891480805d495c93c5c618e62cd223/FLAG5185bdf41 59.16/30.67 [2019-03-28 12:41:01,855 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/66891480805d495c93c5c618e62cd223 59.16/30.67 [2019-03-28 12:41:01,867 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 59.16/30.67 [2019-03-28 12:41:01,868 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 59.16/30.67 [2019-03-28 12:41:01,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 59.16/30.67 [2019-03-28 12:41:01,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 59.16/30.67 [2019-03-28 12:41:01,873 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 59.16/30.67 [2019-03-28 12:41:01,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:41:01" (1/1) ... 59.16/30.67 [2019-03-28 12:41:01,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3f6d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:01, skipping insertion in model container 59.16/30.67 [2019-03-28 12:41:01,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:41:01" (1/1) ... 59.16/30.67 [2019-03-28 12:41:01,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 59.16/30.67 [2019-03-28 12:41:01,904 INFO L176 MainTranslator]: Built tables and reachable declarations 59.16/30.67 [2019-03-28 12:41:02,074 INFO L206 PostProcessor]: Analyzing one entry point: main 59.16/30.67 [2019-03-28 12:41:02,087 INFO L191 MainTranslator]: Completed pre-run 59.16/30.67 [2019-03-28 12:41:02,108 INFO L206 PostProcessor]: Analyzing one entry point: main 59.16/30.67 [2019-03-28 12:41:02,189 INFO L195 MainTranslator]: Completed translation 59.16/30.67 [2019-03-28 12:41:02,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:02 WrapperNode 59.16/30.67 [2019-03-28 12:41:02,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 59.16/30.67 [2019-03-28 12:41:02,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 59.16/30.67 [2019-03-28 12:41:02,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 59.16/30.67 [2019-03-28 12:41:02,191 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 59.16/30.67 [2019-03-28 12:41:02,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:02" (1/1) ... 59.16/30.67 [2019-03-28 12:41:02,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:02" (1/1) ... 59.16/30.67 [2019-03-28 12:41:02,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 59.16/30.67 [2019-03-28 12:41:02,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 59.16/30.67 [2019-03-28 12:41:02,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 59.16/30.67 [2019-03-28 12:41:02,238 INFO L276 PluginConnector]: Boogie Preprocessor initialized 59.16/30.67 [2019-03-28 12:41:02,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:02" (1/1) ... 59.16/30.67 [2019-03-28 12:41:02,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:02" (1/1) ... 59.16/30.67 [2019-03-28 12:41:02,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:02" (1/1) ... 59.16/30.67 [2019-03-28 12:41:02,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:02" (1/1) ... 59.16/30.67 [2019-03-28 12:41:02,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:02" (1/1) ... 59.16/30.67 [2019-03-28 12:41:02,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:02" (1/1) ... 59.16/30.67 [2019-03-28 12:41:02,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:02" (1/1) ... 59.16/30.67 [2019-03-28 12:41:02,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 59.16/30.67 [2019-03-28 12:41:02,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 59.16/30.67 [2019-03-28 12:41:02,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... 59.16/30.67 [2019-03-28 12:41:02,266 INFO L276 PluginConnector]: RCFGBuilder initialized 59.16/30.67 [2019-03-28 12:41:02,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:02" (1/1) ... 59.16/30.67 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 59.16/30.67 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 59.16/30.67 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 59.16/30.67 [2019-03-28 12:41:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 59.16/30.67 [2019-03-28 12:41:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 59.16/30.67 [2019-03-28 12:41:02,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 59.16/30.67 [2019-03-28 12:41:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 59.16/30.67 [2019-03-28 12:41:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 59.16/30.67 [2019-03-28 12:41:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 59.16/30.67 [2019-03-28 12:41:02,612 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 59.16/30.67 [2019-03-28 12:41:02,612 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 59.16/30.67 [2019-03-28 12:41:02,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:02 BoogieIcfgContainer 59.16/30.67 [2019-03-28 12:41:02,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 59.16/30.67 [2019-03-28 12:41:02,614 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 59.16/30.67 [2019-03-28 12:41:02,614 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 59.16/30.67 [2019-03-28 12:41:02,617 INFO L276 PluginConnector]: BlockEncodingV2 initialized 59.16/30.67 [2019-03-28 12:41:02,617 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:02" (1/1) ... 59.16/30.67 [2019-03-28 12:41:02,636 INFO L313 BlockEncoder]: Initial Icfg 39 locations, 44 edges 59.16/30.67 [2019-03-28 12:41:02,638 INFO L258 BlockEncoder]: Using Remove infeasible edges 59.16/30.67 [2019-03-28 12:41:02,639 INFO L263 BlockEncoder]: Using Maximize final states 59.16/30.67 [2019-03-28 12:41:02,640 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 59.16/30.67 [2019-03-28 12:41:02,640 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 59.16/30.67 [2019-03-28 12:41:02,642 INFO L296 BlockEncoder]: Using Remove sink states 59.16/30.67 [2019-03-28 12:41:02,645 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 59.16/30.67 [2019-03-28 12:41:02,645 INFO L179 BlockEncoder]: Using Rewrite not-equals 59.16/30.67 [2019-03-28 12:41:02,673 INFO L185 BlockEncoder]: Using Use SBE 59.16/30.67 [2019-03-28 12:41:02,703 INFO L200 BlockEncoder]: SBE split 18 edges 59.16/30.67 [2019-03-28 12:41:02,708 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 59.16/30.67 [2019-03-28 12:41:02,710 INFO L71 MaximizeFinalStates]: 0 new accepting states 59.16/30.67 [2019-03-28 12:41:02,736 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 59.16/30.67 [2019-03-28 12:41:02,739 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states 59.16/30.67 [2019-03-28 12:41:02,740 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 59.16/30.67 [2019-03-28 12:41:02,740 INFO L71 MaximizeFinalStates]: 0 new accepting states 59.16/30.67 [2019-03-28 12:41:02,741 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 59.16/30.67 [2019-03-28 12:41:02,741 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 59.16/30.67 [2019-03-28 12:41:02,742 INFO L313 BlockEncoder]: Encoded RCFG 29 locations, 53 edges 59.16/30.67 [2019-03-28 12:41:02,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:41:02 BasicIcfg 59.16/30.67 [2019-03-28 12:41:02,742 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 59.16/30.67 [2019-03-28 12:41:02,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 59.16/30.67 [2019-03-28 12:41:02,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... 59.16/30.67 [2019-03-28 12:41:02,747 INFO L276 PluginConnector]: TraceAbstraction initialized 59.16/30.67 [2019-03-28 12:41:02,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:41:01" (1/4) ... 59.16/30.67 [2019-03-28 12:41:02,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66096f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:41:02, skipping insertion in model container 59.16/30.67 [2019-03-28 12:41:02,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:02" (2/4) ... 59.16/30.67 [2019-03-28 12:41:02,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66096f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:41:02, skipping insertion in model container 59.16/30.67 [2019-03-28 12:41:02,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:02" (3/4) ... 59.16/30.67 [2019-03-28 12:41:02,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66096f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:41:02, skipping insertion in model container 59.16/30.67 [2019-03-28 12:41:02,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:41:02" (4/4) ... 59.16/30.67 [2019-03-28 12:41:02,751 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 59.16/30.67 [2019-03-28 12:41:02,760 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 59.16/30.67 [2019-03-28 12:41:02,769 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. 59.16/30.67 [2019-03-28 12:41:02,786 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. 59.16/30.67 [2019-03-28 12:41:02,815 INFO L133 ementStrategyFactory]: Using default assertion order modulation 59.16/30.67 [2019-03-28 12:41:02,816 INFO L382 AbstractCegarLoop]: Interprodecural is true 59.16/30.67 [2019-03-28 12:41:02,816 INFO L383 AbstractCegarLoop]: Hoare is true 59.16/30.67 [2019-03-28 12:41:02,816 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 59.16/30.67 [2019-03-28 12:41:02,816 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 59.16/30.67 [2019-03-28 12:41:02,816 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 59.16/30.67 [2019-03-28 12:41:02,816 INFO L387 AbstractCegarLoop]: Difference is false 59.16/30.67 [2019-03-28 12:41:02,817 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 59.16/30.67 [2019-03-28 12:41:02,817 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 59.16/30.67 [2019-03-28 12:41:02,832 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. 59.16/30.67 [2019-03-28 12:41:02,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 59.16/30.67 [2019-03-28 12:41:02,838 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:02,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:02,839 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:02,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:02,845 INFO L82 PathProgramCache]: Analyzing trace with hash 193728502, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:02,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:02,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:02,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:02,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:02,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:03,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:03,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 59.16/30.67 [2019-03-28 12:41:03,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 59.16/30.67 [2019-03-28 12:41:03,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 59.16/30.67 [2019-03-28 12:41:03,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.16/30.67 [2019-03-28 12:41:03,055 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. 59.16/30.67 [2019-03-28 12:41:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:03,199 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. 59.16/30.67 [2019-03-28 12:41:03,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 59.16/30.67 [2019-03-28 12:41:03,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 59.16/30.67 [2019-03-28 12:41:03,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:03,215 INFO L225 Difference]: With dead ends: 29 59.16/30.67 [2019-03-28 12:41:03,215 INFO L226 Difference]: Without dead ends: 28 59.16/30.67 [2019-03-28 12:41:03,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.16/30.67 [2019-03-28 12:41:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 59.16/30.67 [2019-03-28 12:41:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 59.16/30.67 [2019-03-28 12:41:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 59.16/30.67 [2019-03-28 12:41:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 51 transitions. 59.16/30.67 [2019-03-28 12:41:03,280 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 51 transitions. Word has length 5 59.16/30.67 [2019-03-28 12:41:03,281 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:03,282 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 51 transitions. 59.16/30.67 [2019-03-28 12:41:03,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 59.16/30.67 [2019-03-28 12:41:03,282 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 51 transitions. 59.16/30.67 [2019-03-28 12:41:03,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 59.16/30.67 [2019-03-28 12:41:03,282 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:03,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:03,283 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:03,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:03,283 INFO L82 PathProgramCache]: Analyzing trace with hash 193728504, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:03,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:03,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:03,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:03,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:03,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:03,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:03,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:03,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 59.16/30.67 [2019-03-28 12:41:03,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 59.16/30.67 [2019-03-28 12:41:03,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 59.16/30.67 [2019-03-28 12:41:03,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.16/30.67 [2019-03-28 12:41:03,340 INFO L87 Difference]: Start difference. First operand 28 states and 51 transitions. Second operand 3 states. 59.16/30.67 [2019-03-28 12:41:03,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:03,414 INFO L93 Difference]: Finished difference Result 29 states and 51 transitions. 59.16/30.67 [2019-03-28 12:41:03,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 59.16/30.67 [2019-03-28 12:41:03,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 59.16/30.67 [2019-03-28 12:41:03,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:03,416 INFO L225 Difference]: With dead ends: 29 59.16/30.67 [2019-03-28 12:41:03,416 INFO L226 Difference]: Without dead ends: 28 59.16/30.67 [2019-03-28 12:41:03,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.16/30.67 [2019-03-28 12:41:03,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 59.16/30.67 [2019-03-28 12:41:03,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 59.16/30.67 [2019-03-28 12:41:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 59.16/30.67 [2019-03-28 12:41:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 50 transitions. 59.16/30.67 [2019-03-28 12:41:03,422 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 50 transitions. Word has length 5 59.16/30.67 [2019-03-28 12:41:03,422 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:03,423 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 50 transitions. 59.16/30.67 [2019-03-28 12:41:03,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 59.16/30.67 [2019-03-28 12:41:03,423 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. 59.16/30.67 [2019-03-28 12:41:03,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 59.16/30.67 [2019-03-28 12:41:03,423 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:03,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:03,424 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:03,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:03,424 INFO L82 PathProgramCache]: Analyzing trace with hash 193728505, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:03,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:03,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:03,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:03,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:03,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:03,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:03,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 59.16/30.67 [2019-03-28 12:41:03,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 59.16/30.67 [2019-03-28 12:41:03,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 59.16/30.67 [2019-03-28 12:41:03,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 59.16/30.67 [2019-03-28 12:41:03,465 INFO L87 Difference]: Start difference. First operand 28 states and 50 transitions. Second operand 4 states. 59.16/30.67 [2019-03-28 12:41:03,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:03,560 INFO L93 Difference]: Finished difference Result 28 states and 50 transitions. 59.16/30.67 [2019-03-28 12:41:03,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 59.16/30.67 [2019-03-28 12:41:03,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 59.16/30.67 [2019-03-28 12:41:03,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:03,561 INFO L225 Difference]: With dead ends: 28 59.16/30.67 [2019-03-28 12:41:03,561 INFO L226 Difference]: Without dead ends: 27 59.16/30.67 [2019-03-28 12:41:03,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 59.16/30.67 [2019-03-28 12:41:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 59.16/30.67 [2019-03-28 12:41:03,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 59.16/30.67 [2019-03-28 12:41:03,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 59.16/30.67 [2019-03-28 12:41:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 49 transitions. 59.16/30.67 [2019-03-28 12:41:03,566 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 49 transitions. Word has length 5 59.16/30.67 [2019-03-28 12:41:03,566 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:03,567 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 49 transitions. 59.16/30.67 [2019-03-28 12:41:03,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 59.16/30.67 [2019-03-28 12:41:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 49 transitions. 59.16/30.67 [2019-03-28 12:41:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 59.16/30.67 [2019-03-28 12:41:03,567 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:03,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:03,568 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:03,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:03,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1710614953, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:03,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:03,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:03,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:03,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:03,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:03,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:03,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 59.16/30.67 [2019-03-28 12:41:03,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 59.16/30.67 [2019-03-28 12:41:03,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 59.16/30.67 [2019-03-28 12:41:03,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.16/30.67 [2019-03-28 12:41:03,598 INFO L87 Difference]: Start difference. First operand 27 states and 49 transitions. Second operand 3 states. 59.16/30.67 [2019-03-28 12:41:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:03,658 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. 59.16/30.67 [2019-03-28 12:41:03,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 59.16/30.67 [2019-03-28 12:41:03,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 59.16/30.67 [2019-03-28 12:41:03,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:03,660 INFO L225 Difference]: With dead ends: 27 59.16/30.67 [2019-03-28 12:41:03,660 INFO L226 Difference]: Without dead ends: 26 59.16/30.67 [2019-03-28 12:41:03,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.16/30.67 [2019-03-28 12:41:03,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 59.16/30.67 [2019-03-28 12:41:03,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 59.16/30.67 [2019-03-28 12:41:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 59.16/30.67 [2019-03-28 12:41:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 47 transitions. 59.16/30.67 [2019-03-28 12:41:03,664 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 47 transitions. Word has length 6 59.16/30.67 [2019-03-28 12:41:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:03,665 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 47 transitions. 59.16/30.67 [2019-03-28 12:41:03,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 59.16/30.67 [2019-03-28 12:41:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 47 transitions. 59.16/30.67 [2019-03-28 12:41:03,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 59.16/30.67 [2019-03-28 12:41:03,665 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:03,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:03,666 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:03,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:03,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1710614955, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:03,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:03,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:03,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:03,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:03,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:03,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:03,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 59.16/30.67 [2019-03-28 12:41:03,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 59.16/30.67 [2019-03-28 12:41:03,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 59.16/30.67 [2019-03-28 12:41:03,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.16/30.67 [2019-03-28 12:41:03,702 INFO L87 Difference]: Start difference. First operand 26 states and 47 transitions. Second operand 3 states. 59.16/30.67 [2019-03-28 12:41:03,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:03,777 INFO L93 Difference]: Finished difference Result 27 states and 47 transitions. 59.16/30.67 [2019-03-28 12:41:03,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 59.16/30.67 [2019-03-28 12:41:03,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 59.16/30.67 [2019-03-28 12:41:03,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:03,779 INFO L225 Difference]: With dead ends: 27 59.16/30.67 [2019-03-28 12:41:03,779 INFO L226 Difference]: Without dead ends: 26 59.16/30.67 [2019-03-28 12:41:03,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.16/30.67 [2019-03-28 12:41:03,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 59.16/30.67 [2019-03-28 12:41:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 59.16/30.67 [2019-03-28 12:41:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 59.16/30.67 [2019-03-28 12:41:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 46 transitions. 59.16/30.67 [2019-03-28 12:41:03,783 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 46 transitions. Word has length 6 59.16/30.67 [2019-03-28 12:41:03,783 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:03,784 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 46 transitions. 59.16/30.67 [2019-03-28 12:41:03,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 59.16/30.67 [2019-03-28 12:41:03,784 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 46 transitions. 59.16/30.67 [2019-03-28 12:41:03,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 59.16/30.67 [2019-03-28 12:41:03,784 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:03,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:03,785 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:03,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:03,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1710614956, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:03,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:03,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:03,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:03,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:03,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:03,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:03,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 59.16/30.67 [2019-03-28 12:41:03,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 59.16/30.67 [2019-03-28 12:41:03,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 59.16/30.67 [2019-03-28 12:41:03,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 59.16/30.67 [2019-03-28 12:41:03,831 INFO L87 Difference]: Start difference. First operand 26 states and 46 transitions. Second operand 4 states. 59.16/30.67 [2019-03-28 12:41:03,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:03,900 INFO L93 Difference]: Finished difference Result 26 states and 46 transitions. 59.16/30.67 [2019-03-28 12:41:03,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 59.16/30.67 [2019-03-28 12:41:03,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 59.16/30.67 [2019-03-28 12:41:03,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:03,901 INFO L225 Difference]: With dead ends: 26 59.16/30.67 [2019-03-28 12:41:03,902 INFO L226 Difference]: Without dead ends: 25 59.16/30.67 [2019-03-28 12:41:03,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 59.16/30.67 [2019-03-28 12:41:03,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 59.16/30.67 [2019-03-28 12:41:03,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 59.16/30.67 [2019-03-28 12:41:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 59.16/30.67 [2019-03-28 12:41:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 45 transitions. 59.16/30.67 [2019-03-28 12:41:03,906 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 45 transitions. Word has length 6 59.16/30.67 [2019-03-28 12:41:03,906 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:03,906 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 45 transitions. 59.16/30.67 [2019-03-28 12:41:03,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 59.16/30.67 [2019-03-28 12:41:03,907 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 45 transitions. 59.16/30.67 [2019-03-28 12:41:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 59.16/30.67 [2019-03-28 12:41:03,907 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:03,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:03,907 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:03,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:03,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1489457162, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:03,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:03,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:03,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:03,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:03,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:03,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:03,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:03,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 59.16/30.67 [2019-03-28 12:41:03,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 59.16/30.67 [2019-03-28 12:41:03,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 59.16/30.67 [2019-03-28 12:41:03,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 59.16/30.67 [2019-03-28 12:41:03,950 INFO L87 Difference]: Start difference. First operand 25 states and 45 transitions. Second operand 4 states. 59.16/30.67 [2019-03-28 12:41:04,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:04,027 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. 59.16/30.67 [2019-03-28 12:41:04,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 59.16/30.67 [2019-03-28 12:41:04,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 59.16/30.67 [2019-03-28 12:41:04,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:04,028 INFO L225 Difference]: With dead ends: 25 59.16/30.67 [2019-03-28 12:41:04,028 INFO L226 Difference]: Without dead ends: 22 59.16/30.67 [2019-03-28 12:41:04,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 59.16/30.67 [2019-03-28 12:41:04,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 59.16/30.67 [2019-03-28 12:41:04,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 59.16/30.67 [2019-03-28 12:41:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 59.16/30.67 [2019-03-28 12:41:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 39 transitions. 59.16/30.67 [2019-03-28 12:41:04,032 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 39 transitions. Word has length 7 59.16/30.67 [2019-03-28 12:41:04,032 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:04,032 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 39 transitions. 59.16/30.67 [2019-03-28 12:41:04,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 59.16/30.67 [2019-03-28 12:41:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 39 transitions. 59.16/30.67 [2019-03-28 12:41:04,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 59.16/30.67 [2019-03-28 12:41:04,033 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:04,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:04,034 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:04,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:04,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1489457164, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:04,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:04,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:04,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:04,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:04,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 59.16/30.67 [2019-03-28 12:41:04,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 59.16/30.67 [2019-03-28 12:41:04,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 59.16/30.67 [2019-03-28 12:41:04,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 59.16/30.67 [2019-03-28 12:41:04,072 INFO L87 Difference]: Start difference. First operand 22 states and 39 transitions. Second operand 4 states. 59.16/30.67 [2019-03-28 12:41:04,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:04,181 INFO L93 Difference]: Finished difference Result 41 states and 67 transitions. 59.16/30.67 [2019-03-28 12:41:04,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 59.16/30.67 [2019-03-28 12:41:04,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 59.16/30.67 [2019-03-28 12:41:04,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:04,182 INFO L225 Difference]: With dead ends: 41 59.16/30.67 [2019-03-28 12:41:04,182 INFO L226 Difference]: Without dead ends: 38 59.16/30.67 [2019-03-28 12:41:04,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 59.16/30.67 [2019-03-28 12:41:04,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. 59.16/30.67 [2019-03-28 12:41:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. 59.16/30.67 [2019-03-28 12:41:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 59.16/30.67 [2019-03-28 12:41:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 60 transitions. 59.16/30.67 [2019-03-28 12:41:04,189 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 60 transitions. Word has length 7 59.16/30.67 [2019-03-28 12:41:04,189 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:04,189 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 60 transitions. 59.16/30.67 [2019-03-28 12:41:04,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 59.16/30.67 [2019-03-28 12:41:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 60 transitions. 59.16/30.67 [2019-03-28 12:41:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 59.16/30.67 [2019-03-28 12:41:04,190 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:04,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:04,190 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:04,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:04,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1489457165, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:04,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:04,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:04,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:04,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:04,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:04,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 59.16/30.67 [2019-03-28 12:41:04,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 59.16/30.67 [2019-03-28 12:41:04,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 59.16/30.67 [2019-03-28 12:41:04,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 59.16/30.67 [2019-03-28 12:41:04,254 INFO L87 Difference]: Start difference. First operand 30 states and 60 transitions. Second operand 6 states. 59.16/30.67 [2019-03-28 12:41:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:04,375 INFO L93 Difference]: Finished difference Result 38 states and 64 transitions. 59.16/30.67 [2019-03-28 12:41:04,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 59.16/30.67 [2019-03-28 12:41:04,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 59.16/30.67 [2019-03-28 12:41:04,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:04,377 INFO L225 Difference]: With dead ends: 38 59.16/30.67 [2019-03-28 12:41:04,377 INFO L226 Difference]: Without dead ends: 35 59.16/30.67 [2019-03-28 12:41:04,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 59.16/30.67 [2019-03-28 12:41:04,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. 59.16/30.67 [2019-03-28 12:41:04,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. 59.16/30.67 [2019-03-28 12:41:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 59.16/30.67 [2019-03-28 12:41:04,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 57 transitions. 59.16/30.67 [2019-03-28 12:41:04,382 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 57 transitions. Word has length 7 59.16/30.67 [2019-03-28 12:41:04,382 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:04,382 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 57 transitions. 59.16/30.67 [2019-03-28 12:41:04,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 59.16/30.67 [2019-03-28 12:41:04,383 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 57 transitions. 59.16/30.67 [2019-03-28 12:41:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 59.16/30.67 [2019-03-28 12:41:04,383 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:04,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:04,384 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:04,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:04,384 INFO L82 PathProgramCache]: Analyzing trace with hash 27818419, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:04,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:04,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:04,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:04,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:04,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 59.16/30.67 [2019-03-28 12:41:04,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 59.16/30.67 [2019-03-28 12:41:04,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 59.16/30.67 [2019-03-28 12:41:04,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.16/30.67 [2019-03-28 12:41:04,416 INFO L87 Difference]: Start difference. First operand 30 states and 57 transitions. Second operand 3 states. 59.16/30.67 [2019-03-28 12:41:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:04,459 INFO L93 Difference]: Finished difference Result 30 states and 57 transitions. 59.16/30.67 [2019-03-28 12:41:04,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 59.16/30.67 [2019-03-28 12:41:04,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 59.16/30.67 [2019-03-28 12:41:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:04,460 INFO L225 Difference]: With dead ends: 30 59.16/30.67 [2019-03-28 12:41:04,460 INFO L226 Difference]: Without dead ends: 28 59.16/30.67 [2019-03-28 12:41:04,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.16/30.67 [2019-03-28 12:41:04,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 59.16/30.67 [2019-03-28 12:41:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 59.16/30.67 [2019-03-28 12:41:04,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 59.16/30.67 [2019-03-28 12:41:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 51 transitions. 59.16/30.67 [2019-03-28 12:41:04,465 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 51 transitions. Word has length 11 59.16/30.67 [2019-03-28 12:41:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:04,465 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 51 transitions. 59.16/30.67 [2019-03-28 12:41:04,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 59.16/30.67 [2019-03-28 12:41:04,466 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 51 transitions. 59.16/30.67 [2019-03-28 12:41:04,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 59.16/30.67 [2019-03-28 12:41:04,466 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:04,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:04,466 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:04,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:04,467 INFO L82 PathProgramCache]: Analyzing trace with hash 27818421, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:04,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:04,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:04,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:04,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:04,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:04,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 59.16/30.67 [2019-03-28 12:41:04,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 59.16/30.67 [2019-03-28 12:41:04,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 59.16/30.67 [2019-03-28 12:41:04,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 59.16/30.67 [2019-03-28 12:41:04,499 INFO L87 Difference]: Start difference. First operand 28 states and 51 transitions. Second operand 4 states. 59.16/30.67 [2019-03-28 12:41:04,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:04,563 INFO L93 Difference]: Finished difference Result 33 states and 53 transitions. 59.16/30.67 [2019-03-28 12:41:04,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 59.16/30.67 [2019-03-28 12:41:04,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 59.16/30.67 [2019-03-28 12:41:04,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:04,564 INFO L225 Difference]: With dead ends: 33 59.16/30.67 [2019-03-28 12:41:04,564 INFO L226 Difference]: Without dead ends: 31 59.16/30.67 [2019-03-28 12:41:04,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 59.16/30.67 [2019-03-28 12:41:04,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 59.16/30.67 [2019-03-28 12:41:04,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. 59.16/30.67 [2019-03-28 12:41:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 59.16/30.67 [2019-03-28 12:41:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 51 transitions. 59.16/30.67 [2019-03-28 12:41:04,569 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 51 transitions. Word has length 11 59.16/30.67 [2019-03-28 12:41:04,569 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:04,569 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 51 transitions. 59.16/30.67 [2019-03-28 12:41:04,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 59.16/30.67 [2019-03-28 12:41:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 51 transitions. 59.16/30.67 [2019-03-28 12:41:04,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 59.16/30.67 [2019-03-28 12:41:04,570 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:04,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:04,570 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:04,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:04,571 INFO L82 PathProgramCache]: Analyzing trace with hash 27818422, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:04,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:04,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:04,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:04,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:04,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 59.16/30.67 [2019-03-28 12:41:04,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 59.16/30.67 [2019-03-28 12:41:04,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 59.16/30.67 [2019-03-28 12:41:04,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 59.16/30.67 [2019-03-28 12:41:04,625 INFO L87 Difference]: Start difference. First operand 29 states and 51 transitions. Second operand 5 states. 59.16/30.67 [2019-03-28 12:41:04,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:04,721 INFO L93 Difference]: Finished difference Result 31 states and 51 transitions. 59.16/30.67 [2019-03-28 12:41:04,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 59.16/30.67 [2019-03-28 12:41:04,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 59.16/30.67 [2019-03-28 12:41:04,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:04,722 INFO L225 Difference]: With dead ends: 31 59.16/30.67 [2019-03-28 12:41:04,723 INFO L226 Difference]: Without dead ends: 27 59.16/30.67 [2019-03-28 12:41:04,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 59.16/30.67 [2019-03-28 12:41:04,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 59.16/30.67 [2019-03-28 12:41:04,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 59.16/30.67 [2019-03-28 12:41:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 59.16/30.67 [2019-03-28 12:41:04,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. 59.16/30.67 [2019-03-28 12:41:04,727 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 47 transitions. Word has length 11 59.16/30.67 [2019-03-28 12:41:04,727 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:04,727 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 47 transitions. 59.16/30.67 [2019-03-28 12:41:04,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 59.16/30.67 [2019-03-28 12:41:04,727 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 47 transitions. 59.16/30.67 [2019-03-28 12:41:04,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 59.16/30.67 [2019-03-28 12:41:04,728 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:04,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:04,728 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:04,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:04,729 INFO L82 PathProgramCache]: Analyzing trace with hash 27818681, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:04,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:04,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:04,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:04,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:04,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 59.16/30.67 [2019-03-28 12:41:04,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 59.16/30.67 [2019-03-28 12:41:04,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 59.16/30.67 [2019-03-28 12:41:04,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.16/30.67 [2019-03-28 12:41:04,754 INFO L87 Difference]: Start difference. First operand 27 states and 47 transitions. Second operand 3 states. 59.16/30.67 [2019-03-28 12:41:04,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:04,799 INFO L93 Difference]: Finished difference Result 46 states and 79 transitions. 59.16/30.67 [2019-03-28 12:41:04,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 59.16/30.67 [2019-03-28 12:41:04,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 59.16/30.67 [2019-03-28 12:41:04,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:04,800 INFO L225 Difference]: With dead ends: 46 59.16/30.67 [2019-03-28 12:41:04,800 INFO L226 Difference]: Without dead ends: 31 59.16/30.67 [2019-03-28 12:41:04,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.16/30.67 [2019-03-28 12:41:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 59.16/30.67 [2019-03-28 12:41:04,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. 59.16/30.67 [2019-03-28 12:41:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 59.16/30.67 [2019-03-28 12:41:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 49 transitions. 59.16/30.67 [2019-03-28 12:41:04,804 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 49 transitions. Word has length 11 59.16/30.67 [2019-03-28 12:41:04,804 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:04,804 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 49 transitions. 59.16/30.67 [2019-03-28 12:41:04,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 59.16/30.67 [2019-03-28 12:41:04,805 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 49 transitions. 59.16/30.67 [2019-03-28 12:41:04,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 59.16/30.67 [2019-03-28 12:41:04,805 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:04,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:04,806 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:04,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:04,806 INFO L82 PathProgramCache]: Analyzing trace with hash 27848472, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:04,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:04,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:04,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:04,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:04,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:04,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 59.16/30.67 [2019-03-28 12:41:04,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 59.16/30.67 [2019-03-28 12:41:04,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 59.16/30.67 [2019-03-28 12:41:04,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.16/30.67 [2019-03-28 12:41:04,826 INFO L87 Difference]: Start difference. First operand 29 states and 49 transitions. Second operand 3 states. 59.16/30.67 [2019-03-28 12:41:04,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:04,869 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. 59.16/30.67 [2019-03-28 12:41:04,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 59.16/30.67 [2019-03-28 12:41:04,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 59.16/30.67 [2019-03-28 12:41:04,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:04,870 INFO L225 Difference]: With dead ends: 49 59.16/30.67 [2019-03-28 12:41:04,870 INFO L226 Difference]: Without dead ends: 28 59.16/30.67 [2019-03-28 12:41:04,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.16/30.67 [2019-03-28 12:41:04,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 59.16/30.67 [2019-03-28 12:41:04,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 59.16/30.67 [2019-03-28 12:41:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 59.16/30.67 [2019-03-28 12:41:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. 59.16/30.67 [2019-03-28 12:41:04,874 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 42 transitions. Word has length 11 59.16/30.67 [2019-03-28 12:41:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:04,874 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 42 transitions. 59.16/30.67 [2019-03-28 12:41:04,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 59.16/30.67 [2019-03-28 12:41:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. 59.16/30.67 [2019-03-28 12:41:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 59.16/30.67 [2019-03-28 12:41:04,875 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:04,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:04,875 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:04,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:04,876 INFO L82 PathProgramCache]: Analyzing trace with hash -191964867, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:04,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:04,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:04,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:04,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 59.16/30.67 [2019-03-28 12:41:04,928 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 59.16/30.67 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 59.16/30.67 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 59.16/30.67 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 59.16/30.67 [2019-03-28 12:41:04,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:04,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core 59.16/30.67 [2019-03-28 12:41:04,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.16/30.67 [2019-03-28 12:41:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:05,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:05,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 59.16/30.67 [2019-03-28 12:41:05,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 59.16/30.67 [2019-03-28 12:41:05,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 59.16/30.67 [2019-03-28 12:41:05,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 59.16/30.67 [2019-03-28 12:41:05,048 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. Second operand 6 states. 59.16/30.67 [2019-03-28 12:41:05,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:05,135 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. 59.16/30.67 [2019-03-28 12:41:05,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 59.16/30.67 [2019-03-28 12:41:05,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 59.16/30.67 [2019-03-28 12:41:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:05,136 INFO L225 Difference]: With dead ends: 32 59.16/30.67 [2019-03-28 12:41:05,136 INFO L226 Difference]: Without dead ends: 29 59.16/30.67 [2019-03-28 12:41:05,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 59.16/30.67 [2019-03-28 12:41:05,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 59.16/30.67 [2019-03-28 12:41:05,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. 59.16/30.67 [2019-03-28 12:41:05,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 59.16/30.67 [2019-03-28 12:41:05,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. 59.16/30.67 [2019-03-28 12:41:05,140 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 14 59.16/30.67 [2019-03-28 12:41:05,140 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:05,140 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. 59.16/30.67 [2019-03-28 12:41:05,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 59.16/30.67 [2019-03-28 12:41:05,140 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. 59.16/30.67 [2019-03-28 12:41:05,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 59.16/30.67 [2019-03-28 12:41:05,141 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:05,141 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:05,141 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:05,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:05,142 INFO L82 PathProgramCache]: Analyzing trace with hash -191964866, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:05,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:05,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:05,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:05,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:05,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:05,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:05,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:05,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 59.16/30.67 [2019-03-28 12:41:05,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 59.16/30.67 [2019-03-28 12:41:05,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 59.16/30.67 [2019-03-28 12:41:05,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 59.16/30.67 [2019-03-28 12:41:05,249 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 7 states. 59.16/30.67 [2019-03-28 12:41:05,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:05,451 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. 59.16/30.67 [2019-03-28 12:41:05,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 59.16/30.67 [2019-03-28 12:41:05,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 59.16/30.67 [2019-03-28 12:41:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:05,452 INFO L225 Difference]: With dead ends: 55 59.16/30.67 [2019-03-28 12:41:05,452 INFO L226 Difference]: Without dead ends: 29 59.16/30.67 [2019-03-28 12:41:05,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 59.16/30.67 [2019-03-28 12:41:05,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 59.16/30.67 [2019-03-28 12:41:05,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. 59.16/30.67 [2019-03-28 12:41:05,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 59.16/30.67 [2019-03-28 12:41:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. 59.16/30.67 [2019-03-28 12:41:05,455 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 14 59.16/30.67 [2019-03-28 12:41:05,456 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:05,456 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. 59.16/30.67 [2019-03-28 12:41:05,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 59.16/30.67 [2019-03-28 12:41:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. 59.16/30.67 [2019-03-28 12:41:05,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 59.16/30.67 [2019-03-28 12:41:05,456 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:05,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:05,457 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:05,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:05,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1577732512, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:05,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:05,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:05,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:05,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:05,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:05,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:05,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 59.16/30.67 [2019-03-28 12:41:05,634 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 59.16/30.67 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 59.16/30.67 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 59.16/30.67 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 59.16/30.67 [2019-03-28 12:41:05,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:05,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 29 conjunts are in the unsatisfiable core 59.16/30.67 [2019-03-28 12:41:05,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.16/30.67 [2019-03-28 12:41:05,749 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 59.16/30.67 [2019-03-28 12:41:05,750 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:05,762 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:05,763 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:05,764 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 59.16/30.67 [2019-03-28 12:41:05,808 INFO L189 IndexEqualityManager]: detected not equals via solver 59.16/30.67 [2019-03-28 12:41:05,811 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 59.16/30.67 [2019-03-28 12:41:05,811 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:05,829 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:05,831 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:05,831 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:40 59.16/30.67 [2019-03-28 12:41:06,072 INFO L189 IndexEqualityManager]: detected not equals via solver 59.16/30.67 [2019-03-28 12:41:06,114 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:06,114 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 69 59.16/30.67 [2019-03-28 12:41:06,116 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:06,206 INFO L497 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size 59.16/30.67 [2019-03-28 12:41:06,228 INFO L427 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:06,228 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:61, output treesize:72 59.16/30.67 [2019-03-28 12:41:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:06,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:06,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 59.16/30.67 [2019-03-28 12:41:06,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states 59.16/30.67 [2019-03-28 12:41:06,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. 59.16/30.67 [2019-03-28 12:41:06,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 59.16/30.67 [2019-03-28 12:41:06,404 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 18 states. 59.16/30.67 [2019-03-28 12:41:07,079 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 59.16/30.67 [2019-03-28 12:41:07,207 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 59.16/30.67 [2019-03-28 12:41:07,686 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 59.16/30.67 [2019-03-28 12:41:09,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:09,212 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. 59.16/30.67 [2019-03-28 12:41:09,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 59.16/30.67 [2019-03-28 12:41:09,212 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 59.16/30.67 [2019-03-28 12:41:09,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:09,213 INFO L225 Difference]: With dead ends: 75 59.16/30.67 [2019-03-28 12:41:09,213 INFO L226 Difference]: Without dead ends: 72 59.16/30.67 [2019-03-28 12:41:09,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 59.16/30.67 [2019-03-28 12:41:09,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. 59.16/30.67 [2019-03-28 12:41:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 28. 59.16/30.67 [2019-03-28 12:41:09,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 59.16/30.67 [2019-03-28 12:41:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. 59.16/30.67 [2019-03-28 12:41:09,219 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 14 59.16/30.67 [2019-03-28 12:41:09,219 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:09,219 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. 59.16/30.67 [2019-03-28 12:41:09,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. 59.16/30.67 [2019-03-28 12:41:09,219 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. 59.16/30.67 [2019-03-28 12:41:09,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 59.16/30.67 [2019-03-28 12:41:09,220 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:09,220 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:09,220 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:09,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:09,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1513783672, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:09,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:09,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:09,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:09,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:09,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:09,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 59.16/30.67 [2019-03-28 12:41:09,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 59.16/30.67 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 59.16/30.67 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 59.16/30.67 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 59.16/30.67 [2019-03-28 12:41:09,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:09,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core 59.16/30.67 [2019-03-28 12:41:09,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.16/30.67 [2019-03-28 12:41:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:09,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:09,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 59.16/30.67 [2019-03-28 12:41:09,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 59.16/30.67 [2019-03-28 12:41:09,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 59.16/30.67 [2019-03-28 12:41:09,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 59.16/30.67 [2019-03-28 12:41:09,340 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 6 states. 59.16/30.67 [2019-03-28 12:41:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:09,410 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. 59.16/30.67 [2019-03-28 12:41:09,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 59.16/30.67 [2019-03-28 12:41:09,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 59.16/30.67 [2019-03-28 12:41:09,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:09,412 INFO L225 Difference]: With dead ends: 30 59.16/30.67 [2019-03-28 12:41:09,412 INFO L226 Difference]: Without dead ends: 28 59.16/30.67 [2019-03-28 12:41:09,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 59.16/30.67 [2019-03-28 12:41:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 59.16/30.67 [2019-03-28 12:41:09,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 59.16/30.67 [2019-03-28 12:41:09,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 59.16/30.67 [2019-03-28 12:41:09,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. 59.16/30.67 [2019-03-28 12:41:09,416 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 59.16/30.67 [2019-03-28 12:41:09,416 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:09,416 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. 59.16/30.67 [2019-03-28 12:41:09,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 59.16/30.67 [2019-03-28 12:41:09,416 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. 59.16/30.67 [2019-03-28 12:41:09,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 59.16/30.67 [2019-03-28 12:41:09,417 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:09,417 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:09,417 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:09,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:09,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1513783671, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:09,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:09,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:09,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:09,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:09,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:09,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 59.16/30.67 [2019-03-28 12:41:09,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 59.16/30.67 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 59.16/30.67 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 59.16/30.67 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 59.16/30.67 [2019-03-28 12:41:09,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:09,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 20 conjunts are in the unsatisfiable core 59.16/30.67 [2019-03-28 12:41:09,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.16/30.67 [2019-03-28 12:41:09,625 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 59.16/30.67 [2019-03-28 12:41:09,625 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:09,635 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:09,636 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:09,637 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 59.16/30.67 [2019-03-28 12:41:09,805 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:09,806 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 51 59.16/30.67 [2019-03-28 12:41:09,817 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 59.16/30.67 [2019-03-28 12:41:09,934 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 59.16/30.67 [2019-03-28 12:41:09,935 INFO L497 ElimStorePlain]: treesize reduction 8, result has 90.0 percent of original size 59.16/30.67 [2019-03-28 12:41:09,938 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:09,938 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:72 59.16/30.67 [2019-03-28 12:41:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:10,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:10,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 59.16/30.67 [2019-03-28 12:41:10,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 59.16/30.67 [2019-03-28 12:41:10,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 59.16/30.67 [2019-03-28 12:41:10,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 59.16/30.67 [2019-03-28 12:41:10,348 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 17 states. 59.16/30.67 [2019-03-28 12:41:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:11,190 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. 59.16/30.67 [2019-03-28 12:41:11,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 59.16/30.67 [2019-03-28 12:41:11,190 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 59.16/30.67 [2019-03-28 12:41:11,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:11,191 INFO L225 Difference]: With dead ends: 43 59.16/30.67 [2019-03-28 12:41:11,191 INFO L226 Difference]: Without dead ends: 37 59.16/30.67 [2019-03-28 12:41:11,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 59.16/30.67 [2019-03-28 12:41:11,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. 59.16/30.67 [2019-03-28 12:41:11,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. 59.16/30.67 [2019-03-28 12:41:11,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 59.16/30.67 [2019-03-28 12:41:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. 59.16/30.67 [2019-03-28 12:41:11,196 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 18 59.16/30.67 [2019-03-28 12:41:11,197 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:11,197 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. 59.16/30.67 [2019-03-28 12:41:11,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 59.16/30.67 [2019-03-28 12:41:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. 59.16/30.67 [2019-03-28 12:41:11,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 59.16/30.67 [2019-03-28 12:41:11,198 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:11,198 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:11,198 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:11,198 INFO L82 PathProgramCache]: Analyzing trace with hash 25378699, now seen corresponding path program 2 times 59.16/30.67 [2019-03-28 12:41:11,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:11,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:11,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:11,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:11,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:11,421 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:11,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 59.16/30.67 [2019-03-28 12:41:11,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 59.16/30.67 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 59.16/30.67 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 59.16/30.67 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 59.16/30.67 [2019-03-28 12:41:11,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 59.16/30.67 [2019-03-28 12:41:11,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 59.16/30.67 [2019-03-28 12:41:11,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:11,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 24 conjunts are in the unsatisfiable core 59.16/30.67 [2019-03-28 12:41:11,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.16/30.67 [2019-03-28 12:41:11,472 INFO L189 IndexEqualityManager]: detected not equals via solver 59.16/30.67 [2019-03-28 12:41:11,474 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 59.16/30.67 [2019-03-28 12:41:11,474 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:11,486 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:11,487 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:11,487 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 59.16/30.67 [2019-03-28 12:41:11,523 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 59.16/30.67 [2019-03-28 12:41:11,523 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:11,539 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:11,541 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:11,541 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 59.16/30.67 [2019-03-28 12:41:11,582 INFO L189 IndexEqualityManager]: detected not equals via solver 59.16/30.67 [2019-03-28 12:41:11,584 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 59.16/30.67 [2019-03-28 12:41:11,584 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:11,601 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:11,602 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:11,602 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 59.16/30.67 [2019-03-28 12:41:11,680 INFO L189 IndexEqualityManager]: detected not equals via solver 59.16/30.67 [2019-03-28 12:41:11,686 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:11,687 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 59.16/30.67 [2019-03-28 12:41:11,688 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 59.16/30.67 [2019-03-28 12:41:11,708 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:11,710 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:11,710 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:27 59.16/30.67 [2019-03-28 12:41:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:11,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:11,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 59.16/30.67 [2019-03-28 12:41:11,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states 59.16/30.67 [2019-03-28 12:41:11,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 59.16/30.67 [2019-03-28 12:41:11,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 59.16/30.67 [2019-03-28 12:41:11,821 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 15 states. 59.16/30.67 [2019-03-28 12:41:13,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:13,609 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. 59.16/30.67 [2019-03-28 12:41:13,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 59.16/30.67 [2019-03-28 12:41:13,609 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 59.16/30.67 [2019-03-28 12:41:13,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:13,610 INFO L225 Difference]: With dead ends: 77 59.16/30.67 [2019-03-28 12:41:13,610 INFO L226 Difference]: Without dead ends: 76 59.16/30.67 [2019-03-28 12:41:13,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=292, Invalid=830, Unknown=0, NotChecked=0, Total=1122 59.16/30.67 [2019-03-28 12:41:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. 59.16/30.67 [2019-03-28 12:41:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. 59.16/30.67 [2019-03-28 12:41:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. 59.16/30.67 [2019-03-28 12:41:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. 59.16/30.67 [2019-03-28 12:41:13,619 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 21 59.16/30.67 [2019-03-28 12:41:13,619 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:13,620 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. 59.16/30.67 [2019-03-28 12:41:13,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. 59.16/30.67 [2019-03-28 12:41:13,620 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. 59.16/30.67 [2019-03-28 12:41:13,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 59.16/30.67 [2019-03-28 12:41:13,621 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:13,621 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:13,621 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:13,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:13,621 INFO L82 PathProgramCache]: Analyzing trace with hash 63207988, now seen corresponding path program 2 times 59.16/30.67 [2019-03-28 12:41:13,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:13,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:13,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:13,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:13,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:13,920 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:13,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 59.16/30.67 [2019-03-28 12:41:13,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 59.16/30.67 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 59.16/30.67 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 59.16/30.67 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 59.16/30.67 [2019-03-28 12:41:13,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 59.16/30.67 [2019-03-28 12:41:13,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 59.16/30.67 [2019-03-28 12:41:13,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:13,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 25 conjunts are in the unsatisfiable core 59.16/30.67 [2019-03-28 12:41:13,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.16/30.67 [2019-03-28 12:41:13,981 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:13,981 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 59.16/30.67 [2019-03-28 12:41:13,982 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:13,998 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size 59.16/30.67 [2019-03-28 12:41:13,999 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:13,999 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 59.16/30.67 [2019-03-28 12:41:14,019 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 59.16/30.67 [2019-03-28 12:41:14,020 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:14,026 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:14,027 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:14,027 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 59.16/30.67 [2019-03-28 12:41:14,188 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:14,189 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 55 59.16/30.67 [2019-03-28 12:41:14,196 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 59.16/30.67 [2019-03-28 12:41:14,234 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:14,236 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:14,236 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:82 59.16/30.67 [2019-03-28 12:41:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:14,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:14,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 59.16/30.67 [2019-03-28 12:41:14,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 59.16/30.67 [2019-03-28 12:41:14,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 59.16/30.67 [2019-03-28 12:41:14,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 59.16/30.67 [2019-03-28 12:41:14,374 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand 17 states. 59.16/30.67 [2019-03-28 12:41:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:21,951 INFO L93 Difference]: Finished difference Result 127 states and 149 transitions. 59.16/30.67 [2019-03-28 12:41:21,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 59.16/30.67 [2019-03-28 12:41:21,951 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 59.16/30.67 [2019-03-28 12:41:21,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:21,952 INFO L225 Difference]: With dead ends: 127 59.16/30.67 [2019-03-28 12:41:21,952 INFO L226 Difference]: Without dead ends: 121 59.16/30.67 [2019-03-28 12:41:21,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=657, Invalid=1792, Unknown=1, NotChecked=0, Total=2450 59.16/30.67 [2019-03-28 12:41:21,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. 59.16/30.67 [2019-03-28 12:41:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 79. 59.16/30.67 [2019-03-28 12:41:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. 59.16/30.67 [2019-03-28 12:41:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. 59.16/30.67 [2019-03-28 12:41:21,962 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 25 59.16/30.67 [2019-03-28 12:41:21,962 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:21,963 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. 59.16/30.67 [2019-03-28 12:41:21,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 59.16/30.67 [2019-03-28 12:41:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. 59.16/30.67 [2019-03-28 12:41:21,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 59.16/30.67 [2019-03-28 12:41:21,964 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:21,964 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:21,964 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:21,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:21,964 INFO L82 PathProgramCache]: Analyzing trace with hash -688351614, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:21,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:21,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:21,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:21,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:21,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:22,097 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:22,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 59.16/30.67 [2019-03-28 12:41:22,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 59.16/30.67 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 59.16/30.67 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 59.16/30.67 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 59.16/30.67 [2019-03-28 12:41:22,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:22,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 28 conjunts are in the unsatisfiable core 59.16/30.67 [2019-03-28 12:41:22,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.16/30.67 [2019-03-28 12:41:22,154 INFO L189 IndexEqualityManager]: detected not equals via solver 59.16/30.67 [2019-03-28 12:41:22,156 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 59.16/30.67 [2019-03-28 12:41:22,156 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:22,167 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:22,168 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:22,168 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 59.16/30.67 [2019-03-28 12:41:22,196 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 59.16/30.67 [2019-03-28 12:41:22,196 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:22,207 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:22,208 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:22,208 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 59.16/30.67 [2019-03-28 12:41:22,235 INFO L189 IndexEqualityManager]: detected not equals via solver 59.16/30.67 [2019-03-28 12:41:22,236 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 59.16/30.67 [2019-03-28 12:41:22,237 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:22,245 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:22,245 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:22,246 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 59.16/30.67 [2019-03-28 12:41:22,286 INFO L189 IndexEqualityManager]: detected not equals via solver 59.16/30.67 [2019-03-28 12:41:22,293 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:22,293 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 59.16/30.67 [2019-03-28 12:41:22,294 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 59.16/30.67 [2019-03-28 12:41:22,306 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:22,306 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:22,307 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:23 59.16/30.67 [2019-03-28 12:41:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:22,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:22,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 59.16/30.67 [2019-03-28 12:41:22,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states 59.16/30.67 [2019-03-28 12:41:22,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 59.16/30.67 [2019-03-28 12:41:22,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 59.16/30.67 [2019-03-28 12:41:22,408 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 15 states. 59.16/30.67 [2019-03-28 12:41:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:22,953 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. 59.16/30.67 [2019-03-28 12:41:22,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 59.16/30.67 [2019-03-28 12:41:22,954 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 59.16/30.67 [2019-03-28 12:41:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:22,955 INFO L225 Difference]: With dead ends: 85 59.16/30.67 [2019-03-28 12:41:22,955 INFO L226 Difference]: Without dead ends: 84 59.16/30.67 [2019-03-28 12:41:22,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 59.16/30.67 [2019-03-28 12:41:22,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. 59.16/30.67 [2019-03-28 12:41:22,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 41. 59.16/30.67 [2019-03-28 12:41:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 59.16/30.67 [2019-03-28 12:41:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. 59.16/30.67 [2019-03-28 12:41:22,961 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 28 59.16/30.67 [2019-03-28 12:41:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:22,961 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. 59.16/30.67 [2019-03-28 12:41:22,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. 59.16/30.67 [2019-03-28 12:41:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. 59.16/30.67 [2019-03-28 12:41:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 59.16/30.67 [2019-03-28 12:41:22,962 INFO L394 BasicCegarLoop]: Found error trace 59.16/30.67 [2019-03-28 12:41:22,963 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:22,963 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 59.16/30.67 [2019-03-28 12:41:22,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:22,963 INFO L82 PathProgramCache]: Analyzing trace with hash -533234261, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:22,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:22,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:22,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:22,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:22,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:23,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 59.16/30.67 [2019-03-28 12:41:23,105 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 59.16/30.67 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 59.16/30.67 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 59.16/30.67 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 59.16/30.67 [2019-03-28 12:41:23,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:23,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 28 conjunts are in the unsatisfiable core 59.16/30.67 [2019-03-28 12:41:23,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.16/30.67 [2019-03-28 12:41:23,168 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:23,169 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 59.16/30.67 [2019-03-28 12:41:23,169 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:23,186 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size 59.16/30.67 [2019-03-28 12:41:23,187 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:23,187 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 59.16/30.67 [2019-03-28 12:41:23,191 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 59.16/30.67 [2019-03-28 12:41:23,191 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:23,193 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:23,193 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:23,193 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 59.16/30.67 [2019-03-28 12:41:23,274 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:23,274 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 55 59.16/30.67 [2019-03-28 12:41:23,280 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 59.16/30.67 [2019-03-28 12:41:23,310 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 59.16/30.67 [2019-03-28 12:41:23,311 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 59.16/30.67 [2019-03-28 12:41:23,311 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:76 59.16/30.67 [2019-03-28 12:41:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:23,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 59.16/30.67 [2019-03-28 12:41:23,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 59.16/30.67 [2019-03-28 12:41:23,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states 59.16/30.67 [2019-03-28 12:41:23,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 59.16/30.67 [2019-03-28 12:41:23,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 59.16/30.67 [2019-03-28 12:41:23,406 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 15 states. 59.16/30.67 [2019-03-28 12:41:23,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.67 [2019-03-28 12:41:23,893 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. 59.16/30.67 [2019-03-28 12:41:23,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 59.16/30.67 [2019-03-28 12:41:23,894 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 59.16/30.67 [2019-03-28 12:41:23,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.16/30.67 [2019-03-28 12:41:23,894 INFO L225 Difference]: With dead ends: 51 59.16/30.67 [2019-03-28 12:41:23,894 INFO L226 Difference]: Without dead ends: 0 59.16/30.67 [2019-03-28 12:41:23,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 59.16/30.67 [2019-03-28 12:41:23,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 59.16/30.67 [2019-03-28 12:41:23,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 59.16/30.67 [2019-03-28 12:41:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 59.16/30.67 [2019-03-28 12:41:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 59.16/30.67 [2019-03-28 12:41:23,896 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 59.16/30.67 [2019-03-28 12:41:23,896 INFO L84 Accepts]: Finished accepts. word is rejected. 59.16/30.67 [2019-03-28 12:41:23,896 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 59.16/30.67 [2019-03-28 12:41:23,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. 59.16/30.67 [2019-03-28 12:41:23,896 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 59.16/30.67 [2019-03-28 12:41:23,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 59.16/30.67 [2019-03-28 12:41:23,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 59.16/30.67 [2019-03-28 12:41:24,047 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 207 59.16/30.67 [2019-03-28 12:41:25,136 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 207 DAG size of output: 79 59.16/30.67 [2019-03-28 12:41:25,140 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,140 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,140 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,140 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,140 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,141 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,141 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,141 INFO L448 ceAbstractionStarter]: For program point L29-2(lines 26 40) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,141 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,141 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,141 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,141 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,141 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 38) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,142 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 38) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,142 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,142 INFO L448 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,142 INFO L448 ceAbstractionStarter]: For program point L15-3(line 15) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,142 INFO L448 ceAbstractionStarter]: For program point L15-4(line 15) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,142 INFO L448 ceAbstractionStarter]: For program point L15-5(line 15) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,142 INFO L448 ceAbstractionStarter]: For program point L15-7(lines 15 18) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,143 INFO L444 ceAbstractionStarter]: At program point L15-9(lines 15 18) the Hoare annotation is: (let ((.cse20 (select |#length| ULTIMATE.start_cstrcmp_~s2.base)) (.cse19 (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base)) (.cse18 (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base)) (.cse22 (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (.cse21 (select |#length| ULTIMATE.start_cstrcmp_~s1.base))) (let ((.cse13 (= ULTIMATE.start_cstrcmp_~s1.offset 0)) (.cse3 (<= 1 .cse21)) (.cse8 (= ULTIMATE.start_cstrcmp_~s2.offset 0)) (.cse1 (= (select |#valid| ULTIMATE.start_cstrcmp_~s2.base) 1)) (.cse4 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse5 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse2 (= ULTIMATE.start_main_~length1~0 .cse22)) (.cse6 (= (select |#valid| ULTIMATE.start_cstrcmp_~s1.base) 1)) (.cse7 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse15 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse9 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s2.base) (+ ULTIMATE.start_main_~nondetString2~0.offset (select |#length| ULTIMATE.start_cstrcmp_~s2.base) (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset)))) (.cse10 (= 0 (select .cse18 (+ ULTIMATE.start_main_~nondetString1~0.offset .cse22 (- 1))))) (.cse11 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse12 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse0 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse14 (= 0 (select .cse19 (+ .cse21 (- 1))))) (.cse16 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse17 (<= (+ ULTIMATE.start_cstrcmp_~s2.offset 1) .cse20))) (or (and .cse0 (and (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17) (and .cse1 .cse2 .cse12 .cse13 (= 0 (select .cse18 ULTIMATE.start_main_~nondetString1~0.offset)) .cse16 .cse15 .cse3 (= 1 ULTIMATE.start_main_~length1~0) .cse8 (= 0 (select .cse19 ULTIMATE.start_cstrcmp_~s1.offset)) .cse5 .cse11 .cse0 (<= 1 .cse20) .cse6 .cse7) (and (and (and .cse1 .cse4 .cse5 .cse2 (<= 1 ULTIMATE.start_cstrcmp_~s1.offset) .cse6 .cse7 .cse15) .cse9 .cse10 (<= (+ ULTIMATE.start_cstrcmp_~s1.offset 1) .cse21) .cse11 .cse12 .cse0 (<= 1 ULTIMATE.start_cstrcmp_~s2.offset) .cse14) .cse16 .cse17)))) 59.16/30.67 [2019-03-28 12:41:25,143 INFO L448 ceAbstractionStarter]: For program point L15-10(lines 15 18) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,143 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,143 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,143 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 32 34) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,143 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,143 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,144 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,144 INFO L448 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. 59.16/30.67 [2019-03-28 12:41:25,144 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 59.16/30.67 [2019-03-28 12:41:25,154 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.67 [2019-03-28 12:41:25,155 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.67 [2019-03-28 12:41:25,155 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.67 [2019-03-28 12:41:25,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.67 [2019-03-28 12:41:25,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.67 [2019-03-28 12:41:25,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.67 [2019-03-28 12:41:25,162 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,162 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,163 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,163 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,163 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,168 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,168 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,168 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,169 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,169 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,169 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,170 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,170 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,170 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,170 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.67 [2019-03-28 12:41:25,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.67 [2019-03-28 12:41:25,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.67 [2019-03-28 12:41:25,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.67 [2019-03-28 12:41:25,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.67 [2019-03-28 12:41:25,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.67 [2019-03-28 12:41:25,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.67 [2019-03-28 12:41:25,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.67 [2019-03-28 12:41:25,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:41:25 BasicIcfg 59.16/30.67 [2019-03-28 12:41:25,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 59.16/30.67 [2019-03-28 12:41:25,197 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 59.16/30.67 [2019-03-28 12:41:25,197 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 59.16/30.67 [2019-03-28 12:41:25,201 INFO L276 PluginConnector]: BuchiAutomizer initialized 59.16/30.67 [2019-03-28 12:41:25,201 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 59.16/30.67 [2019-03-28 12:41:25,201 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:41:01" (1/5) ... 59.16/30.67 [2019-03-28 12:41:25,202 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c3219d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:41:25, skipping insertion in model container 59.16/30.67 [2019-03-28 12:41:25,202 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 59.16/30.67 [2019-03-28 12:41:25,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:02" (2/5) ... 59.16/30.67 [2019-03-28 12:41:25,203 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c3219d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:41:25, skipping insertion in model container 59.16/30.67 [2019-03-28 12:41:25,203 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 59.16/30.67 [2019-03-28 12:41:25,203 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:02" (3/5) ... 59.16/30.67 [2019-03-28 12:41:25,203 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c3219d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:25, skipping insertion in model container 59.16/30.67 [2019-03-28 12:41:25,203 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 59.16/30.67 [2019-03-28 12:41:25,203 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:41:02" (4/5) ... 59.16/30.67 [2019-03-28 12:41:25,204 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c3219d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:25, skipping insertion in model container 59.16/30.67 [2019-03-28 12:41:25,204 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 59.16/30.67 [2019-03-28 12:41:25,204 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:41:25" (5/5) ... 59.16/30.67 [2019-03-28 12:41:25,205 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 59.16/30.67 [2019-03-28 12:41:25,228 INFO L133 ementStrategyFactory]: Using default assertion order modulation 59.16/30.67 [2019-03-28 12:41:25,228 INFO L374 BuchiCegarLoop]: Interprodecural is true 59.16/30.67 [2019-03-28 12:41:25,228 INFO L375 BuchiCegarLoop]: Hoare is true 59.16/30.67 [2019-03-28 12:41:25,228 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 59.16/30.67 [2019-03-28 12:41:25,228 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 59.16/30.67 [2019-03-28 12:41:25,228 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 59.16/30.67 [2019-03-28 12:41:25,228 INFO L379 BuchiCegarLoop]: Difference is false 59.16/30.67 [2019-03-28 12:41:25,229 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 59.16/30.67 [2019-03-28 12:41:25,229 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 59.16/30.67 [2019-03-28 12:41:25,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. 59.16/30.67 [2019-03-28 12:41:25,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 59.16/30.67 [2019-03-28 12:41:25,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 59.16/30.67 [2019-03-28 12:41:25,238 INFO L119 BuchiIsEmpty]: Starting construction of run 59.16/30.67 [2019-03-28 12:41:25,242 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:25,242 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:25,242 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 59.16/30.67 [2019-03-28 12:41:25,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. 59.16/30.67 [2019-03-28 12:41:25,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 59.16/30.67 [2019-03-28 12:41:25,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 59.16/30.67 [2019-03-28 12:41:25,244 INFO L119 BuchiIsEmpty]: Starting construction of run 59.16/30.67 [2019-03-28 12:41:25,244 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:25,244 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 59.16/30.67 [2019-03-28 12:41:25,250 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue [176] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 6#L29true [116] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 4#L29-2true [75] L29-2-->L32-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 8#L32-1true [139] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 14#L37true [93] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 31#L37-1true [177] L37-1-->L15-9: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_cstrcmp_~s2.base_11) (<= 1 .cse0) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2| v_ULTIMATE.start_cstrcmp_~s2.offset_9) (= |v_ULTIMATE.start_cstrcmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrcmp_~s1.base_14 |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_11) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrcmp_#t~post4.offset=|v_ULTIMATE.start_cstrcmp_#t~post4.offset_4|, ULTIMATE.start_cstrcmp_#in~s2.offset=|v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_10|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_6|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_6|, ULTIMATE.start_cstrcmp_#t~post5.base=|v_ULTIMATE.start_cstrcmp_#t~post5.base_4|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_11, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_6|, ULTIMATE.start_cstrcmp_#t~mem7=|v_ULTIMATE.start_cstrcmp_#t~mem7_5|, ULTIMATE.start_cstrcmp_#t~mem6=|v_ULTIMATE.start_cstrcmp_#t~mem6_5|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_14, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_11, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrcmp_~uc1~0=v_ULTIMATE.start_cstrcmp_~uc1~0_6, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_9, ULTIMATE.start_cstrcmp_#t~ite8=|v_ULTIMATE.start_cstrcmp_#t~ite8_6|, ULTIMATE.start_cstrcmp_#t~post5.offset=|v_ULTIMATE.start_cstrcmp_#t~post5.offset_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrcmp_~uc2~0=v_ULTIMATE.start_cstrcmp_~uc2~0_6, ULTIMATE.start_cstrcmp_#res=|v_ULTIMATE.start_cstrcmp_#res_4|, ULTIMATE.start_cstrcmp_#t~post4.base=|v_ULTIMATE.start_cstrcmp_#t~post4.base_4|, #valid=|v_#valid_25|, ULTIMATE.start_cstrcmp_#in~s1.offset=|v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrcmp_#in~s2.base=|v_ULTIMATE.start_cstrcmp_#in~s2.base_2|, ULTIMATE.start_cstrcmp_#in~s1.base=|v_ULTIMATE.start_cstrcmp_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post4.offset, ULTIMATE.start_cstrcmp_#in~s2.offset, ULTIMATE.start_cstrcmp_#t~short3, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~ite8, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~post5.offset, ULTIMATE.start_cstrcmp_#t~mem0, ULTIMATE.start_cstrcmp_#t~post5.base, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem7, ULTIMATE.start_cstrcmp_~uc2~0, ULTIMATE.start_cstrcmp_#t~mem6, ULTIMATE.start_cstrcmp_#res, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post4.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#in~s1.offset, #memory_int, ULTIMATE.start_cstrcmp_#in~s2.base, ULTIMATE.start_cstrcmp_#in~s1.base, ULTIMATE.start_cstrcmp_~uc1~0] 5#L15-9true 59.16/30.67 [2019-03-28 12:41:25,250 INFO L796 eck$LassoCheckResult]: Loop: 5#L15-9true [79] L15-9-->L15-1: Formula: (and (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrcmp_~s1.base_3) v_ULTIMATE.start_cstrcmp_~s1.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem0_2|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_3)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_2|, #length=|v_#length_8|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem0] 30#L15-1true [156] L15-1-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_cstrcmp_#t~mem0_3|) |v_ULTIMATE.start_cstrcmp_#t~short3_2|) InVars {ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_3|} OutVars{ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_3|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short3] 28#L15-2true [111] L15-2-->L15-7: Formula: (not |v_ULTIMATE.start_cstrcmp_#t~short3_5|) InVars {ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_5|} OutVars{ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_5|} AuxVars[] AssignedVars[] 7#L15-7true [85] L15-7-->L15-9: Formula: (and (= v_ULTIMATE.start_cstrcmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrcmp_~s1.offset_8 1)) |v_ULTIMATE.start_cstrcmp_#t~short3_9| (= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_6 1) v_ULTIMATE.start_cstrcmp_~s2.offset_5) (= v_ULTIMATE.start_cstrcmp_~s1.base_9 v_ULTIMATE.start_cstrcmp_~s1.base_10) (= v_ULTIMATE.start_cstrcmp_~s2.base_7 v_ULTIMATE.start_cstrcmp_~s2.base_6)) InVars {ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_6, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_9|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_8, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_10, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_7} OutVars{ULTIMATE.start_cstrcmp_#t~post4.offset=|v_ULTIMATE.start_cstrcmp_#t~post4.offset_2|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_5, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_8|, ULTIMATE.start_cstrcmp_#t~post5.offset=|v_ULTIMATE.start_cstrcmp_#t~post5.offset_2|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_5|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_5|, ULTIMATE.start_cstrcmp_#t~post5.base=|v_ULTIMATE.start_cstrcmp_#t~post5.base_2|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_7, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~post4.base=|v_ULTIMATE.start_cstrcmp_#t~post4.base_2|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_9, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post4.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~short3, ULTIMATE.start_cstrcmp_#t~post4.base, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#t~post5.offset, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~mem0, ULTIMATE.start_cstrcmp_#t~post5.base, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2] 5#L15-9true 59.16/30.67 [2019-03-28 12:41:25,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:25,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1740766361, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:25,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:25,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:25,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:25,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:25,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.16/30.67 [2019-03-28 12:41:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.16/30.67 [2019-03-28 12:41:25,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.67 [2019-03-28 12:41:25,283 INFO L82 PathProgramCache]: Analyzing trace with hash 3430452, now seen corresponding path program 1 times 59.16/30.67 [2019-03-28 12:41:25,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.67 [2019-03-28 12:41:25,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.67 [2019-03-28 12:41:25,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:25,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:25,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.67 [2019-03-28 12:41:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.67 [2019-03-28 12:41:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.67 [2019-03-28 12:41:25,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.16/30.68 [2019-03-28 12:41:25,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 59.16/30.68 [2019-03-28 12:41:25,291 INFO L811 eck$LassoCheckResult]: loop already infeasible 59.16/30.68 [2019-03-28 12:41:25,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 59.16/30.68 [2019-03-28 12:41:25,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.16/30.68 [2019-03-28 12:41:25,293 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. 59.16/30.68 [2019-03-28 12:41:25,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.68 [2019-03-28 12:41:25,358 INFO L93 Difference]: Finished difference Result 31 states and 55 transitions. 59.16/30.68 [2019-03-28 12:41:25,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 59.16/30.68 [2019-03-28 12:41:25,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 55 transitions. 59.16/30.68 [2019-03-28 12:41:25,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 59.16/30.68 [2019-03-28 12:41:25,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 15 states and 25 transitions. 59.16/30.68 [2019-03-28 12:41:25,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 59.16/30.68 [2019-03-28 12:41:25,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 59.16/30.68 [2019-03-28 12:41:25,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 25 transitions. 59.16/30.68 [2019-03-28 12:41:25,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 59.16/30.68 [2019-03-28 12:41:25,365 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 25 transitions. 59.16/30.68 [2019-03-28 12:41:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 25 transitions. 59.16/30.68 [2019-03-28 12:41:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. 59.16/30.68 [2019-03-28 12:41:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 59.16/30.68 [2019-03-28 12:41:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 24 transitions. 59.16/30.68 [2019-03-28 12:41:25,368 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 24 transitions. 59.16/30.68 [2019-03-28 12:41:25,368 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 24 transitions. 59.16/30.68 [2019-03-28 12:41:25,368 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 59.16/30.68 [2019-03-28 12:41:25,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 24 transitions. 59.16/30.68 [2019-03-28 12:41:25,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 59.16/30.68 [2019-03-28 12:41:25,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 59.16/30.68 [2019-03-28 12:41:25,369 INFO L119 BuchiIsEmpty]: Starting construction of run 59.16/30.68 [2019-03-28 12:41:25,369 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 59.16/30.68 [2019-03-28 12:41:25,369 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 59.16/30.68 [2019-03-28 12:41:25,370 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRY [176] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 75#L29 [116] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 71#L29-2 [75] L29-2-->L32-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 72#L32-1 [139] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 69#L37 [93] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 70#L37-1 [177] L37-1-->L15-9: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_cstrcmp_~s2.base_11) (<= 1 .cse0) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2| v_ULTIMATE.start_cstrcmp_~s2.offset_9) (= |v_ULTIMATE.start_cstrcmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrcmp_~s1.base_14 |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_11) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrcmp_#t~post4.offset=|v_ULTIMATE.start_cstrcmp_#t~post4.offset_4|, ULTIMATE.start_cstrcmp_#in~s2.offset=|v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_10|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_6|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_6|, ULTIMATE.start_cstrcmp_#t~post5.base=|v_ULTIMATE.start_cstrcmp_#t~post5.base_4|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_11, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_6|, ULTIMATE.start_cstrcmp_#t~mem7=|v_ULTIMATE.start_cstrcmp_#t~mem7_5|, ULTIMATE.start_cstrcmp_#t~mem6=|v_ULTIMATE.start_cstrcmp_#t~mem6_5|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_14, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_11, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrcmp_~uc1~0=v_ULTIMATE.start_cstrcmp_~uc1~0_6, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_9, ULTIMATE.start_cstrcmp_#t~ite8=|v_ULTIMATE.start_cstrcmp_#t~ite8_6|, ULTIMATE.start_cstrcmp_#t~post5.offset=|v_ULTIMATE.start_cstrcmp_#t~post5.offset_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrcmp_~uc2~0=v_ULTIMATE.start_cstrcmp_~uc2~0_6, ULTIMATE.start_cstrcmp_#res=|v_ULTIMATE.start_cstrcmp_#res_4|, ULTIMATE.start_cstrcmp_#t~post4.base=|v_ULTIMATE.start_cstrcmp_#t~post4.base_4|, #valid=|v_#valid_25|, ULTIMATE.start_cstrcmp_#in~s1.offset=|v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrcmp_#in~s2.base=|v_ULTIMATE.start_cstrcmp_#in~s2.base_2|, ULTIMATE.start_cstrcmp_#in~s1.base=|v_ULTIMATE.start_cstrcmp_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post4.offset, ULTIMATE.start_cstrcmp_#in~s2.offset, ULTIMATE.start_cstrcmp_#t~short3, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~ite8, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~post5.offset, ULTIMATE.start_cstrcmp_#t~mem0, ULTIMATE.start_cstrcmp_#t~post5.base, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem7, ULTIMATE.start_cstrcmp_~uc2~0, ULTIMATE.start_cstrcmp_#t~mem6, ULTIMATE.start_cstrcmp_#res, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post4.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#in~s1.offset, #memory_int, ULTIMATE.start_cstrcmp_#in~s2.base, ULTIMATE.start_cstrcmp_#in~s1.base, ULTIMATE.start_cstrcmp_~uc1~0] 73#L15-9 59.16/30.68 [2019-03-28 12:41:25,370 INFO L796 eck$LassoCheckResult]: Loop: 73#L15-9 [79] L15-9-->L15-1: Formula: (and (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrcmp_~s1.base_3) v_ULTIMATE.start_cstrcmp_~s1.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem0_2|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_3)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_2|, #length=|v_#length_8|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem0] 74#L15-1 [157] L15-1-->L15-2: Formula: (and (= 0 |v_ULTIMATE.start_cstrcmp_#t~mem0_3|) (not |v_ULTIMATE.start_cstrcmp_#t~short3_2|)) InVars {ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_3|} OutVars{ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_3|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short3] 82#L15-2 [111] L15-2-->L15-7: Formula: (not |v_ULTIMATE.start_cstrcmp_#t~short3_5|) InVars {ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_5|} OutVars{ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_5|} AuxVars[] AssignedVars[] 76#L15-7 [85] L15-7-->L15-9: Formula: (and (= v_ULTIMATE.start_cstrcmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrcmp_~s1.offset_8 1)) |v_ULTIMATE.start_cstrcmp_#t~short3_9| (= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_6 1) v_ULTIMATE.start_cstrcmp_~s2.offset_5) (= v_ULTIMATE.start_cstrcmp_~s1.base_9 v_ULTIMATE.start_cstrcmp_~s1.base_10) (= v_ULTIMATE.start_cstrcmp_~s2.base_7 v_ULTIMATE.start_cstrcmp_~s2.base_6)) InVars {ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_6, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_9|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_8, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_10, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_7} OutVars{ULTIMATE.start_cstrcmp_#t~post4.offset=|v_ULTIMATE.start_cstrcmp_#t~post4.offset_2|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_5, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_8|, ULTIMATE.start_cstrcmp_#t~post5.offset=|v_ULTIMATE.start_cstrcmp_#t~post5.offset_2|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_5|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_5|, ULTIMATE.start_cstrcmp_#t~post5.base=|v_ULTIMATE.start_cstrcmp_#t~post5.base_2|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_7, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~post4.base=|v_ULTIMATE.start_cstrcmp_#t~post4.base_2|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_9, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post4.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~short3, ULTIMATE.start_cstrcmp_#t~post4.base, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#t~post5.offset, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~mem0, ULTIMATE.start_cstrcmp_#t~post5.base, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2] 73#L15-9 59.16/30.68 [2019-03-28 12:41:25,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.68 [2019-03-28 12:41:25,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1740766361, now seen corresponding path program 2 times 59.16/30.68 [2019-03-28 12:41:25,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.68 [2019-03-28 12:41:25,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.68 [2019-03-28 12:41:25,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.16/30.68 [2019-03-28 12:41:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.16/30.68 [2019-03-28 12:41:25,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.68 [2019-03-28 12:41:25,384 INFO L82 PathProgramCache]: Analyzing trace with hash 3431413, now seen corresponding path program 1 times 59.16/30.68 [2019-03-28 12:41:25,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.68 [2019-03-28 12:41:25,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.68 [2019-03-28 12:41:25,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.68 [2019-03-28 12:41:25,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.68 [2019-03-28 12:41:25,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.16/30.68 [2019-03-28 12:41:25,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 59.16/30.68 [2019-03-28 12:41:25,392 INFO L811 eck$LassoCheckResult]: loop already infeasible 59.16/30.68 [2019-03-28 12:41:25,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 59.16/30.68 [2019-03-28 12:41:25,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.16/30.68 [2019-03-28 12:41:25,392 INFO L87 Difference]: Start difference. First operand 14 states and 24 transitions. cyclomatic complexity: 11 Second operand 3 states. 59.16/30.68 [2019-03-28 12:41:25,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.68 [2019-03-28 12:41:25,418 INFO L93 Difference]: Finished difference Result 15 states and 23 transitions. 59.16/30.68 [2019-03-28 12:41:25,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 59.16/30.68 [2019-03-28 12:41:25,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. 59.16/30.68 [2019-03-28 12:41:25,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 59.16/30.68 [2019-03-28 12:41:25,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. 59.16/30.68 [2019-03-28 12:41:25,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 59.16/30.68 [2019-03-28 12:41:25,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 59.16/30.68 [2019-03-28 12:41:25,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. 59.16/30.68 [2019-03-28 12:41:25,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 59.16/30.68 [2019-03-28 12:41:25,420 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. 59.16/30.68 [2019-03-28 12:41:25,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. 59.16/30.68 [2019-03-28 12:41:25,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. 59.16/30.68 [2019-03-28 12:41:25,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 59.16/30.68 [2019-03-28 12:41:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. 59.16/30.68 [2019-03-28 12:41:25,422 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. 59.16/30.68 [2019-03-28 12:41:25,422 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. 59.16/30.68 [2019-03-28 12:41:25,422 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 59.16/30.68 [2019-03-28 12:41:25,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. 59.16/30.68 [2019-03-28 12:41:25,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 59.16/30.68 [2019-03-28 12:41:25,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 59.16/30.68 [2019-03-28 12:41:25,423 INFO L119 BuchiIsEmpty]: Starting construction of run 59.16/30.68 [2019-03-28 12:41:25,423 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 59.16/30.68 [2019-03-28 12:41:25,423 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 59.16/30.68 [2019-03-28 12:41:25,424 INFO L794 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY [176] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 110#L29 [116] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 106#L29-2 [75] L29-2-->L32-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 107#L32-1 [139] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 104#L37 [93] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 105#L37-1 [177] L37-1-->L15-9: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_cstrcmp_~s2.base_11) (<= 1 .cse0) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2| v_ULTIMATE.start_cstrcmp_~s2.offset_9) (= |v_ULTIMATE.start_cstrcmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrcmp_~s1.base_14 |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_11) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrcmp_#t~post4.offset=|v_ULTIMATE.start_cstrcmp_#t~post4.offset_4|, ULTIMATE.start_cstrcmp_#in~s2.offset=|v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_10|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_6|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_6|, ULTIMATE.start_cstrcmp_#t~post5.base=|v_ULTIMATE.start_cstrcmp_#t~post5.base_4|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_11, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_6|, ULTIMATE.start_cstrcmp_#t~mem7=|v_ULTIMATE.start_cstrcmp_#t~mem7_5|, ULTIMATE.start_cstrcmp_#t~mem6=|v_ULTIMATE.start_cstrcmp_#t~mem6_5|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_14, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_11, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrcmp_~uc1~0=v_ULTIMATE.start_cstrcmp_~uc1~0_6, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_9, ULTIMATE.start_cstrcmp_#t~ite8=|v_ULTIMATE.start_cstrcmp_#t~ite8_6|, ULTIMATE.start_cstrcmp_#t~post5.offset=|v_ULTIMATE.start_cstrcmp_#t~post5.offset_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrcmp_~uc2~0=v_ULTIMATE.start_cstrcmp_~uc2~0_6, ULTIMATE.start_cstrcmp_#res=|v_ULTIMATE.start_cstrcmp_#res_4|, ULTIMATE.start_cstrcmp_#t~post4.base=|v_ULTIMATE.start_cstrcmp_#t~post4.base_4|, #valid=|v_#valid_25|, ULTIMATE.start_cstrcmp_#in~s1.offset=|v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrcmp_#in~s2.base=|v_ULTIMATE.start_cstrcmp_#in~s2.base_2|, ULTIMATE.start_cstrcmp_#in~s1.base=|v_ULTIMATE.start_cstrcmp_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post4.offset, ULTIMATE.start_cstrcmp_#in~s2.offset, ULTIMATE.start_cstrcmp_#t~short3, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~ite8, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~post5.offset, ULTIMATE.start_cstrcmp_#t~mem0, ULTIMATE.start_cstrcmp_#t~post5.base, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem7, ULTIMATE.start_cstrcmp_~uc2~0, ULTIMATE.start_cstrcmp_#t~mem6, ULTIMATE.start_cstrcmp_#res, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post4.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#in~s1.offset, #memory_int, ULTIMATE.start_cstrcmp_#in~s2.base, ULTIMATE.start_cstrcmp_#in~s1.base, ULTIMATE.start_cstrcmp_~uc1~0] 108#L15-9 59.16/30.68 [2019-03-28 12:41:25,424 INFO L796 eck$LassoCheckResult]: Loop: 108#L15-9 [79] L15-9-->L15-1: Formula: (and (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrcmp_~s1.base_3) v_ULTIMATE.start_cstrcmp_~s1.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem0_2|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_3)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_2|, #length=|v_#length_8|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem0] 109#L15-1 [156] L15-1-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_cstrcmp_#t~mem0_3|) |v_ULTIMATE.start_cstrcmp_#t~short3_2|) InVars {ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_3|} OutVars{ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_3|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short3] 116#L15-2 [110] L15-2-->L15-3: Formula: |v_ULTIMATE.start_cstrcmp_#t~short3_3| InVars {ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_3|} OutVars{ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_3|} AuxVars[] AssignedVars[] 115#L15-3 [107] L15-3-->L15-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_5 1) (select |v_#length_10| v_ULTIMATE.start_cstrcmp_~s1.base_6)) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_5) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrcmp_~s1.base_6) v_ULTIMATE.start_cstrcmp_~s1.offset_5) |v_ULTIMATE.start_cstrcmp_#t~mem1_2|) (= (select |v_#valid_15| v_ULTIMATE.start_cstrcmp_~s1.base_6) 1)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_5, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_6, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_6, #valid=|v_#valid_15|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_2|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem1] 114#L15-4 [101] L15-4-->L15-5: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_cstrcmp_~s2.base_3)) (<= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_3 1) (select |v_#length_12| v_ULTIMATE.start_cstrcmp_~s2.base_3)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrcmp_~s2.base_3) v_ULTIMATE.start_cstrcmp_~s2.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem2_2|) (<= 0 v_ULTIMATE.start_cstrcmp_~s2.offset_3)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_3, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_3, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_3, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_3, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem2] 112#L15-5 [173] L15-5-->L15-7: Formula: (and |v_ULTIMATE.start_cstrcmp_#t~short3_4| (= |v_ULTIMATE.start_cstrcmp_#t~mem1_3| |v_ULTIMATE.start_cstrcmp_#t~mem2_3|)) InVars {ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_3|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} OutVars{ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_3|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_4|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short3] 111#L15-7 [85] L15-7-->L15-9: Formula: (and (= v_ULTIMATE.start_cstrcmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrcmp_~s1.offset_8 1)) |v_ULTIMATE.start_cstrcmp_#t~short3_9| (= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_6 1) v_ULTIMATE.start_cstrcmp_~s2.offset_5) (= v_ULTIMATE.start_cstrcmp_~s1.base_9 v_ULTIMATE.start_cstrcmp_~s1.base_10) (= v_ULTIMATE.start_cstrcmp_~s2.base_7 v_ULTIMATE.start_cstrcmp_~s2.base_6)) InVars {ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_6, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_9|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_8, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_10, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_7} OutVars{ULTIMATE.start_cstrcmp_#t~post4.offset=|v_ULTIMATE.start_cstrcmp_#t~post4.offset_2|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_5, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_8|, ULTIMATE.start_cstrcmp_#t~post5.offset=|v_ULTIMATE.start_cstrcmp_#t~post5.offset_2|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_5|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_5|, ULTIMATE.start_cstrcmp_#t~post5.base=|v_ULTIMATE.start_cstrcmp_#t~post5.base_2|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_7, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~post4.base=|v_ULTIMATE.start_cstrcmp_#t~post4.base_2|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_9, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post4.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~short3, ULTIMATE.start_cstrcmp_#t~post4.base, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#t~post5.offset, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~mem0, ULTIMATE.start_cstrcmp_#t~post5.base, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2] 108#L15-9 59.16/30.68 [2019-03-28 12:41:25,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.68 [2019-03-28 12:41:25,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1740766361, now seen corresponding path program 3 times 59.16/30.68 [2019-03-28 12:41:25,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.68 [2019-03-28 12:41:25,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.68 [2019-03-28 12:41:25,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.16/30.68 [2019-03-28 12:41:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.16/30.68 [2019-03-28 12:41:25,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.68 [2019-03-28 12:41:25,437 INFO L82 PathProgramCache]: Analyzing trace with hash -882785182, now seen corresponding path program 1 times 59.16/30.68 [2019-03-28 12:41:25,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.68 [2019-03-28 12:41:25,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.68 [2019-03-28 12:41:25,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.16/30.68 [2019-03-28 12:41:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.16/30.68 [2019-03-28 12:41:25,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.68 [2019-03-28 12:41:25,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1369510710, now seen corresponding path program 1 times 59.16/30.68 [2019-03-28 12:41:25,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.68 [2019-03-28 12:41:25,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.68 [2019-03-28 12:41:25,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.68 [2019-03-28 12:41:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.68 [2019-03-28 12:41:25,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.16/30.68 [2019-03-28 12:41:25,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 59.16/30.68 [2019-03-28 12:41:25,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 59.16/30.68 [2019-03-28 12:41:25,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 59.16/30.68 [2019-03-28 12:41:25,599 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. cyclomatic complexity: 7 Second operand 9 states. 59.16/30.68 [2019-03-28 12:41:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.16/30.68 [2019-03-28 12:41:25,764 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. 59.16/30.68 [2019-03-28 12:41:25,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 59.16/30.68 [2019-03-28 12:41:25,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. 59.16/30.68 [2019-03-28 12:41:25,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 59.16/30.68 [2019-03-28 12:41:25,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 13 states and 18 transitions. 59.16/30.68 [2019-03-28 12:41:25,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 59.16/30.68 [2019-03-28 12:41:25,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 59.16/30.68 [2019-03-28 12:41:25,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. 59.16/30.68 [2019-03-28 12:41:25,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 59.16/30.68 [2019-03-28 12:41:25,766 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. 59.16/30.68 [2019-03-28 12:41:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. 59.16/30.68 [2019-03-28 12:41:25,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. 59.16/30.68 [2019-03-28 12:41:25,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 59.16/30.68 [2019-03-28 12:41:25,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. 59.16/30.68 [2019-03-28 12:41:25,767 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. 59.16/30.68 [2019-03-28 12:41:25,768 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. 59.16/30.68 [2019-03-28 12:41:25,768 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 59.16/30.68 [2019-03-28 12:41:25,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. 59.16/30.68 [2019-03-28 12:41:25,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 59.16/30.68 [2019-03-28 12:41:25,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 59.16/30.68 [2019-03-28 12:41:25,769 INFO L119 BuchiIsEmpty]: Starting construction of run 59.16/30.68 [2019-03-28 12:41:25,769 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 59.16/30.68 [2019-03-28 12:41:25,769 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 59.16/30.68 [2019-03-28 12:41:25,770 INFO L794 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY [176] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 169#L29 [116] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 165#L29-2 [117] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 166#L32-1 [139] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 163#L37 [93] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 164#L37-1 [177] L37-1-->L15-9: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_cstrcmp_~s2.base_11) (<= 1 .cse0) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2| v_ULTIMATE.start_cstrcmp_~s2.offset_9) (= |v_ULTIMATE.start_cstrcmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrcmp_~s1.base_14 |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_11) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrcmp_#t~post4.offset=|v_ULTIMATE.start_cstrcmp_#t~post4.offset_4|, ULTIMATE.start_cstrcmp_#in~s2.offset=|v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_10|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_6|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_6|, ULTIMATE.start_cstrcmp_#t~post5.base=|v_ULTIMATE.start_cstrcmp_#t~post5.base_4|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_11, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_6|, ULTIMATE.start_cstrcmp_#t~mem7=|v_ULTIMATE.start_cstrcmp_#t~mem7_5|, ULTIMATE.start_cstrcmp_#t~mem6=|v_ULTIMATE.start_cstrcmp_#t~mem6_5|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_14, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_11, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrcmp_~uc1~0=v_ULTIMATE.start_cstrcmp_~uc1~0_6, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_9, ULTIMATE.start_cstrcmp_#t~ite8=|v_ULTIMATE.start_cstrcmp_#t~ite8_6|, ULTIMATE.start_cstrcmp_#t~post5.offset=|v_ULTIMATE.start_cstrcmp_#t~post5.offset_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrcmp_~uc2~0=v_ULTIMATE.start_cstrcmp_~uc2~0_6, ULTIMATE.start_cstrcmp_#res=|v_ULTIMATE.start_cstrcmp_#res_4|, ULTIMATE.start_cstrcmp_#t~post4.base=|v_ULTIMATE.start_cstrcmp_#t~post4.base_4|, #valid=|v_#valid_25|, ULTIMATE.start_cstrcmp_#in~s1.offset=|v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrcmp_#in~s2.base=|v_ULTIMATE.start_cstrcmp_#in~s2.base_2|, ULTIMATE.start_cstrcmp_#in~s1.base=|v_ULTIMATE.start_cstrcmp_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post4.offset, ULTIMATE.start_cstrcmp_#in~s2.offset, ULTIMATE.start_cstrcmp_#t~short3, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~ite8, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~post5.offset, ULTIMATE.start_cstrcmp_#t~mem0, ULTIMATE.start_cstrcmp_#t~post5.base, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem7, ULTIMATE.start_cstrcmp_~uc2~0, ULTIMATE.start_cstrcmp_#t~mem6, ULTIMATE.start_cstrcmp_#res, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post4.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#in~s1.offset, #memory_int, ULTIMATE.start_cstrcmp_#in~s2.base, ULTIMATE.start_cstrcmp_#in~s1.base, ULTIMATE.start_cstrcmp_~uc1~0] 167#L15-9 59.16/30.68 [2019-03-28 12:41:25,770 INFO L796 eck$LassoCheckResult]: Loop: 167#L15-9 [79] L15-9-->L15-1: Formula: (and (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrcmp_~s1.base_3) v_ULTIMATE.start_cstrcmp_~s1.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem0_2|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_3)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_2|, #length=|v_#length_8|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem0] 168#L15-1 [156] L15-1-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_cstrcmp_#t~mem0_3|) |v_ULTIMATE.start_cstrcmp_#t~short3_2|) InVars {ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_3|} OutVars{ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_3|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short3] 175#L15-2 [110] L15-2-->L15-3: Formula: |v_ULTIMATE.start_cstrcmp_#t~short3_3| InVars {ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_3|} OutVars{ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_3|} AuxVars[] AssignedVars[] 174#L15-3 [107] L15-3-->L15-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_5 1) (select |v_#length_10| v_ULTIMATE.start_cstrcmp_~s1.base_6)) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_5) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrcmp_~s1.base_6) v_ULTIMATE.start_cstrcmp_~s1.offset_5) |v_ULTIMATE.start_cstrcmp_#t~mem1_2|) (= (select |v_#valid_15| v_ULTIMATE.start_cstrcmp_~s1.base_6) 1)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_5, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_6, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_6, #valid=|v_#valid_15|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_2|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem1] 173#L15-4 [101] L15-4-->L15-5: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_cstrcmp_~s2.base_3)) (<= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_3 1) (select |v_#length_12| v_ULTIMATE.start_cstrcmp_~s2.base_3)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrcmp_~s2.base_3) v_ULTIMATE.start_cstrcmp_~s2.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem2_2|) (<= 0 v_ULTIMATE.start_cstrcmp_~s2.offset_3)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_3, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_3, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_3, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_3, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem2] 171#L15-5 [173] L15-5-->L15-7: Formula: (and |v_ULTIMATE.start_cstrcmp_#t~short3_4| (= |v_ULTIMATE.start_cstrcmp_#t~mem1_3| |v_ULTIMATE.start_cstrcmp_#t~mem2_3|)) InVars {ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_3|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} OutVars{ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_3|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_4|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short3] 170#L15-7 [85] L15-7-->L15-9: Formula: (and (= v_ULTIMATE.start_cstrcmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrcmp_~s1.offset_8 1)) |v_ULTIMATE.start_cstrcmp_#t~short3_9| (= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_6 1) v_ULTIMATE.start_cstrcmp_~s2.offset_5) (= v_ULTIMATE.start_cstrcmp_~s1.base_9 v_ULTIMATE.start_cstrcmp_~s1.base_10) (= v_ULTIMATE.start_cstrcmp_~s2.base_7 v_ULTIMATE.start_cstrcmp_~s2.base_6)) InVars {ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_6, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_9|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_8, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_10, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_7} OutVars{ULTIMATE.start_cstrcmp_#t~post4.offset=|v_ULTIMATE.start_cstrcmp_#t~post4.offset_2|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_5, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_8|, ULTIMATE.start_cstrcmp_#t~post5.offset=|v_ULTIMATE.start_cstrcmp_#t~post5.offset_2|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_5|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_5|, ULTIMATE.start_cstrcmp_#t~post5.base=|v_ULTIMATE.start_cstrcmp_#t~post5.base_2|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_7, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~post4.base=|v_ULTIMATE.start_cstrcmp_#t~post4.base_2|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_9, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post4.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~short3, ULTIMATE.start_cstrcmp_#t~post4.base, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#t~post5.offset, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~mem0, ULTIMATE.start_cstrcmp_#t~post5.base, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2] 167#L15-9 59.16/30.68 [2019-03-28 12:41:25,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.68 [2019-03-28 12:41:25,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1742017583, now seen corresponding path program 1 times 59.16/30.68 [2019-03-28 12:41:25,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.68 [2019-03-28 12:41:25,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.68 [2019-03-28 12:41:25,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.16/30.68 [2019-03-28 12:41:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.16/30.68 [2019-03-28 12:41:25,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.68 [2019-03-28 12:41:25,782 INFO L82 PathProgramCache]: Analyzing trace with hash -882785182, now seen corresponding path program 2 times 59.16/30.68 [2019-03-28 12:41:25,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.68 [2019-03-28 12:41:25,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.68 [2019-03-28 12:41:25,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.16/30.68 [2019-03-28 12:41:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.16/30.68 [2019-03-28 12:41:25,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.68 [2019-03-28 12:41:25,789 INFO L82 PathProgramCache]: Analyzing trace with hash 467943540, now seen corresponding path program 1 times 59.16/30.68 [2019-03-28 12:41:25,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.16/30.68 [2019-03-28 12:41:25,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.16/30.68 [2019-03-28 12:41:25,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.16/30.68 [2019-03-28 12:41:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.16/30.68 [2019-03-28 12:41:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.16/30.68 [2019-03-28 12:41:26,113 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 59.16/30.68 [2019-03-28 12:41:26,230 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 74 59.16/30.68 [2019-03-28 12:41:26,247 INFO L216 LassoAnalysis]: Preferences: 59.16/30.68 [2019-03-28 12:41:26,248 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 59.16/30.68 [2019-03-28 12:41:26,248 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 59.16/30.68 [2019-03-28 12:41:26,248 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 59.16/30.68 [2019-03-28 12:41:26,249 INFO L127 ssoRankerPreferences]: Use exernal solver: false 59.16/30.68 [2019-03-28 12:41:26,249 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 59.16/30.68 [2019-03-28 12:41:26,249 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 59.16/30.68 [2019-03-28 12:41:26,249 INFO L130 ssoRankerPreferences]: Path of dumped script: 59.16/30.68 [2019-03-28 12:41:26,249 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 59.16/30.68 [2019-03-28 12:41:26,249 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 59.16/30.68 [2019-03-28 12:41:26,250 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 59.16/30.68 [2019-03-28 12:41:26,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,573 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 59.16/30.68 [2019-03-28 12:41:26,713 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 59.16/30.68 [2019-03-28 12:41:26,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:26,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.16/30.68 [2019-03-28 12:41:27,158 INFO L300 LassoAnalysis]: Preprocessing complete. 59.16/30.68 [2019-03-28 12:41:27,164 INFO L497 LassoAnalysis]: Using template 'affine'. 59.16/30.68 [2019-03-28 12:41:27,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.16/30.68 Termination analysis: LINEAR_WITH_GUESSES 59.16/30.68 Number of strict supporting invariants: 0 59.16/30.68 Number of non-strict supporting invariants: 1 59.16/30.68 Consider only non-deceasing supporting invariants: true 59.16/30.68 Simplify termination arguments: true 59.16/30.68 Simplify supporting invariants: trueOverapproximate stem: false 59.16/30.68 [2019-03-28 12:41:27,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.16/30.68 [2019-03-28 12:41:27,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.16/30.68 [2019-03-28 12:41:27,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.16/30.68 [2019-03-28 12:41:27,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.16/30.68 [2019-03-28 12:41:27,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.16/30.68 [2019-03-28 12:41:27,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.16/30.68 [2019-03-28 12:41:27,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.16/30.68 [2019-03-28 12:41:27,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.16/30.68 [2019-03-28 12:41:27,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.16/30.68 Termination analysis: LINEAR_WITH_GUESSES 59.16/30.68 Number of strict supporting invariants: 0 59.16/30.68 Number of non-strict supporting invariants: 1 59.16/30.68 Consider only non-deceasing supporting invariants: true 59.16/30.68 Simplify termination arguments: true 59.16/30.68 Simplify supporting invariants: trueOverapproximate stem: false 59.16/30.68 [2019-03-28 12:41:27,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.16/30.68 [2019-03-28 12:41:27,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.16/30.68 [2019-03-28 12:41:27,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.16/30.68 [2019-03-28 12:41:27,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.16/30.68 [2019-03-28 12:41:27,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.16/30.68 [2019-03-28 12:41:27,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.16/30.68 [2019-03-28 12:41:27,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.16/30.68 [2019-03-28 12:41:27,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.16/30.68 [2019-03-28 12:41:27,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.16/30.68 Termination analysis: LINEAR_WITH_GUESSES 59.16/30.68 Number of strict supporting invariants: 0 59.16/30.68 Number of non-strict supporting invariants: 1 59.16/30.68 Consider only non-deceasing supporting invariants: true 59.16/30.68 Simplify termination arguments: true 59.16/30.68 Simplify supporting invariants: trueOverapproximate stem: false 59.16/30.68 [2019-03-28 12:41:27,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.16/30.68 [2019-03-28 12:41:27,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.16/30.68 [2019-03-28 12:41:27,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.16/30.68 [2019-03-28 12:41:27,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.16/30.68 [2019-03-28 12:41:27,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.16/30.68 [2019-03-28 12:41:27,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.16/30.68 [2019-03-28 12:41:27,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.16/30.68 [2019-03-28 12:41:27,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.16/30.68 [2019-03-28 12:41:27,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.16/30.68 Termination analysis: LINEAR_WITH_GUESSES 59.16/30.68 Number of strict supporting invariants: 0 59.16/30.68 Number of non-strict supporting invariants: 1 59.16/30.68 Consider only non-deceasing supporting invariants: true 59.16/30.68 Simplify termination arguments: true 59.16/30.68 Simplify supporting invariants: trueOverapproximate stem: false 59.16/30.68 [2019-03-28 12:41:27,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.16/30.68 [2019-03-28 12:41:27,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.16/30.68 [2019-03-28 12:41:27,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.16/30.68 [2019-03-28 12:41:27,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.16/30.68 [2019-03-28 12:41:27,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.16/30.68 [2019-03-28 12:41:27,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.16/30.68 [2019-03-28 12:41:27,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.16/30.68 [2019-03-28 12:41:27,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.16/30.68 Termination analysis: LINEAR_WITH_GUESSES 59.16/30.68 Number of strict supporting invariants: 0 59.16/30.68 Number of non-strict supporting invariants: 1 59.16/30.68 Consider only non-deceasing supporting invariants: true 59.16/30.68 Simplify termination arguments: true 59.16/30.68 Simplify supporting invariants: trueOverapproximate stem: false 59.16/30.68 [2019-03-28 12:41:27,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.16/30.68 [2019-03-28 12:41:27,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.16/30.68 [2019-03-28 12:41:27,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.16/30.68 [2019-03-28 12:41:27,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.16/30.68 [2019-03-28 12:41:27,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.16/30.68 [2019-03-28 12:41:27,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.16/30.68 [2019-03-28 12:41:27,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.16/30.68 [2019-03-28 12:41:27,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.16/30.68 [2019-03-28 12:41:27,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.16/30.68 Termination analysis: LINEAR_WITH_GUESSES 59.16/30.68 Number of strict supporting invariants: 0 59.16/30.68 Number of non-strict supporting invariants: 1 59.16/30.68 Consider only non-deceasing supporting invariants: true 59.16/30.68 Simplify termination arguments: true 59.16/30.68 Simplify supporting invariants: trueOverapproximate stem: false 59.16/30.68 [2019-03-28 12:41:27,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.16/30.68 [2019-03-28 12:41:27,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.16/30.68 [2019-03-28 12:41:27,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.16/30.68 [2019-03-28 12:41:27,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.16/30.68 [2019-03-28 12:41:27,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.16/30.68 [2019-03-28 12:41:27,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.16/30.68 [2019-03-28 12:41:27,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.16/30.68 [2019-03-28 12:41:27,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.16/30.68 [2019-03-28 12:41:27,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.16/30.68 Termination analysis: LINEAR_WITH_GUESSES 59.16/30.68 Number of strict supporting invariants: 0 59.16/30.68 Number of non-strict supporting invariants: 1 59.16/30.68 Consider only non-deceasing supporting invariants: true 59.16/30.68 Simplify termination arguments: true 59.16/30.68 Simplify supporting invariants: trueOverapproximate stem: false 59.16/30.68 [2019-03-28 12:41:27,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.16/30.68 [2019-03-28 12:41:27,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.16/30.68 [2019-03-28 12:41:27,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.16/30.68 [2019-03-28 12:41:27,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.16/30.68 [2019-03-28 12:41:27,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.16/30.68 [2019-03-28 12:41:27,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.16/30.68 [2019-03-28 12:41:27,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.16/30.68 [2019-03-28 12:41:27,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.16/30.68 [2019-03-28 12:41:27,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.16/30.68 Termination analysis: LINEAR_WITH_GUESSES 59.16/30.68 Number of strict supporting invariants: 0 59.16/30.68 Number of non-strict supporting invariants: 1 59.16/30.68 Consider only non-deceasing supporting invariants: true 59.16/30.68 Simplify termination arguments: true 59.16/30.68 Simplify supporting invariants: trueOverapproximate stem: false 59.16/30.68 [2019-03-28 12:41:27,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.16/30.68 [2019-03-28 12:41:27,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.16/30.68 [2019-03-28 12:41:27,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.16/30.68 [2019-03-28 12:41:27,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.16/30.68 [2019-03-28 12:41:27,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.16/30.68 [2019-03-28 12:41:27,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.16/30.68 [2019-03-28 12:41:27,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.16/30.68 [2019-03-28 12:41:27,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.16/30.68 Termination analysis: LINEAR_WITH_GUESSES 59.16/30.68 Number of strict supporting invariants: 0 59.16/30.68 Number of non-strict supporting invariants: 1 59.16/30.68 Consider only non-deceasing supporting invariants: true 59.16/30.68 Simplify termination arguments: true 59.16/30.68 Simplify supporting invariants: trueOverapproximate stem: false 59.16/30.68 [2019-03-28 12:41:27,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.16/30.68 [2019-03-28 12:41:27,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.16/30.68 [2019-03-28 12:41:27,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.16/30.68 [2019-03-28 12:41:27,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.16/30.68 [2019-03-28 12:41:27,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.16/30.68 [2019-03-28 12:41:27,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.16/30.68 [2019-03-28 12:41:27,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.16/30.68 [2019-03-28 12:41:27,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.16/30.68 [2019-03-28 12:41:27,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.16/30.68 Termination analysis: LINEAR_WITH_GUESSES 59.16/30.68 Number of strict supporting invariants: 0 59.16/30.68 Number of non-strict supporting invariants: 1 59.16/30.68 Consider only non-deceasing supporting invariants: true 59.16/30.68 Simplify termination arguments: true 59.16/30.68 Simplify supporting invariants: trueOverapproximate stem: false 59.16/30.68 [2019-03-28 12:41:27,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.16/30.68 [2019-03-28 12:41:27,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.16/30.68 [2019-03-28 12:41:27,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.16/30.68 [2019-03-28 12:41:27,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.16/30.68 [2019-03-28 12:41:27,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.16/30.68 [2019-03-28 12:41:27,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.16/30.68 [2019-03-28 12:41:27,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.16/30.68 [2019-03-28 12:41:27,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.16/30.68 [2019-03-28 12:41:27,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.16/30.68 Termination analysis: LINEAR_WITH_GUESSES 59.16/30.68 Number of strict supporting invariants: 0 59.16/30.68 Number of non-strict supporting invariants: 1 59.16/30.68 Consider only non-deceasing supporting invariants: true 59.16/30.68 Simplify termination arguments: true 59.16/30.68 Simplify supporting invariants: trueOverapproximate stem: false 59.16/30.68 [2019-03-28 12:41:27,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.16/30.68 [2019-03-28 12:41:27,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.16/30.68 [2019-03-28 12:41:27,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.16/30.68 [2019-03-28 12:41:27,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.16/30.68 [2019-03-28 12:41:27,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.16/30.68 [2019-03-28 12:41:27,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.16/30.68 [2019-03-28 12:41:27,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.16/30.68 [2019-03-28 12:41:27,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.16/30.68 Termination analysis: LINEAR_WITH_GUESSES 59.16/30.68 Number of strict supporting invariants: 0 59.16/30.68 Number of non-strict supporting invariants: 1 59.16/30.68 Consider only non-deceasing supporting invariants: true 59.16/30.68 Simplify termination arguments: true 59.16/30.68 Simplify supporting invariants: trueOverapproximate stem: false 59.16/30.68 [2019-03-28 12:41:27,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.16/30.68 [2019-03-28 12:41:27,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.16/30.68 [2019-03-28 12:41:27,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.16/30.68 [2019-03-28 12:41:27,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.16/30.68 [2019-03-28 12:41:27,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.16/30.68 [2019-03-28 12:41:27,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.16/30.68 [2019-03-28 12:41:27,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.16/30.68 [2019-03-28 12:41:27,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.16/30.68 Termination analysis: LINEAR_WITH_GUESSES 59.16/30.68 Number of strict supporting invariants: 0 59.16/30.68 Number of non-strict supporting invariants: 1 59.16/30.68 Consider only non-deceasing supporting invariants: true 59.16/30.68 Simplify termination arguments: true 59.16/30.68 Simplify supporting invariants: trueOverapproximate stem: false 59.16/30.68 [2019-03-28 12:41:27,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.16/30.68 [2019-03-28 12:41:27,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.16/30.68 [2019-03-28 12:41:27,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.16/30.68 [2019-03-28 12:41:27,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.16/30.68 [2019-03-28 12:41:27,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.16/30.68 [2019-03-28 12:41:27,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.16/30.68 [2019-03-28 12:41:27,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.16/30.68 [2019-03-28 12:41:27,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.16/30.68 [2019-03-28 12:41:27,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.16/30.68 Termination analysis: LINEAR_WITH_GUESSES 59.16/30.68 Number of strict supporting invariants: 0 59.16/30.68 Number of non-strict supporting invariants: 1 59.16/30.68 Consider only non-deceasing supporting invariants: true 59.16/30.68 Simplify termination arguments: true 59.16/30.68 Simplify supporting invariants: trueOverapproximate stem: false 59.16/30.68 [2019-03-28 12:41:27,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.16/30.68 [2019-03-28 12:41:27,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.16/30.68 [2019-03-28 12:41:27,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.16/30.68 [2019-03-28 12:41:27,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.16/30.68 [2019-03-28 12:41:27,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.16/30.68 [2019-03-28 12:41:27,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.16/30.68 [2019-03-28 12:41:27,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.16/30.68 [2019-03-28 12:41:27,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.16/30.68 Termination analysis: LINEAR_WITH_GUESSES 59.16/30.68 Number of strict supporting invariants: 0 59.16/30.68 Number of non-strict supporting invariants: 1 59.16/30.68 Consider only non-deceasing supporting invariants: true 59.16/30.68 Simplify termination arguments: true 59.16/30.68 Simplify supporting invariants: trueOverapproximate stem: false 59.16/30.68 [2019-03-28 12:41:27,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.16/30.68 [2019-03-28 12:41:27,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.16/30.68 [2019-03-28 12:41:27,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.16/30.68 [2019-03-28 12:41:27,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.16/30.68 [2019-03-28 12:41:27,244 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.16/30.68 [2019-03-28 12:41:27,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.16/30.68 [2019-03-28 12:41:27,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.16/30.68 [2019-03-28 12:41:27,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.16/30.68 Termination analysis: LINEAR_WITH_GUESSES 59.16/30.68 Number of strict supporting invariants: 0 59.16/30.68 Number of non-strict supporting invariants: 1 59.16/30.68 Consider only non-deceasing supporting invariants: true 59.16/30.68 Simplify termination arguments: true 59.16/30.68 Simplify supporting invariants: trueOverapproximate stem: false 59.16/30.68 [2019-03-28 12:41:27,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.16/30.68 [2019-03-28 12:41:27,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.16/30.68 [2019-03-28 12:41:27,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.16/30.68 [2019-03-28 12:41:27,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.16/30.68 [2019-03-28 12:41:27,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.16/30.68 [2019-03-28 12:41:27,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.16/30.68 [2019-03-28 12:41:27,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.16/30.68 [2019-03-28 12:41:27,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.16/30.68 Termination analysis: LINEAR_WITH_GUESSES 59.16/30.68 Number of strict supporting invariants: 0 59.16/30.68 Number of non-strict supporting invariants: 1 59.16/30.68 Consider only non-deceasing supporting invariants: true 59.16/30.68 Simplify termination arguments: true 59.16/30.68 Simplify supporting invariants: trueOverapproximate stem: false 59.16/30.68 [2019-03-28 12:41:27,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.16/30.68 [2019-03-28 12:41:27,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.16/30.68 [2019-03-28 12:41:27,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.16/30.68 [2019-03-28 12:41:27,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.16/30.68 [2019-03-28 12:41:27,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.16/30.68 [2019-03-28 12:41:27,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.16/30.68 [2019-03-28 12:41:27,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.16/30.68 [2019-03-28 12:41:27,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.16/30.68 Termination analysis: LINEAR_WITH_GUESSES 59.16/30.68 Number of strict supporting invariants: 0 59.16/30.68 Number of non-strict supporting invariants: 1 59.16/30.68 Consider only non-deceasing supporting invariants: true 59.16/30.68 Simplify termination arguments: true 59.16/30.68 Simplify supporting invariants: trueOverapproximate stem: false 59.16/30.68 [2019-03-28 12:41:27,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.16/30.68 [2019-03-28 12:41:27,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.16/30.68 [2019-03-28 12:41:27,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.16/30.68 [2019-03-28 12:41:27,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.16/30.68 [2019-03-28 12:41:27,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.16/30.68 [2019-03-28 12:41:27,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.16/30.68 [2019-03-28 12:41:27,307 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 59.16/30.68 [2019-03-28 12:41:27,358 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 59.16/30.68 [2019-03-28 12:41:27,358 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. 59.16/30.68 [2019-03-28 12:41:27,361 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 59.16/30.68 [2019-03-28 12:41:27,362 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 59.16/30.68 [2019-03-28 12:41:27,362 INFO L518 LassoAnalysis]: Proved termination. 59.16/30.68 [2019-03-28 12:41:27,363 INFO L520 LassoAnalysis]: Termination argument consisting of: 59.16/30.68 Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_cstrcmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_cstrcmp_~s1.offset 59.16/30.68 Supporting invariants [] 59.16/30.68 [2019-03-28 12:41:27,413 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed 59.16/30.68 [2019-03-28 12:41:27,420 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.16/30.68 [2019-03-28 12:41:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.68 [2019-03-28 12:41:27,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 24 conjunts are in the unsatisfiable core 59.16/30.68 [2019-03-28 12:41:27,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.16/30.68 [2019-03-28 12:41:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.68 [2019-03-28 12:41:27,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core 59.16/30.68 [2019-03-28 12:41:27,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.16/30.68 [2019-03-28 12:41:27,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.16/30.68 [2019-03-28 12:41:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.68 [2019-03-28 12:41:27,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core 59.16/30.68 [2019-03-28 12:41:27,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.16/30.68 [2019-03-28 12:41:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.16/30.68 [2019-03-28 12:41:27,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core 59.16/30.68 [2019-03-28 12:41:27,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.16/30.68 [2019-03-28 12:41:27,713 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 7 predicates after loop cannibalization 59.16/30.68 [2019-03-28 12:41:27,719 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 7 loop predicates 59.16/30.68 [2019-03-28 12:41:27,720 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 5 states. 59.16/30.68 [2019-03-28 12:41:27,938 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 28 states and 37 transitions. Complement of second has 8 states. 59.16/30.68 [2019-03-28 12:41:27,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states 59.16/30.68 [2019-03-28 12:41:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 59.16/30.68 [2019-03-28 12:41:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. 59.16/30.68 [2019-03-28 12:41:27,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 6 letters. Loop has 7 letters. 59.16/30.68 [2019-03-28 12:41:27,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. 59.16/30.68 [2019-03-28 12:41:27,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 13 letters. Loop has 7 letters. 59.16/30.68 [2019-03-28 12:41:27,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. 59.16/30.68 [2019-03-28 12:41:27,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 6 letters. Loop has 14 letters. 59.16/30.68 [2019-03-28 12:41:27,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. 59.16/30.68 [2019-03-28 12:41:27,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. 59.16/30.68 [2019-03-28 12:41:27,950 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 59.16/30.68 [2019-03-28 12:41:27,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. 59.16/30.68 [2019-03-28 12:41:27,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 59.16/30.68 [2019-03-28 12:41:27,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 59.16/30.68 [2019-03-28 12:41:27,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 59.16/30.68 [2019-03-28 12:41:27,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 59.16/30.68 [2019-03-28 12:41:27,951 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 59.16/30.68 [2019-03-28 12:41:27,951 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 59.16/30.68 [2019-03-28 12:41:27,951 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 59.16/30.68 [2019-03-28 12:41:27,951 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 59.16/30.68 [2019-03-28 12:41:27,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 59.16/30.68 [2019-03-28 12:41:27,952 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 59.16/30.68 [2019-03-28 12:41:27,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 59.16/30.68 [2019-03-28 12:41:27,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:27 BasicIcfg 59.16/30.68 [2019-03-28 12:41:27,958 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 59.16/30.68 [2019-03-28 12:41:27,958 INFO L168 Benchmark]: Toolchain (without parser) took 26090.93 ms. Allocated memory was 649.6 MB in the beginning and 974.7 MB in the end (delta: 325.1 MB). Free memory was 558.8 MB in the beginning and 714.2 MB in the end (delta: -155.4 MB). Peak memory consumption was 169.6 MB. Max. memory is 50.3 GB. 59.16/30.68 [2019-03-28 12:41:27,959 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 59.16/30.68 [2019-03-28 12:41:27,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.27 ms. Allocated memory was 649.6 MB in the beginning and 652.7 MB in the end (delta: 3.1 MB). Free memory was 557.4 MB in the beginning and 618.2 MB in the end (delta: -60.8 MB). Peak memory consumption was 31.9 MB. Max. memory is 50.3 GB. 59.16/30.68 [2019-03-28 12:41:27,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.90 ms. Allocated memory is still 652.7 MB. Free memory was 618.2 MB in the beginning and 615.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 59.16/30.68 [2019-03-28 12:41:27,960 INFO L168 Benchmark]: Boogie Preprocessor took 27.59 ms. Allocated memory is still 652.7 MB. Free memory was 615.5 MB in the beginning and 614.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 59.16/30.68 [2019-03-28 12:41:27,961 INFO L168 Benchmark]: RCFGBuilder took 348.40 ms. Allocated memory is still 652.7 MB. Free memory was 614.2 MB in the beginning and 589.4 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 50.3 GB. 59.16/30.68 [2019-03-28 12:41:27,961 INFO L168 Benchmark]: BlockEncodingV2 took 128.19 ms. Allocated memory is still 652.7 MB. Free memory was 589.4 MB in the beginning and 579.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 59.16/30.68 [2019-03-28 12:41:27,962 INFO L168 Benchmark]: TraceAbstraction took 22452.96 ms. Allocated memory was 652.7 MB in the beginning and 932.7 MB in the end (delta: 280.0 MB). Free memory was 579.9 MB in the beginning and 677.1 MB in the end (delta: -97.2 MB). Peak memory consumption was 507.0 MB. Max. memory is 50.3 GB. 59.16/30.68 [2019-03-28 12:41:27,962 INFO L168 Benchmark]: BuchiAutomizer took 2760.96 ms. Allocated memory was 932.7 MB in the beginning and 974.7 MB in the end (delta: 41.9 MB). Free memory was 677.1 MB in the beginning and 714.2 MB in the end (delta: -37.1 MB). Peak memory consumption was 4.9 MB. Max. memory is 50.3 GB. 59.16/30.68 [2019-03-28 12:41:27,966 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 59.16/30.68 --- Results --- 59.16/30.68 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 59.16/30.68 - StatisticsResult: Initial Icfg 59.16/30.68 39 locations, 44 edges 59.16/30.68 - StatisticsResult: Encoded RCFG 59.16/30.68 29 locations, 53 edges 59.16/30.68 * Results from de.uni_freiburg.informatik.ultimate.core: 59.16/30.68 - StatisticsResult: Toolchain Benchmarks 59.16/30.68 Benchmark results are: 59.16/30.68 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 59.16/30.68 * CACSL2BoogieTranslator took 321.27 ms. Allocated memory was 649.6 MB in the beginning and 652.7 MB in the end (delta: 3.1 MB). Free memory was 557.4 MB in the beginning and 618.2 MB in the end (delta: -60.8 MB). Peak memory consumption was 31.9 MB. Max. memory is 50.3 GB. 59.16/30.68 * Boogie Procedure Inliner took 45.90 ms. Allocated memory is still 652.7 MB. Free memory was 618.2 MB in the beginning and 615.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 59.16/30.68 * Boogie Preprocessor took 27.59 ms. Allocated memory is still 652.7 MB. Free memory was 615.5 MB in the beginning and 614.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 59.16/30.68 * RCFGBuilder took 348.40 ms. Allocated memory is still 652.7 MB. Free memory was 614.2 MB in the beginning and 589.4 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 50.3 GB. 59.16/30.68 * BlockEncodingV2 took 128.19 ms. Allocated memory is still 652.7 MB. Free memory was 589.4 MB in the beginning and 579.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 59.16/30.68 * TraceAbstraction took 22452.96 ms. Allocated memory was 652.7 MB in the beginning and 932.7 MB in the end (delta: 280.0 MB). Free memory was 579.9 MB in the beginning and 677.1 MB in the end (delta: -97.2 MB). Peak memory consumption was 507.0 MB. Max. memory is 50.3 GB. 59.16/30.68 * BuchiAutomizer took 2760.96 ms. Allocated memory was 932.7 MB in the beginning and 974.7 MB in the end (delta: 41.9 MB). Free memory was 677.1 MB in the beginning and 714.2 MB in the end (delta: -37.1 MB). Peak memory consumption was 4.9 MB. Max. memory is 50.3 GB. 59.16/30.68 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #memory_int 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 - GenericResult: Unfinished Backtranslation 59.16/30.68 unknown boogie variable #length 59.16/30.68 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 59.16/30.68 - PositiveResult [Line: 15]: pointer dereference always succeeds 59.16/30.68 For all program executions holds that pointer dereference always succeeds at this location 59.16/30.68 - PositiveResult [Line: 15]: pointer dereference always succeeds 59.16/30.68 For all program executions holds that pointer dereference always succeeds at this location 59.16/30.68 - PositiveResult [Line: 15]: pointer dereference always succeeds 59.16/30.68 For all program executions holds that pointer dereference always succeeds at this location 59.16/30.68 - PositiveResult [Line: 15]: pointer dereference always succeeds 59.16/30.68 For all program executions holds that pointer dereference always succeeds at this location 59.16/30.68 - PositiveResult [Line: 15]: pointer dereference always succeeds 59.16/30.68 For all program executions holds that pointer dereference always succeeds at this location 59.16/30.68 - PositiveResult [Line: 22]: pointer dereference always succeeds 59.16/30.68 For all program executions holds that pointer dereference always succeeds at this location 59.16/30.68 - PositiveResult [Line: 37]: pointer dereference always succeeds 59.16/30.68 For all program executions holds that pointer dereference always succeeds at this location 59.16/30.68 - PositiveResult [Line: 38]: pointer dereference always succeeds 59.16/30.68 For all program executions holds that pointer dereference always succeeds at this location 59.16/30.68 - PositiveResult [Line: 22]: pointer dereference always succeeds 59.16/30.68 For all program executions holds that pointer dereference always succeeds at this location 59.16/30.68 - PositiveResult [Line: 38]: pointer dereference always succeeds 59.16/30.68 For all program executions holds that pointer dereference always succeeds at this location 59.16/30.68 - PositiveResult [Line: 15]: pointer dereference always succeeds 59.16/30.68 For all program executions holds that pointer dereference always succeeds at this location 59.16/30.68 - PositiveResult [Line: 21]: pointer dereference always succeeds 59.16/30.68 For all program executions holds that pointer dereference always succeeds at this location 59.16/30.68 - PositiveResult [Line: 37]: pointer dereference always succeeds 59.16/30.68 For all program executions holds that pointer dereference always succeeds at this location 59.16/30.68 - PositiveResult [Line: 21]: pointer dereference always succeeds 59.16/30.68 For all program executions holds that pointer dereference always succeeds at this location 59.16/30.68 - AllSpecificationsHoldResult: All specifications hold 59.16/30.68 14 specifications checked. All of them hold 59.16/30.68 - InvariantResult [Line: 15]: Loop Invariant 59.16/30.68 [2019-03-28 12:41:27,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 [2019-03-28 12:41:27,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 [2019-03-28 12:41:27,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 [2019-03-28 12:41:27,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 [2019-03-28 12:41:27,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 [2019-03-28 12:41:27,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 [2019-03-28 12:41:27,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 [2019-03-28 12:41:27,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 [2019-03-28 12:41:27,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 [2019-03-28 12:41:27,989 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 [2019-03-28 12:41:27,989 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 [2019-03-28 12:41:27,989 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 59.16/30.68 [2019-03-28 12:41:27,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.16/30.68 [2019-03-28 12:41:27,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 [2019-03-28 12:41:27,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.16/30.68 Derived loop invariant: ((((nondetString2 == 0 && (((((((((((((\valid[s2] == 1 && length1 == unknown-#length-unknown[nondetString1]) && 1 <= unknown-#length-unknown[s1]) && 1 <= length1) && 1 == \valid[nondetString1]) && \valid[s1] == 1) && 1 == \valid[nondetString2]) && s2 == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0 && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && nondetString1 == 0) && !(nondetString1 == nondetString2)) && s1 == 0) && 0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1]) && 1 <= length2) && unknown-#length-unknown[nondetString2] == length2) && s2 + 1 <= unknown-#length-unknown[s2]) || ((((((((((((((((\valid[s2] == 1 && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && s1 == 0) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 1 <= unknown-#length-unknown[s1]) && 1 == length1) && s2 == 0) && 0 == unknown-#memory_int-unknown[s1][s1]) && 1 == \valid[nondetString1]) && nondetString1 == 0) && nondetString2 == 0) && 1 <= unknown-#length-unknown[s2]) && \valid[s1] == 1) && 1 == \valid[nondetString2])) || (((((((((((((((((\valid[s2] == 1 && 1 <= length1) && 1 == \valid[nondetString1]) && length1 == unknown-#length-unknown[nondetString1]) && 1 <= s1) && \valid[s1] == 1) && 1 == \valid[nondetString2]) && 1 <= length2) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0 && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && s1 + 1 <= unknown-#length-unknown[s1]) && nondetString1 == 0) && !(nondetString1 == nondetString2)) && nondetString2 == 0) && 1 <= s2) && 0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1]) && unknown-#length-unknown[nondetString2] == length2) && s2 + 1 <= unknown-#length-unknown[s2]) 59.16/30.68 - StatisticsResult: Ultimate Automizer benchmark data 59.16/30.68 CFG has 1 procedures, 29 locations, 14 error locations. SAFE Result, 22.3s OverallTime, 23 OverallIterations, 4 TraceHistogramMax, 15.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 180 SDtfs, 2172 SDslu, 771 SDs, 0 SdLazy, 2134 SolverSat, 283 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 167 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 6 NumberOfFragments, 333 HoareAnnotationTreeSize, 1 FomulaSimplifications, 1139 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 3766 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 463 NumberOfCodeBlocks, 463 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 432 ConstructedInterpolants, 52 QuantifiedInterpolants, 103140 SizeOfPredicates, 80 NumberOfNonLiveVariables, 988 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 31 InterpolantComputations, 17 PerfectInterpolantSequences, 55/199 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 59.16/30.68 - StatisticsResult: Constructed decomposition of program 59.16/30.68 Your program was decomposed into 4 terminating modules (3 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length2 * sizeof(char))] + -1 * s1 and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 9 locations. 59.16/30.68 - StatisticsResult: Timing statistics 59.16/30.68 BüchiAutomizer plugin needed 2.7s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 42 SDtfs, 148 SDslu, 146 SDs, 0 SdLazy, 291 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital210 mio100 ax100 hnf100 lsp97 ukn86 mio100 lsp47 div100 bol100 ite100 ukn100 eq195 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 59.16/30.68 - TerminationAnalysisResult: Termination proven 59.16/30.68 Buchi Automizer proved that your program is terminating 59.16/30.68 RESULT: Ultimate proved your program to be correct! 59.16/30.68 !SESSION 2019-03-28 12:40:58.461 ----------------------------------------------- 59.16/30.68 eclipse.buildId=unknown 59.16/30.68 java.version=1.8.0_181 59.16/30.68 java.vendor=Oracle Corporation 59.16/30.68 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 59.16/30.68 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 59.16/30.68 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 59.16/30.68 59.16/30.68 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:41:28.228 59.16/30.68 !MESSAGE The workspace will exit with unsaved changes in this session. 59.16/30.68 Received shutdown request... 59.16/30.68 Ultimate: 59.16/30.68 GTK+ Version Check 59.16/30.68 EOF