21.93/12.64 YES 21.93/12.64 21.93/12.64 Ultimate: Cannot open display: 21.93/12.64 This is Ultimate 0.1.24-8dc7c08-m 21.93/12.64 [2019-03-28 11:52:48,387 INFO L170 SettingsManager]: Resetting all preferences to default values... 21.93/12.64 [2019-03-28 11:52:48,389 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 21.93/12.64 [2019-03-28 11:52:48,401 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 21.93/12.64 [2019-03-28 11:52:48,401 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 21.93/12.64 [2019-03-28 11:52:48,402 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 21.93/12.64 [2019-03-28 11:52:48,404 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 21.93/12.64 [2019-03-28 11:52:48,405 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 21.93/12.64 [2019-03-28 11:52:48,407 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 21.93/12.64 [2019-03-28 11:52:48,408 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 21.93/12.64 [2019-03-28 11:52:48,409 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 21.93/12.64 [2019-03-28 11:52:48,409 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 21.93/12.64 [2019-03-28 11:52:48,410 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 21.93/12.64 [2019-03-28 11:52:48,411 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 21.93/12.64 [2019-03-28 11:52:48,412 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 21.93/12.64 [2019-03-28 11:52:48,413 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 21.93/12.64 [2019-03-28 11:52:48,413 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 21.93/12.64 [2019-03-28 11:52:48,415 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 21.93/12.64 [2019-03-28 11:52:48,417 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 21.93/12.64 [2019-03-28 11:52:48,419 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 21.93/12.64 [2019-03-28 11:52:48,420 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 21.93/12.64 [2019-03-28 11:52:48,421 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 21.93/12.64 [2019-03-28 11:52:48,424 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 21.93/12.64 [2019-03-28 11:52:48,424 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 21.93/12.64 [2019-03-28 11:52:48,424 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 21.93/12.64 [2019-03-28 11:52:48,425 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 21.93/12.64 [2019-03-28 11:52:48,426 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 21.93/12.64 [2019-03-28 11:52:48,427 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 21.93/12.64 [2019-03-28 11:52:48,427 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 21.93/12.64 [2019-03-28 11:52:48,428 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 21.93/12.64 [2019-03-28 11:52:48,429 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 21.93/12.64 [2019-03-28 11:52:48,430 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 21.93/12.64 [2019-03-28 11:52:48,431 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 21.93/12.64 [2019-03-28 11:52:48,431 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 21.93/12.64 [2019-03-28 11:52:48,432 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 21.93/12.64 [2019-03-28 11:52:48,432 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 21.93/12.64 [2019-03-28 11:52:48,432 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 21.93/12.64 [2019-03-28 11:52:48,433 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 21.93/12.64 [2019-03-28 11:52:48,434 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 21.93/12.64 [2019-03-28 11:52:48,434 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 21.93/12.64 [2019-03-28 11:52:48,450 INFO L110 SettingsManager]: Loading preferences was successful 21.93/12.64 [2019-03-28 11:52:48,450 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 21.93/12.64 [2019-03-28 11:52:48,451 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 21.93/12.64 [2019-03-28 11:52:48,451 INFO L133 SettingsManager]: * Rewrite not-equals=true 21.93/12.64 [2019-03-28 11:52:48,451 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 21.93/12.64 [2019-03-28 11:52:48,452 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 21.93/12.64 [2019-03-28 11:52:48,452 INFO L133 SettingsManager]: * Use SBE=true 21.93/12.64 [2019-03-28 11:52:48,452 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 21.93/12.64 [2019-03-28 11:52:48,452 INFO L133 SettingsManager]: * Use old map elimination=false 21.93/12.64 [2019-03-28 11:52:48,453 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 21.93/12.64 [2019-03-28 11:52:48,453 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 21.93/12.64 [2019-03-28 11:52:48,453 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 21.93/12.64 [2019-03-28 11:52:48,453 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 21.93/12.64 [2019-03-28 11:52:48,453 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 21.93/12.64 [2019-03-28 11:52:48,453 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.93/12.64 [2019-03-28 11:52:48,454 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 21.93/12.64 [2019-03-28 11:52:48,454 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 21.93/12.64 [2019-03-28 11:52:48,454 INFO L133 SettingsManager]: * Check division by zero=IGNORE 21.93/12.64 [2019-03-28 11:52:48,454 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 21.93/12.64 [2019-03-28 11:52:48,454 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 21.93/12.64 [2019-03-28 11:52:48,455 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 21.93/12.64 [2019-03-28 11:52:48,455 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 21.93/12.64 [2019-03-28 11:52:48,455 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 21.93/12.64 [2019-03-28 11:52:48,455 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 21.93/12.64 [2019-03-28 11:52:48,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 21.93/12.64 [2019-03-28 11:52:48,456 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 21.93/12.64 [2019-03-28 11:52:48,456 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 21.93/12.64 [2019-03-28 11:52:48,456 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 21.93/12.64 [2019-03-28 11:52:48,456 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 21.93/12.64 [2019-03-28 11:52:48,484 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 21.93/12.64 [2019-03-28 11:52:48,505 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 21.93/12.64 [2019-03-28 11:52:48,509 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 21.93/12.64 [2019-03-28 11:52:48,511 INFO L271 PluginConnector]: Initializing CDTParser... 21.93/12.64 [2019-03-28 11:52:48,511 INFO L276 PluginConnector]: CDTParser initialized 21.93/12.64 [2019-03-28 11:52:48,512 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 21.93/12.64 [2019-03-28 11:52:48,585 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/60ce8e92fccd499d924c01041c41e8ac/FLAGe5f4ae0ca 21.93/12.64 [2019-03-28 11:52:49,134 INFO L307 CDTParser]: Found 1 translation units. 21.93/12.64 [2019-03-28 11:52:49,135 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 21.93/12.64 [2019-03-28 11:52:49,135 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 21.93/12.64 [2019-03-28 11:52:49,142 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/60ce8e92fccd499d924c01041c41e8ac/FLAGe5f4ae0ca 21.93/12.64 [2019-03-28 11:52:49,544 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/60ce8e92fccd499d924c01041c41e8ac 21.93/12.64 [2019-03-28 11:52:49,556 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 21.93/12.64 [2019-03-28 11:52:49,558 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 21.93/12.64 [2019-03-28 11:52:49,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 21.93/12.64 [2019-03-28 11:52:49,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 21.93/12.64 [2019-03-28 11:52:49,562 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 21.93/12.64 [2019-03-28 11:52:49,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:52:49" (1/1) ... 21.93/12.64 [2019-03-28 11:52:49,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46f15c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:52:49, skipping insertion in model container 21.93/12.64 [2019-03-28 11:52:49,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:52:49" (1/1) ... 21.93/12.64 [2019-03-28 11:52:49,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 21.93/12.64 [2019-03-28 11:52:49,592 INFO L176 MainTranslator]: Built tables and reachable declarations 21.93/12.64 [2019-03-28 11:52:49,760 INFO L206 PostProcessor]: Analyzing one entry point: main 21.93/12.64 [2019-03-28 11:52:49,771 INFO L191 MainTranslator]: Completed pre-run 21.93/12.64 [2019-03-28 11:52:49,844 INFO L206 PostProcessor]: Analyzing one entry point: main 21.93/12.64 [2019-03-28 11:52:49,861 INFO L195 MainTranslator]: Completed translation 21.93/12.64 [2019-03-28 11:52:49,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:52:49 WrapperNode 21.93/12.64 [2019-03-28 11:52:49,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 21.93/12.64 [2019-03-28 11:52:49,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 21.93/12.64 [2019-03-28 11:52:49,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 21.93/12.64 [2019-03-28 11:52:49,863 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 21.93/12.64 [2019-03-28 11:52:49,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:52:49" (1/1) ... 21.93/12.64 [2019-03-28 11:52:49,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:52:49" (1/1) ... 21.93/12.64 [2019-03-28 11:52:49,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 21.93/12.64 [2019-03-28 11:52:49,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 21.93/12.64 [2019-03-28 11:52:49,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 21.93/12.64 [2019-03-28 11:52:49,904 INFO L276 PluginConnector]: Boogie Preprocessor initialized 21.93/12.64 [2019-03-28 11:52:49,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:52:49" (1/1) ... 21.93/12.64 [2019-03-28 11:52:49,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:52:49" (1/1) ... 21.93/12.64 [2019-03-28 11:52:49,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:52:49" (1/1) ... 21.93/12.64 [2019-03-28 11:52:49,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:52:49" (1/1) ... 21.93/12.64 [2019-03-28 11:52:49,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:52:49" (1/1) ... 21.93/12.64 [2019-03-28 11:52:49,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:52:49" (1/1) ... 21.93/12.64 [2019-03-28 11:52:49,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:52:49" (1/1) ... 21.93/12.64 [2019-03-28 11:52:49,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 21.93/12.64 [2019-03-28 11:52:49,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 21.93/12.64 [2019-03-28 11:52:49,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... 21.93/12.64 [2019-03-28 11:52:49,932 INFO L276 PluginConnector]: RCFGBuilder initialized 21.93/12.64 [2019-03-28 11:52:49,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:52:49" (1/1) ... 21.93/12.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 21.93/12.64 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 21.93/12.64 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 21.93/12.64 [2019-03-28 11:52:50,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 21.93/12.64 [2019-03-28 11:52:50,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap 21.93/12.64 [2019-03-28 11:52:50,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 21.93/12.64 [2019-03-28 11:52:50,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 21.93/12.64 [2019-03-28 11:52:50,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 21.93/12.64 [2019-03-28 11:52:50,613 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 21.93/12.64 [2019-03-28 11:52:50,614 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. 21.93/12.64 [2019-03-28 11:52:50,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:52:50 BoogieIcfgContainer 21.93/12.64 [2019-03-28 11:52:50,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 21.93/12.64 [2019-03-28 11:52:50,616 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 21.93/12.64 [2019-03-28 11:52:50,616 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 21.93/12.64 [2019-03-28 11:52:50,618 INFO L276 PluginConnector]: BlockEncodingV2 initialized 21.93/12.64 [2019-03-28 11:52:50,619 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:52:50" (1/1) ... 21.93/12.64 [2019-03-28 11:52:50,635 INFO L313 BlockEncoder]: Initial Icfg 19 locations, 21 edges 21.93/12.64 [2019-03-28 11:52:50,637 INFO L258 BlockEncoder]: Using Remove infeasible edges 21.93/12.64 [2019-03-28 11:52:50,637 INFO L263 BlockEncoder]: Using Maximize final states 21.93/12.64 [2019-03-28 11:52:50,638 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 21.93/12.64 [2019-03-28 11:52:50,638 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 21.93/12.64 [2019-03-28 11:52:50,640 INFO L296 BlockEncoder]: Using Remove sink states 21.93/12.64 [2019-03-28 11:52:50,641 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 21.93/12.64 [2019-03-28 11:52:50,641 INFO L179 BlockEncoder]: Using Rewrite not-equals 21.93/12.64 [2019-03-28 11:52:50,666 INFO L185 BlockEncoder]: Using Use SBE 21.93/12.64 [2019-03-28 11:52:50,696 INFO L200 BlockEncoder]: SBE split 8 edges 21.93/12.64 [2019-03-28 11:52:50,704 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 21.93/12.64 [2019-03-28 11:52:50,706 INFO L71 MaximizeFinalStates]: 0 new accepting states 21.93/12.64 [2019-03-28 11:52:50,727 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding 21.93/12.64 [2019-03-28 11:52:50,730 INFO L70 RemoveSinkStates]: Removed 9 edges and 2 locations by removing sink states 21.93/12.64 [2019-03-28 11:52:50,732 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 21.93/12.64 [2019-03-28 11:52:50,732 INFO L71 MaximizeFinalStates]: 0 new accepting states 21.93/12.64 [2019-03-28 11:52:50,732 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 21.93/12.64 [2019-03-28 11:52:50,733 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 21.93/12.64 [2019-03-28 11:52:50,733 INFO L313 BlockEncoder]: Encoded RCFG 12 locations, 20 edges 21.93/12.64 [2019-03-28 11:52:50,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:52:50 BasicIcfg 21.93/12.64 [2019-03-28 11:52:50,734 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 21.93/12.64 [2019-03-28 11:52:50,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 21.93/12.64 [2019-03-28 11:52:50,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... 21.93/12.64 [2019-03-28 11:52:50,738 INFO L276 PluginConnector]: TraceAbstraction initialized 21.93/12.64 [2019-03-28 11:52:50,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 11:52:49" (1/4) ... 21.93/12.64 [2019-03-28 11:52:50,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8b82c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:52:50, skipping insertion in model container 21.93/12.64 [2019-03-28 11:52:50,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:52:49" (2/4) ... 21.93/12.64 [2019-03-28 11:52:50,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8b82c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:52:50, skipping insertion in model container 21.93/12.64 [2019-03-28 11:52:50,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:52:50" (3/4) ... 21.93/12.64 [2019-03-28 11:52:50,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8b82c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:52:50, skipping insertion in model container 21.93/12.64 [2019-03-28 11:52:50,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:52:50" (4/4) ... 21.93/12.64 [2019-03-28 11:52:50,742 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 21.93/12.64 [2019-03-28 11:52:50,752 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 21.93/12.64 [2019-03-28 11:52:50,761 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. 21.93/12.64 [2019-03-28 11:52:50,778 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. 21.93/12.64 [2019-03-28 11:52:50,808 INFO L133 ementStrategyFactory]: Using default assertion order modulation 21.93/12.64 [2019-03-28 11:52:50,809 INFO L382 AbstractCegarLoop]: Interprodecural is true 21.93/12.64 [2019-03-28 11:52:50,809 INFO L383 AbstractCegarLoop]: Hoare is true 21.93/12.64 [2019-03-28 11:52:50,809 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 21.93/12.64 [2019-03-28 11:52:50,809 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 21.93/12.64 [2019-03-28 11:52:50,809 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 21.93/12.64 [2019-03-28 11:52:50,809 INFO L387 AbstractCegarLoop]: Difference is false 21.93/12.64 [2019-03-28 11:52:50,810 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 21.93/12.64 [2019-03-28 11:52:50,810 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 21.93/12.64 [2019-03-28 11:52:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. 21.93/12.64 [2019-03-28 11:52:50,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 21.93/12.64 [2019-03-28 11:52:50,831 INFO L394 BasicCegarLoop]: Found error trace 21.93/12.64 [2019-03-28 11:52:50,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 21.93/12.64 [2019-03-28 11:52:50,834 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 21.93/12.64 [2019-03-28 11:52:50,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.93/12.64 [2019-03-28 11:52:50,839 INFO L82 PathProgramCache]: Analyzing trace with hash 3653978, now seen corresponding path program 1 times 21.93/12.64 [2019-03-28 11:52:50,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.93/12.64 [2019-03-28 11:52:50,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.93/12.64 [2019-03-28 11:52:50,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:50,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:50,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.93/12.64 [2019-03-28 11:52:51,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.93/12.64 [2019-03-28 11:52:51,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.93/12.64 [2019-03-28 11:52:51,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 21.93/12.64 [2019-03-28 11:52:51,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 21.93/12.64 [2019-03-28 11:52:51,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 21.93/12.64 [2019-03-28 11:52:51,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 21.93/12.64 [2019-03-28 11:52:51,037 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. 21.93/12.64 [2019-03-28 11:52:51,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.93/12.64 [2019-03-28 11:52:51,098 INFO L93 Difference]: Finished difference Result 12 states and 20 transitions. 21.93/12.64 [2019-03-28 11:52:51,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 21.93/12.64 [2019-03-28 11:52:51,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 21.93/12.64 [2019-03-28 11:52:51,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 21.93/12.64 [2019-03-28 11:52:51,112 INFO L225 Difference]: With dead ends: 12 21.93/12.64 [2019-03-28 11:52:51,112 INFO L226 Difference]: Without dead ends: 11 21.93/12.64 [2019-03-28 11:52:51,115 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 21.93/12.64 [2019-03-28 11:52:51,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. 21.93/12.64 [2019-03-28 11:52:51,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 21.93/12.64 [2019-03-28 11:52:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 21.93/12.64 [2019-03-28 11:52:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. 21.93/12.64 [2019-03-28 11:52:51,151 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 18 transitions. Word has length 4 21.93/12.64 [2019-03-28 11:52:51,151 INFO L84 Accepts]: Finished accepts. word is rejected. 21.93/12.64 [2019-03-28 11:52:51,151 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 18 transitions. 21.93/12.64 [2019-03-28 11:52:51,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 21.93/12.64 [2019-03-28 11:52:51,152 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 18 transitions. 21.93/12.64 [2019-03-28 11:52:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 21.93/12.64 [2019-03-28 11:52:51,152 INFO L394 BasicCegarLoop]: Found error trace 21.93/12.64 [2019-03-28 11:52:51,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 21.93/12.64 [2019-03-28 11:52:51,153 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 21.93/12.64 [2019-03-28 11:52:51,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.93/12.64 [2019-03-28 11:52:51,153 INFO L82 PathProgramCache]: Analyzing trace with hash 3653980, now seen corresponding path program 1 times 21.93/12.64 [2019-03-28 11:52:51,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.93/12.64 [2019-03-28 11:52:51,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.93/12.64 [2019-03-28 11:52:51,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.93/12.64 [2019-03-28 11:52:51,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.93/12.64 [2019-03-28 11:52:51,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.93/12.64 [2019-03-28 11:52:51,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 21.93/12.64 [2019-03-28 11:52:51,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 21.93/12.64 [2019-03-28 11:52:51,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 21.93/12.64 [2019-03-28 11:52:51,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 21.93/12.64 [2019-03-28 11:52:51,196 INFO L87 Difference]: Start difference. First operand 11 states and 18 transitions. Second operand 4 states. 21.93/12.64 [2019-03-28 11:52:51,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.93/12.64 [2019-03-28 11:52:51,237 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. 21.93/12.64 [2019-03-28 11:52:51,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 21.93/12.64 [2019-03-28 11:52:51,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 21.93/12.64 [2019-03-28 11:52:51,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 21.93/12.64 [2019-03-28 11:52:51,239 INFO L225 Difference]: With dead ends: 12 21.93/12.64 [2019-03-28 11:52:51,239 INFO L226 Difference]: Without dead ends: 11 21.93/12.64 [2019-03-28 11:52:51,240 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 21.93/12.64 [2019-03-28 11:52:51,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. 21.93/12.64 [2019-03-28 11:52:51,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 21.93/12.64 [2019-03-28 11:52:51,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 21.93/12.64 [2019-03-28 11:52:51,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. 21.93/12.64 [2019-03-28 11:52:51,243 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 4 21.93/12.64 [2019-03-28 11:52:51,243 INFO L84 Accepts]: Finished accepts. word is rejected. 21.93/12.64 [2019-03-28 11:52:51,243 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. 21.93/12.64 [2019-03-28 11:52:51,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 21.93/12.64 [2019-03-28 11:52:51,244 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. 21.93/12.64 [2019-03-28 11:52:51,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 21.93/12.64 [2019-03-28 11:52:51,244 INFO L394 BasicCegarLoop]: Found error trace 21.93/12.64 [2019-03-28 11:52:51,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 21.93/12.64 [2019-03-28 11:52:51,245 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 21.93/12.64 [2019-03-28 11:52:51,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.93/12.64 [2019-03-28 11:52:51,245 INFO L82 PathProgramCache]: Analyzing trace with hash 3653981, now seen corresponding path program 1 times 21.93/12.64 [2019-03-28 11:52:51,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.93/12.64 [2019-03-28 11:52:51,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.93/12.64 [2019-03-28 11:52:51,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.93/12.64 [2019-03-28 11:52:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.93/12.64 [2019-03-28 11:52:51,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.93/12.64 [2019-03-28 11:52:51,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 21.93/12.64 [2019-03-28 11:52:51,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 21.93/12.64 [2019-03-28 11:52:51,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 21.93/12.64 [2019-03-28 11:52:51,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 21.93/12.64 [2019-03-28 11:52:51,279 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 3 states. 21.93/12.64 [2019-03-28 11:52:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.93/12.64 [2019-03-28 11:52:51,320 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. 21.93/12.64 [2019-03-28 11:52:51,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 21.93/12.64 [2019-03-28 11:52:51,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 21.93/12.64 [2019-03-28 11:52:51,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 21.93/12.64 [2019-03-28 11:52:51,321 INFO L225 Difference]: With dead ends: 11 21.93/12.64 [2019-03-28 11:52:51,321 INFO L226 Difference]: Without dead ends: 10 21.93/12.64 [2019-03-28 11:52:51,322 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 21.93/12.64 [2019-03-28 11:52:51,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. 21.93/12.64 [2019-03-28 11:52:51,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. 21.93/12.64 [2019-03-28 11:52:51,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 21.93/12.64 [2019-03-28 11:52:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. 21.93/12.64 [2019-03-28 11:52:51,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 4 21.93/12.64 [2019-03-28 11:52:51,325 INFO L84 Accepts]: Finished accepts. word is rejected. 21.93/12.64 [2019-03-28 11:52:51,325 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 16 transitions. 21.93/12.64 [2019-03-28 11:52:51,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 21.93/12.64 [2019-03-28 11:52:51,325 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 16 transitions. 21.93/12.64 [2019-03-28 11:52:51,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 21.93/12.64 [2019-03-28 11:52:51,326 INFO L394 BasicCegarLoop]: Found error trace 21.93/12.64 [2019-03-28 11:52:51,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 21.93/12.64 [2019-03-28 11:52:51,326 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 21.93/12.64 [2019-03-28 11:52:51,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.93/12.64 [2019-03-28 11:52:51,327 INFO L82 PathProgramCache]: Analyzing trace with hash 113274074, now seen corresponding path program 1 times 21.93/12.64 [2019-03-28 11:52:51,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.93/12.64 [2019-03-28 11:52:51,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.93/12.64 [2019-03-28 11:52:51,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.93/12.64 [2019-03-28 11:52:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.93/12.64 [2019-03-28 11:52:51,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.93/12.64 [2019-03-28 11:52:51,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 21.93/12.64 [2019-03-28 11:52:51,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 21.93/12.64 [2019-03-28 11:52:51,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 21.93/12.64 [2019-03-28 11:52:51,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 21.93/12.64 [2019-03-28 11:52:51,358 INFO L87 Difference]: Start difference. First operand 10 states and 16 transitions. Second operand 3 states. 21.93/12.64 [2019-03-28 11:52:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.93/12.64 [2019-03-28 11:52:51,395 INFO L93 Difference]: Finished difference Result 10 states and 16 transitions. 21.93/12.64 [2019-03-28 11:52:51,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 21.93/12.64 [2019-03-28 11:52:51,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 21.93/12.64 [2019-03-28 11:52:51,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 21.93/12.64 [2019-03-28 11:52:51,396 INFO L225 Difference]: With dead ends: 10 21.93/12.64 [2019-03-28 11:52:51,396 INFO L226 Difference]: Without dead ends: 9 21.93/12.64 [2019-03-28 11:52:51,396 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 21.93/12.64 [2019-03-28 11:52:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. 21.93/12.64 [2019-03-28 11:52:51,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. 21.93/12.64 [2019-03-28 11:52:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 21.93/12.64 [2019-03-28 11:52:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. 21.93/12.64 [2019-03-28 11:52:51,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 5 21.93/12.64 [2019-03-28 11:52:51,400 INFO L84 Accepts]: Finished accepts. word is rejected. 21.93/12.64 [2019-03-28 11:52:51,400 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. 21.93/12.64 [2019-03-28 11:52:51,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 21.93/12.64 [2019-03-28 11:52:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. 21.93/12.64 [2019-03-28 11:52:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 21.93/12.64 [2019-03-28 11:52:51,401 INFO L394 BasicCegarLoop]: Found error trace 21.93/12.64 [2019-03-28 11:52:51,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 21.93/12.64 [2019-03-28 11:52:51,401 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 21.93/12.64 [2019-03-28 11:52:51,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.93/12.64 [2019-03-28 11:52:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash 113274076, now seen corresponding path program 1 times 21.93/12.64 [2019-03-28 11:52:51,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.93/12.64 [2019-03-28 11:52:51,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.93/12.64 [2019-03-28 11:52:51,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.93/12.64 [2019-03-28 11:52:51,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.93/12.64 [2019-03-28 11:52:51,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.93/12.64 [2019-03-28 11:52:51,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 21.93/12.64 [2019-03-28 11:52:51,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 21.93/12.64 [2019-03-28 11:52:51,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 21.93/12.64 [2019-03-28 11:52:51,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 21.93/12.64 [2019-03-28 11:52:51,444 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. 21.93/12.64 [2019-03-28 11:52:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.93/12.64 [2019-03-28 11:52:51,488 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. 21.93/12.64 [2019-03-28 11:52:51,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 21.93/12.64 [2019-03-28 11:52:51,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 21.93/12.64 [2019-03-28 11:52:51,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 21.93/12.64 [2019-03-28 11:52:51,491 INFO L225 Difference]: With dead ends: 15 21.93/12.64 [2019-03-28 11:52:51,491 INFO L226 Difference]: Without dead ends: 14 21.93/12.64 [2019-03-28 11:52:51,491 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 21.93/12.64 [2019-03-28 11:52:51,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. 21.93/12.64 [2019-03-28 11:52:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. 21.93/12.64 [2019-03-28 11:52:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 21.93/12.64 [2019-03-28 11:52:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. 21.93/12.64 [2019-03-28 11:52:51,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 5 21.93/12.64 [2019-03-28 11:52:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. 21.93/12.64 [2019-03-28 11:52:51,497 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 16 transitions. 21.93/12.64 [2019-03-28 11:52:51,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 21.93/12.64 [2019-03-28 11:52:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 16 transitions. 21.93/12.64 [2019-03-28 11:52:51,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 21.93/12.64 [2019-03-28 11:52:51,497 INFO L394 BasicCegarLoop]: Found error trace 21.93/12.64 [2019-03-28 11:52:51,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 21.93/12.64 [2019-03-28 11:52:51,498 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 21.93/12.64 [2019-03-28 11:52:51,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.93/12.64 [2019-03-28 11:52:51,498 INFO L82 PathProgramCache]: Analyzing trace with hash 113274077, now seen corresponding path program 1 times 21.93/12.64 [2019-03-28 11:52:51,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.93/12.64 [2019-03-28 11:52:51,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.93/12.64 [2019-03-28 11:52:51,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.93/12.64 [2019-03-28 11:52:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.93/12.64 [2019-03-28 11:52:51,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.93/12.64 [2019-03-28 11:52:51,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 21.93/12.64 [2019-03-28 11:52:51,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 21.93/12.64 [2019-03-28 11:52:51,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 21.93/12.64 [2019-03-28 11:52:51,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 21.93/12.64 [2019-03-28 11:52:51,549 INFO L87 Difference]: Start difference. First operand 10 states and 16 transitions. Second operand 5 states. 21.93/12.64 [2019-03-28 11:52:51,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.93/12.64 [2019-03-28 11:52:51,607 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. 21.93/12.64 [2019-03-28 11:52:51,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 21.93/12.64 [2019-03-28 11:52:51,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 21.93/12.64 [2019-03-28 11:52:51,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 21.93/12.64 [2019-03-28 11:52:51,608 INFO L225 Difference]: With dead ends: 14 21.93/12.64 [2019-03-28 11:52:51,608 INFO L226 Difference]: Without dead ends: 13 21.93/12.64 [2019-03-28 11:52:51,609 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 21.93/12.64 [2019-03-28 11:52:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. 21.93/12.64 [2019-03-28 11:52:51,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. 21.93/12.64 [2019-03-28 11:52:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 21.93/12.64 [2019-03-28 11:52:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. 21.93/12.64 [2019-03-28 11:52:51,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 5 21.93/12.64 [2019-03-28 11:52:51,612 INFO L84 Accepts]: Finished accepts. word is rejected. 21.93/12.64 [2019-03-28 11:52:51,612 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 15 transitions. 21.93/12.64 [2019-03-28 11:52:51,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 21.93/12.64 [2019-03-28 11:52:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. 21.93/12.64 [2019-03-28 11:52:51,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 21.93/12.64 [2019-03-28 11:52:51,613 INFO L394 BasicCegarLoop]: Found error trace 21.93/12.64 [2019-03-28 11:52:51,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 21.93/12.64 [2019-03-28 11:52:51,613 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 21.93/12.64 [2019-03-28 11:52:51,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.93/12.64 [2019-03-28 11:52:51,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1482188220, now seen corresponding path program 1 times 21.93/12.64 [2019-03-28 11:52:51,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.93/12.64 [2019-03-28 11:52:51,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.93/12.64 [2019-03-28 11:52:51,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.93/12.64 [2019-03-28 11:52:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.93/12.64 [2019-03-28 11:52:51,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 21.93/12.64 [2019-03-28 11:52:51,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 21.93/12.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 21.93/12.64 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 21.93/12.64 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 21.93/12.64 [2019-03-28 11:52:51,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.93/12.64 [2019-03-28 11:52:51,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core 21.93/12.64 [2019-03-28 11:52:51,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.93/12.64 [2019-03-28 11:52:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.93/12.64 [2019-03-28 11:52:51,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 21.93/12.64 [2019-03-28 11:52:51,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 21.93/12.64 [2019-03-28 11:52:51,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 21.93/12.64 [2019-03-28 11:52:51,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 21.93/12.64 [2019-03-28 11:52:51,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 21.93/12.64 [2019-03-28 11:52:51,745 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. Second operand 6 states. 21.93/12.64 [2019-03-28 11:52:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.93/12.64 [2019-03-28 11:52:51,805 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. 21.93/12.64 [2019-03-28 11:52:51,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 21.93/12.64 [2019-03-28 11:52:51,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 21.93/12.64 [2019-03-28 11:52:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 21.93/12.64 [2019-03-28 11:52:51,806 INFO L225 Difference]: With dead ends: 14 21.93/12.64 [2019-03-28 11:52:51,806 INFO L226 Difference]: Without dead ends: 13 21.93/12.64 [2019-03-28 11:52:51,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 21.93/12.64 [2019-03-28 11:52:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. 21.93/12.64 [2019-03-28 11:52:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. 21.93/12.64 [2019-03-28 11:52:51,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 21.93/12.64 [2019-03-28 11:52:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. 21.93/12.64 [2019-03-28 11:52:51,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 7 21.93/12.64 [2019-03-28 11:52:51,810 INFO L84 Accepts]: Finished accepts. word is rejected. 21.93/12.64 [2019-03-28 11:52:51,810 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 14 transitions. 21.93/12.64 [2019-03-28 11:52:51,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 21.93/12.64 [2019-03-28 11:52:51,810 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. 21.93/12.64 [2019-03-28 11:52:51,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 21.93/12.64 [2019-03-28 11:52:51,811 INFO L394 BasicCegarLoop]: Found error trace 21.93/12.64 [2019-03-28 11:52:51,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 21.93/12.64 [2019-03-28 11:52:51,811 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 21.93/12.64 [2019-03-28 11:52:51,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.93/12.64 [2019-03-28 11:52:51,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1482188221, now seen corresponding path program 1 times 21.93/12.64 [2019-03-28 11:52:51,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.93/12.64 [2019-03-28 11:52:51,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.93/12.64 [2019-03-28 11:52:51,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.93/12.64 [2019-03-28 11:52:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.93/12.64 [2019-03-28 11:52:51,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.93/12.64 [2019-03-28 11:52:51,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 21.93/12.64 [2019-03-28 11:52:51,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 21.93/12.64 [2019-03-28 11:52:51,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 21.93/12.64 [2019-03-28 11:52:51,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 21.93/12.64 [2019-03-28 11:52:51,907 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand 6 states. 21.93/12.64 [2019-03-28 11:52:52,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.93/12.64 [2019-03-28 11:52:52,000 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. 21.93/12.64 [2019-03-28 11:52:52,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 21.93/12.64 [2019-03-28 11:52:52,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 21.93/12.64 [2019-03-28 11:52:52,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 21.93/12.64 [2019-03-28 11:52:52,002 INFO L225 Difference]: With dead ends: 21 21.93/12.64 [2019-03-28 11:52:52,002 INFO L226 Difference]: Without dead ends: 16 21.93/12.64 [2019-03-28 11:52:52,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 21.93/12.64 [2019-03-28 11:52:52,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. 21.93/12.64 [2019-03-28 11:52:52,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. 21.93/12.64 [2019-03-28 11:52:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 21.93/12.64 [2019-03-28 11:52:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. 21.93/12.64 [2019-03-28 11:52:52,007 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 7 21.93/12.64 [2019-03-28 11:52:52,007 INFO L84 Accepts]: Finished accepts. word is rejected. 21.93/12.64 [2019-03-28 11:52:52,007 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. 21.93/12.64 [2019-03-28 11:52:52,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 21.93/12.64 [2019-03-28 11:52:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. 21.93/12.64 [2019-03-28 11:52:52,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 21.93/12.64 [2019-03-28 11:52:52,008 INFO L394 BasicCegarLoop]: Found error trace 21.93/12.64 [2019-03-28 11:52:52,008 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 21.93/12.64 [2019-03-28 11:52:52,008 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 21.93/12.64 [2019-03-28 11:52:52,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.93/12.64 [2019-03-28 11:52:52,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1482186796, now seen corresponding path program 1 times 21.93/12.64 [2019-03-28 11:52:52,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.93/12.64 [2019-03-28 11:52:52,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.93/12.64 [2019-03-28 11:52:52,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:52,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:52,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.93/12.64 [2019-03-28 11:52:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.93/12.64 [2019-03-28 11:52:52,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.93/12.64 [2019-03-28 11:52:52,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 21.93/12.64 [2019-03-28 11:52:52,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 21.93/12.64 [2019-03-28 11:52:52,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 21.93/12.64 [2019-03-28 11:52:52,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 21.93/12.64 [2019-03-28 11:52:52,038 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 3 states. 21.93/12.64 [2019-03-28 11:52:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.93/12.64 [2019-03-28 11:52:52,061 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. 21.93/12.64 [2019-03-28 11:52:52,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 21.93/12.64 [2019-03-28 11:52:52,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 21.93/12.64 [2019-03-28 11:52:52,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 21.93/12.64 [2019-03-28 11:52:52,062 INFO L225 Difference]: With dead ends: 14 21.93/12.64 [2019-03-28 11:52:52,062 INFO L226 Difference]: Without dead ends: 8 21.93/12.64 [2019-03-28 11:52:52,063 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 21.93/12.64 [2019-03-28 11:52:52,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. 21.93/12.64 [2019-03-28 11:52:52,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. 21.93/12.64 [2019-03-28 11:52:52,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 21.93/12.64 [2019-03-28 11:52:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. 21.93/12.64 [2019-03-28 11:52:52,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 7 21.93/12.64 [2019-03-28 11:52:52,066 INFO L84 Accepts]: Finished accepts. word is rejected. 21.93/12.64 [2019-03-28 11:52:52,066 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. 21.93/12.64 [2019-03-28 11:52:52,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 21.93/12.64 [2019-03-28 11:52:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. 21.93/12.64 [2019-03-28 11:52:52,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 21.93/12.64 [2019-03-28 11:52:52,067 INFO L394 BasicCegarLoop]: Found error trace 21.93/12.64 [2019-03-28 11:52:52,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 21.93/12.64 [2019-03-28 11:52:52,068 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 21.93/12.64 [2019-03-28 11:52:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.93/12.64 [2019-03-28 11:52:52,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1768479731, now seen corresponding path program 1 times 21.93/12.64 [2019-03-28 11:52:52,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.93/12.64 [2019-03-28 11:52:52,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.93/12.64 [2019-03-28 11:52:52,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:52,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:52,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.93/12.64 [2019-03-28 11:52:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.93/12.64 [2019-03-28 11:52:52,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 21.93/12.64 [2019-03-28 11:52:52,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 21.93/12.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 21.93/12.64 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 21.93/12.64 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 21.93/12.64 [2019-03-28 11:52:52,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.93/12.64 [2019-03-28 11:52:52,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 26 conjunts are in the unsatisfiable core 21.93/12.64 [2019-03-28 11:52:52,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.93/12.64 [2019-03-28 11:52:52,294 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 21.93/12.64 [2019-03-28 11:52:52,294 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 21.93/12.64 [2019-03-28 11:52:52,306 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 21.93/12.64 [2019-03-28 11:52:52,307 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. 21.93/12.64 [2019-03-28 11:52:52,308 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 21.93/12.64 [2019-03-28 11:52:52,348 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 21.93/12.64 [2019-03-28 11:52:52,349 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 21.93/12.64 [2019-03-28 11:52:52,353 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 21.93/12.64 [2019-03-28 11:52:52,368 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 21.93/12.64 [2019-03-28 11:52:52,375 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 21.93/12.64 [2019-03-28 11:52:52,375 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 21.93/12.64 [2019-03-28 11:52:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.93/12.64 [2019-03-28 11:52:52,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 21.93/12.64 [2019-03-28 11:52:52,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 21.93/12.64 [2019-03-28 11:52:52,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 21.93/12.64 [2019-03-28 11:52:52,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 21.93/12.64 [2019-03-28 11:52:52,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 21.93/12.64 [2019-03-28 11:52:52,443 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 9 states. 21.93/12.64 [2019-03-28 11:52:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.93/12.64 [2019-03-28 11:52:52,693 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. 21.93/12.64 [2019-03-28 11:52:52,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 21.93/12.64 [2019-03-28 11:52:52,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 21.93/12.64 [2019-03-28 11:52:52,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 21.93/12.64 [2019-03-28 11:52:52,694 INFO L225 Difference]: With dead ends: 11 21.93/12.64 [2019-03-28 11:52:52,694 INFO L226 Difference]: Without dead ends: 10 21.93/12.64 [2019-03-28 11:52:52,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 21.93/12.64 [2019-03-28 11:52:52,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. 21.93/12.64 [2019-03-28 11:52:52,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. 21.93/12.64 [2019-03-28 11:52:52,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 21.93/12.64 [2019-03-28 11:52:52,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. 21.93/12.64 [2019-03-28 11:52:52,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 21.93/12.64 [2019-03-28 11:52:52,698 INFO L84 Accepts]: Finished accepts. word is rejected. 21.93/12.64 [2019-03-28 11:52:52,698 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. 21.93/12.64 [2019-03-28 11:52:52,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 21.93/12.64 [2019-03-28 11:52:52,698 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. 21.93/12.64 [2019-03-28 11:52:52,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 21.93/12.64 [2019-03-28 11:52:52,699 INFO L394 BasicCegarLoop]: Found error trace 21.93/12.64 [2019-03-28 11:52:52,699 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] 21.93/12.64 [2019-03-28 11:52:52,699 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 21.93/12.64 [2019-03-28 11:52:52,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.93/12.64 [2019-03-28 11:52:52,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1298045101, now seen corresponding path program 2 times 21.93/12.64 [2019-03-28 11:52:52,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.93/12.64 [2019-03-28 11:52:52,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.93/12.64 [2019-03-28 11:52:52,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:52,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:52,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.93/12.64 [2019-03-28 11:52:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.93/12.64 [2019-03-28 11:52:52,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 21.93/12.64 [2019-03-28 11:52:52,860 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 21.93/12.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 21.93/12.64 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 21.93/12.64 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 21.93/12.64 [2019-03-28 11:52:52,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 21.93/12.64 [2019-03-28 11:52:52,913 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 21.93/12.64 [2019-03-28 11:52:52,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 21.93/12.64 [2019-03-28 11:52:52,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 26 conjunts are in the unsatisfiable core 21.93/12.64 [2019-03-28 11:52:52,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.93/12.64 [2019-03-28 11:52:52,924 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 0 case distinctions, treesize of input 6 treesize of output 5 21.93/12.64 [2019-03-28 11:52:52,924 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 21.93/12.64 [2019-03-28 11:52:52,929 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 21.93/12.64 [2019-03-28 11:52:52,930 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 21.93/12.64 [2019-03-28 11:52:52,930 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 21.93/12.64 [2019-03-28 11:52:52,950 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 21.93/12.64 [2019-03-28 11:52:52,950 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 21.93/12.64 [2019-03-28 11:52:52,956 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 21.93/12.64 [2019-03-28 11:52:52,957 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. 21.93/12.64 [2019-03-28 11:52:52,957 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 21.93/12.64 [2019-03-28 11:52:52,992 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 21.93/12.64 [2019-03-28 11:52:52,992 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 21.93/12.64 [2019-03-28 11:52:52,994 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 21.93/12.64 [2019-03-28 11:52:53,004 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 21.93/12.64 [2019-03-28 11:52:53,007 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 21.93/12.64 [2019-03-28 11:52:53,007 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 21.93/12.64 [2019-03-28 11:52:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 21.93/12.64 [2019-03-28 11:52:53,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 21.93/12.64 [2019-03-28 11:52:53,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 21.93/12.64 [2019-03-28 11:52:53,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states 21.93/12.64 [2019-03-28 11:52:53,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. 21.93/12.64 [2019-03-28 11:52:53,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 21.93/12.64 [2019-03-28 11:52:53,073 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 10 states. 21.93/12.64 [2019-03-28 11:52:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.93/12.64 [2019-03-28 11:52:53,432 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. 21.93/12.64 [2019-03-28 11:52:53,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 21.93/12.64 [2019-03-28 11:52:53,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 21.93/12.64 [2019-03-28 11:52:53,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 21.93/12.64 [2019-03-28 11:52:53,433 INFO L225 Difference]: With dead ends: 14 21.93/12.64 [2019-03-28 11:52:53,433 INFO L226 Difference]: Without dead ends: 13 21.93/12.64 [2019-03-28 11:52:53,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 21.93/12.64 [2019-03-28 11:52:53,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. 21.93/12.64 [2019-03-28 11:52:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. 21.93/12.64 [2019-03-28 11:52:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 21.93/12.64 [2019-03-28 11:52:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. 21.93/12.64 [2019-03-28 11:52:53,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 21.93/12.64 [2019-03-28 11:52:53,438 INFO L84 Accepts]: Finished accepts. word is rejected. 21.93/12.64 [2019-03-28 11:52:53,438 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. 21.93/12.64 [2019-03-28 11:52:53,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. 21.93/12.64 [2019-03-28 11:52:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. 21.93/12.64 [2019-03-28 11:52:53,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 21.93/12.64 [2019-03-28 11:52:53,439 INFO L394 BasicCegarLoop]: Found error trace 21.93/12.64 [2019-03-28 11:52:53,439 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] 21.93/12.64 [2019-03-28 11:52:53,439 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 21.93/12.64 [2019-03-28 11:52:53,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.93/12.64 [2019-03-28 11:52:53,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1880843566, now seen corresponding path program 1 times 21.93/12.64 [2019-03-28 11:52:53,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.93/12.64 [2019-03-28 11:52:53,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.93/12.64 [2019-03-28 11:52:53,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:53,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:53,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.93/12.64 [2019-03-28 11:52:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 21.93/12.64 [2019-03-28 11:52:53,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 21.93/12.64 [2019-03-28 11:52:53,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 21.93/12.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 21.93/12.64 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 21.93/12.64 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 21.93/12.64 [2019-03-28 11:52:53,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.93/12.64 [2019-03-28 11:52:53,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 31 conjunts are in the unsatisfiable core 21.93/12.64 [2019-03-28 11:52:53,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.93/12.64 [2019-03-28 11:52:53,579 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 0 case distinctions, treesize of input 6 treesize of output 5 21.93/12.64 [2019-03-28 11:52:53,579 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 21.93/12.64 [2019-03-28 11:52:53,587 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 21.93/12.64 [2019-03-28 11:52:53,587 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 21.93/12.64 [2019-03-28 11:52:53,588 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 21.93/12.64 [2019-03-28 11:52:53,598 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 21.93/12.64 [2019-03-28 11:52:53,598 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 21.93/12.64 [2019-03-28 11:52:53,600 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 21.93/12.64 [2019-03-28 11:52:53,600 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 21.93/12.64 [2019-03-28 11:52:53,601 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 21.93/12.64 [2019-03-28 11:52:53,618 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 21.93/12.64 [2019-03-28 11:52:53,618 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 21.93/12.64 [2019-03-28 11:52:53,619 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 21.93/12.64 [2019-03-28 11:52:53,628 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 21.93/12.64 [2019-03-28 11:52:53,628 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 21.93/12.64 [2019-03-28 11:52:53,628 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 21.93/12.64 [2019-03-28 11:52:53,661 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. 21.93/12.64 [2019-03-28 11:52:53,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 21.93/12.64 [2019-03-28 11:52:53,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 21.93/12.64 [2019-03-28 11:52:53,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 21.93/12.64 [2019-03-28 11:52:53,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 21.93/12.64 [2019-03-28 11:52:53,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 21.93/12.64 [2019-03-28 11:52:53,689 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 8 states. 21.93/12.64 [2019-03-28 11:52:53,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.93/12.64 [2019-03-28 11:52:53,764 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. 21.93/12.64 [2019-03-28 11:52:53,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 21.93/12.64 [2019-03-28 11:52:53,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 21.93/12.64 [2019-03-28 11:52:53,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 21.93/12.64 [2019-03-28 11:52:53,765 INFO L225 Difference]: With dead ends: 12 21.93/12.64 [2019-03-28 11:52:53,765 INFO L226 Difference]: Without dead ends: 0 21.93/12.64 [2019-03-28 11:52:53,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 21.93/12.64 [2019-03-28 11:52:53,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 21.93/12.64 [2019-03-28 11:52:53,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 21.93/12.64 [2019-03-28 11:52:53,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 21.93/12.64 [2019-03-28 11:52:53,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 21.93/12.64 [2019-03-28 11:52:53,766 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 21.93/12.64 [2019-03-28 11:52:53,767 INFO L84 Accepts]: Finished accepts. word is rejected. 21.93/12.64 [2019-03-28 11:52:53,767 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 21.93/12.64 [2019-03-28 11:52:53,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 21.93/12.64 [2019-03-28 11:52:53,767 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 21.93/12.64 [2019-03-28 11:52:53,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 21.93/12.64 [2019-03-28 11:52:53,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 21.93/12.64 [2019-03-28 11:52:53,977 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 21.93/12.64 [2019-03-28 11:52:53,980 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 21.93/12.64 [2019-03-28 11:52:53,980 INFO L448 ceAbstractionStarter]: For program point L28-1(lines 28 29) no Hoare annotation was computed. 21.93/12.64 [2019-03-28 11:52:53,981 INFO L444 ceAbstractionStarter]: At program point L28-3(lines 28 29) the Hoare annotation is: (let ((.cse4 (select |#memory_int| ULTIMATE.start_cstrlen_~p~0.base)) (.cse1 (select |#length| ULTIMATE.start_cstrlen_~p~0.base))) (let ((.cse0 (= 0 ULTIMATE.start_cstrlen_~p~0.offset)) (.cse9 (<= (+ ULTIMATE.start_cstrlen_~p~0.offset 1) .cse1)) (.cse8 (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse2 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse3 (= (select |#valid| ULTIMATE.start_cstrlen_~p~0.base) 1)) (.cse5 (= ULTIMATE.start_cstrlen_~p~0.base ULTIMATE.start_cstrlen_~s.base)) (.cse6 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse10 (= 0 (select .cse4 (+ .cse1 (- 1))))) (.cse7 (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1))) (or (and (= (+ ULTIMATE.start___VERIFIER_nondet_String_~length~0 ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset) 1) .cse0 (<= 1 .cse1) .cse2 .cse3 (= (select .cse4 ULTIMATE.start_cstrlen_~p~0.offset) 0) .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse9 .cse3 .cse6 .cse10 .cse5 .cse7) (and (<= 1 ULTIMATE.start_cstrlen_~p~0.offset) .cse9 .cse8 .cse2 .cse3 .cse5 .cse6 .cse10 .cse7)))) 21.93/12.64 [2019-03-28 11:52:53,981 INFO L448 ceAbstractionStarter]: For program point L28-4(lines 28 29) no Hoare annotation was computed. 21.93/12.64 [2019-03-28 11:52:53,981 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. 21.93/12.64 [2019-03-28 11:52:53,981 INFO L444 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (and (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1)) 21.93/12.64 [2019-03-28 11:52:53,981 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 21.93/12.64 [2019-03-28 11:52:53,982 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 14) no Hoare annotation was computed. 21.93/12.64 [2019-03-28 11:52:53,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. 21.93/12.64 [2019-03-28 11:52:53,982 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 14) no Hoare annotation was computed. 21.93/12.64 [2019-03-28 11:52:53,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 21.93/12.64 [2019-03-28 11:52:53,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 30) no Hoare annotation was computed. 21.93/12.64 [2019-03-28 11:52:53,983 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 21.93/12.64 [2019-03-28 11:52:53,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:53,999 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:54,003 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:54,004 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 21.93/12.64 [2019-03-28 11:52:54,004 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:54,004 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:54,004 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:54,005 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 21.93/12.64 [2019-03-28 11:52:54,005 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:54,005 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:54,006 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:54,006 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 21.93/12.64 [2019-03-28 11:52:54,006 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:54,010 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:54,010 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 21.93/12.64 [2019-03-28 11:52:54,010 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:54,011 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:54,011 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:54,011 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 21.93/12.64 [2019-03-28 11:52:54,011 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:54,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:54,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:54,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 21.93/12.64 [2019-03-28 11:52:54,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:54,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:52:54 BasicIcfg 21.93/12.64 [2019-03-28 11:52:54,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 21.93/12.64 [2019-03-28 11:52:54,015 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 21.93/12.64 [2019-03-28 11:52:54,016 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 21.93/12.64 [2019-03-28 11:52:54,019 INFO L276 PluginConnector]: BuchiAutomizer initialized 21.93/12.64 [2019-03-28 11:52:54,020 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.93/12.64 [2019-03-28 11:52:54,020 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 11:52:49" (1/5) ... 21.93/12.64 [2019-03-28 11:52:54,020 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4383cfbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:52:54, skipping insertion in model container 21.93/12.64 [2019-03-28 11:52:54,021 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.93/12.64 [2019-03-28 11:52:54,021 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:52:49" (2/5) ... 21.93/12.64 [2019-03-28 11:52:54,021 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4383cfbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:52:54, skipping insertion in model container 21.93/12.64 [2019-03-28 11:52:54,021 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.93/12.64 [2019-03-28 11:52:54,021 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:52:50" (3/5) ... 21.93/12.64 [2019-03-28 11:52:54,022 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4383cfbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:52:54, skipping insertion in model container 21.93/12.64 [2019-03-28 11:52:54,022 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.93/12.64 [2019-03-28 11:52:54,022 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:52:50" (4/5) ... 21.93/12.64 [2019-03-28 11:52:54,022 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4383cfbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:52:54, skipping insertion in model container 21.93/12.64 [2019-03-28 11:52:54,022 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.93/12.64 [2019-03-28 11:52:54,022 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:52:54" (5/5) ... 21.93/12.64 [2019-03-28 11:52:54,024 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 21.93/12.64 [2019-03-28 11:52:54,044 INFO L133 ementStrategyFactory]: Using default assertion order modulation 21.93/12.64 [2019-03-28 11:52:54,044 INFO L374 BuchiCegarLoop]: Interprodecural is true 21.93/12.64 [2019-03-28 11:52:54,044 INFO L375 BuchiCegarLoop]: Hoare is true 21.93/12.64 [2019-03-28 11:52:54,044 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 21.93/12.64 [2019-03-28 11:52:54,044 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 21.93/12.64 [2019-03-28 11:52:54,044 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 21.93/12.64 [2019-03-28 11:52:54,045 INFO L379 BuchiCegarLoop]: Difference is false 21.93/12.64 [2019-03-28 11:52:54,045 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 21.93/12.64 [2019-03-28 11:52:54,045 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 21.93/12.64 [2019-03-28 11:52:54,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. 21.93/12.64 [2019-03-28 11:52:54,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 21.93/12.64 [2019-03-28 11:52:54,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.93/12.64 [2019-03-28 11:52:54,052 INFO L119 BuchiIsEmpty]: Starting construction of run 21.93/12.64 [2019-03-28 11:52:54,058 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 21.93/12.64 [2019-03-28 11:52:54,058 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 21.93/12.64 [2019-03-28 11:52:54,058 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 21.93/12.64 [2019-03-28 11:52:54,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. 21.93/12.64 [2019-03-28 11:52:54,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 21.93/12.64 [2019-03-28 11:52:54,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.93/12.64 [2019-03-28 11:52:54,060 INFO L119 BuchiIsEmpty]: Starting construction of run 21.93/12.64 [2019-03-28 11:52:54,060 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 21.93/12.64 [2019-03-28 11:52:54,060 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 21.93/12.64 [2019-03-28 11:52:54,065 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue [90] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_3|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_9|, ULTIMATE.start_main_#t~ret4.base=|v_ULTIMATE.start_main_#t~ret4.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_10, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_4|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_3|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_7, ULTIMATE.start_main_#t~ret4.offset=|v_ULTIMATE.start_main_#t~ret4.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, #NULL.offset, #NULL.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret4.base, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_main_#t~ret5, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret4.offset] 9#L12true [59] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 4#L12-2true [69] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 7#L16true [92] L16-->L28-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12))) (and (= |v_ULTIMATE.start_main_#t~ret4.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|) (<= .cse0 (select |v_#length_8| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= |v_ULTIMATE.start_cstrlen_#in~s.base_2| v_ULTIMATE.start_cstrlen_~s.base_5) (= |v_ULTIMATE.start_cstrlen_#in~s.offset_2| v_ULTIMATE.start_cstrlen_~s.offset_4) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrlen_#in~s.base_2| |v_ULTIMATE.start_main_#t~ret4.base_5|) (= |v_ULTIMATE.start_main_#t~ret4.base_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8) (= (store |v_#memory_int_7| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 (store (select |v_#memory_int_7| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12 (- 1)) 0)) |v_#memory_int_6|) (= v_ULTIMATE.start_cstrlen_~s.base_5 v_ULTIMATE.start_cstrlen_~p~0.base_10) (= |v_ULTIMATE.start_main_#t~ret4.offset_5| |v_ULTIMATE.start_cstrlen_#in~s.offset_2|) (= v_ULTIMATE.start_cstrlen_~p~0.offset_8 v_ULTIMATE.start_cstrlen_~s.offset_4) (= 1 (select |v_#valid_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, #length=|v_#length_8|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} OutVars{ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_8, ULTIMATE.start_cstrlen_#t~post3.offset=|v_ULTIMATE.start_cstrlen_#t~post3.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|, ULTIMATE.start_cstrlen_~s.base=v_ULTIMATE.start_cstrlen_~s.base_5, ULTIMATE.start_cstrlen_#in~s.base=|v_ULTIMATE.start_cstrlen_#in~s.base_2|, ULTIMATE.start_cstrlen_~s.offset=v_ULTIMATE.start_cstrlen_~s.offset_4, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_10, ULTIMATE.start_cstrlen_#in~s.offset=|v_ULTIMATE.start_cstrlen_#in~s.offset_2|, ULTIMATE.start_cstrlen_#res=|v_ULTIMATE.start_cstrlen_#res_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~ret4.base=|v_ULTIMATE.start_main_#t~ret4.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, #length=|v_#length_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|, ULTIMATE.start_cstrlen_#t~post3.base=|v_ULTIMATE.start_cstrlen_#t~post3.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9, ULTIMATE.start_cstrlen_#t~mem2=|v_ULTIMATE.start_cstrlen_#t~mem2_7|, ULTIMATE.start_main_#t~ret4.offset=|v_ULTIMATE.start_main_#t~ret4.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_~p~0.offset, ULTIMATE.start_cstrlen_#t~post3.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrlen_~s.base, ULTIMATE.start_cstrlen_#in~s.base, ULTIMATE.start_cstrlen_~s.offset, ULTIMATE.start_cstrlen_~p~0.base, ULTIMATE.start_cstrlen_#in~s.offset, ULTIMATE.start_cstrlen_#res, #memory_int, ULTIMATE.start_main_#t~ret4.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrlen_#t~post3.base, ULTIMATE.start_cstrlen_#t~mem2, ULTIMATE.start_main_#t~ret4.offset] 14#L28-3true 21.93/12.64 [2019-03-28 11:52:54,066 INFO L796 eck$LassoCheckResult]: Loop: 14#L28-3true [56] L28-3-->L28-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrlen_~p~0.offset_4 1) (select |v_#length_5| v_ULTIMATE.start_cstrlen_~p~0.base_4)) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrlen_~p~0.base_4) v_ULTIMATE.start_cstrlen_~p~0.offset_4) |v_ULTIMATE.start_cstrlen_#t~mem2_2|) (<= 0 v_ULTIMATE.start_cstrlen_~p~0.offset_4) (= 1 (select |v_#valid_7| v_ULTIMATE.start_cstrlen_~p~0.base_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_4, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_4, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrlen_#t~mem2=|v_ULTIMATE.start_cstrlen_#t~mem2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_#t~mem2] 8#L28-1true [88] L28-1-->L28-3: Formula: (and (= v_ULTIMATE.start_cstrlen_~p~0.offset_6 (+ v_ULTIMATE.start_cstrlen_~p~0.offset_7 1)) (> 0 |v_ULTIMATE.start_cstrlen_#t~mem2_6|) (= v_ULTIMATE.start_cstrlen_~p~0.base_8 v_ULTIMATE.start_cstrlen_~p~0.base_7)) InVars {ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_7, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_8, ULTIMATE.start_cstrlen_#t~mem2=|v_ULTIMATE.start_cstrlen_#t~mem2_6|} OutVars{ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_6, ULTIMATE.start_cstrlen_#t~post3.offset=|v_ULTIMATE.start_cstrlen_#t~post3.offset_2|, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_7, ULTIMATE.start_cstrlen_#t~post3.base=|v_ULTIMATE.start_cstrlen_#t~post3.base_2|, ULTIMATE.start_cstrlen_#t~mem2=|v_ULTIMATE.start_cstrlen_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_~p~0.offset, ULTIMATE.start_cstrlen_#t~post3.offset, ULTIMATE.start_cstrlen_~p~0.base, ULTIMATE.start_cstrlen_#t~post3.base, ULTIMATE.start_cstrlen_#t~mem2] 14#L28-3true 21.93/12.64 [2019-03-28 11:52:54,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.93/12.64 [2019-03-28 11:52:54,067 INFO L82 PathProgramCache]: Analyzing trace with hash 3663641, now seen corresponding path program 1 times 21.93/12.64 [2019-03-28 11:52:54,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.93/12.64 [2019-03-28 11:52:54,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.93/12.64 [2019-03-28 11:52:54,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:54,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:54,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.93/12.64 [2019-03-28 11:52:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.93/12.64 [2019-03-28 11:52:54,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.93/12.64 [2019-03-28 11:52:54,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2785, now seen corresponding path program 1 times 21.93/12.64 [2019-03-28 11:52:54,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.93/12.64 [2019-03-28 11:52:54,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.93/12.64 [2019-03-28 11:52:54,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:54,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:54,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.93/12.64 [2019-03-28 11:52:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.93/12.64 [2019-03-28 11:52:54,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.93/12.64 [2019-03-28 11:52:54,105 INFO L82 PathProgramCache]: Analyzing trace with hash -774206471, now seen corresponding path program 1 times 21.93/12.64 [2019-03-28 11:52:54,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.93/12.64 [2019-03-28 11:52:54,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.93/12.64 [2019-03-28 11:52:54,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:54,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:54,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.93/12.64 [2019-03-28 11:52:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.93/12.64 [2019-03-28 11:52:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.93/12.64 [2019-03-28 11:52:54,309 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 21.93/12.64 [2019-03-28 11:52:54,377 INFO L216 LassoAnalysis]: Preferences: 21.93/12.64 [2019-03-28 11:52:54,378 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.93/12.64 [2019-03-28 11:52:54,378 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.93/12.64 [2019-03-28 11:52:54,378 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.93/12.64 [2019-03-28 11:52:54,379 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.93/12.64 [2019-03-28 11:52:54,379 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.93/12.64 [2019-03-28 11:52:54,379 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.93/12.64 [2019-03-28 11:52:54,379 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.93/12.64 [2019-03-28 11:52:54,379 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 21.93/12.64 [2019-03-28 11:52:54,379 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.93/12.64 [2019-03-28 11:52:54,380 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.93/12.64 [2019-03-28 11:52:54,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.93/12.64 [2019-03-28 11:52:54,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.93/12.64 [2019-03-28 11:52:54,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.93/12.64 [2019-03-28 11:52:54,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.93/12.64 [2019-03-28 11:52:54,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.93/12.64 [2019-03-28 11:52:54,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.93/12.64 [2019-03-28 11:52:54,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.93/12.64 [2019-03-28 11:52:54,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.93/12.64 [2019-03-28 11:52:54,541 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 21.93/12.64 [2019-03-28 11:52:54,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.93/12.64 [2019-03-28 11:52:54,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.93/12.64 [2019-03-28 11:52:54,851 INFO L300 LassoAnalysis]: Preprocessing complete. 21.93/12.64 [2019-03-28 11:52:54,856 INFO L497 LassoAnalysis]: Using template 'affine'. 21.93/12.64 [2019-03-28 11:52:54,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.93/12.64 Termination analysis: LINEAR_WITH_GUESSES 21.93/12.64 Number of strict supporting invariants: 0 21.93/12.64 Number of non-strict supporting invariants: 1 21.93/12.64 Consider only non-deceasing supporting invariants: true 21.93/12.64 Simplify termination arguments: true 21.93/12.64 Simplify supporting invariants: trueOverapproximate stem: false 21.93/12.64 [2019-03-28 11:52:54,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.93/12.64 [2019-03-28 11:52:54,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.93/12.64 [2019-03-28 11:52:54,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.93/12.64 [2019-03-28 11:52:54,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.93/12.64 [2019-03-28 11:52:54,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.93/12.64 [2019-03-28 11:52:54,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.93/12.64 [2019-03-28 11:52:54,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.93/12.64 [2019-03-28 11:52:54,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.93/12.64 [2019-03-28 11:52:54,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.93/12.64 Termination analysis: LINEAR_WITH_GUESSES 21.93/12.64 Number of strict supporting invariants: 0 21.93/12.64 Number of non-strict supporting invariants: 1 21.93/12.64 Consider only non-deceasing supporting invariants: true 21.93/12.64 Simplify termination arguments: true 21.93/12.64 Simplify supporting invariants: trueOverapproximate stem: false 21.93/12.64 [2019-03-28 11:52:54,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.93/12.64 [2019-03-28 11:52:54,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.93/12.64 [2019-03-28 11:52:54,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.93/12.64 [2019-03-28 11:52:54,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.93/12.64 [2019-03-28 11:52:54,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.93/12.64 [2019-03-28 11:52:54,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.93/12.64 [2019-03-28 11:52:54,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.93/12.64 [2019-03-28 11:52:54,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.93/12.64 [2019-03-28 11:52:54,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.93/12.64 Termination analysis: LINEAR_WITH_GUESSES 21.93/12.64 Number of strict supporting invariants: 0 21.93/12.64 Number of non-strict supporting invariants: 1 21.93/12.64 Consider only non-deceasing supporting invariants: true 21.93/12.64 Simplify termination arguments: true 21.93/12.64 Simplify supporting invariants: trueOverapproximate stem: false 21.93/12.64 [2019-03-28 11:52:54,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.93/12.64 [2019-03-28 11:52:54,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.93/12.64 [2019-03-28 11:52:54,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.93/12.64 [2019-03-28 11:52:54,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.93/12.64 [2019-03-28 11:52:54,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.93/12.64 [2019-03-28 11:52:54,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.93/12.64 [2019-03-28 11:52:54,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.93/12.64 [2019-03-28 11:52:54,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.93/12.64 [2019-03-28 11:52:54,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.93/12.64 Termination analysis: LINEAR_WITH_GUESSES 21.93/12.64 Number of strict supporting invariants: 0 21.93/12.64 Number of non-strict supporting invariants: 1 21.93/12.64 Consider only non-deceasing supporting invariants: true 21.93/12.64 Simplify termination arguments: true 21.93/12.64 Simplify supporting invariants: trueOverapproximate stem: false 21.93/12.64 [2019-03-28 11:52:54,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.93/12.64 [2019-03-28 11:52:54,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.93/12.64 [2019-03-28 11:52:54,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.93/12.64 [2019-03-28 11:52:54,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.93/12.64 [2019-03-28 11:52:54,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.93/12.64 [2019-03-28 11:52:54,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.93/12.64 [2019-03-28 11:52:54,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.93/12.64 [2019-03-28 11:52:54,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.93/12.64 [2019-03-28 11:52:54,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.93/12.64 Termination analysis: LINEAR_WITH_GUESSES 21.93/12.64 Number of strict supporting invariants: 0 21.93/12.64 Number of non-strict supporting invariants: 1 21.93/12.64 Consider only non-deceasing supporting invariants: true 21.93/12.64 Simplify termination arguments: true 21.93/12.64 Simplify supporting invariants: trueOverapproximate stem: false 21.93/12.64 [2019-03-28 11:52:54,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.93/12.64 [2019-03-28 11:52:54,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.93/12.64 [2019-03-28 11:52:54,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.93/12.64 [2019-03-28 11:52:54,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.93/12.64 [2019-03-28 11:52:54,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.93/12.64 [2019-03-28 11:52:54,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.93/12.64 [2019-03-28 11:52:54,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.93/12.64 [2019-03-28 11:52:54,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.93/12.64 Termination analysis: LINEAR_WITH_GUESSES 21.93/12.64 Number of strict supporting invariants: 0 21.93/12.64 Number of non-strict supporting invariants: 1 21.93/12.64 Consider only non-deceasing supporting invariants: true 21.93/12.64 Simplify termination arguments: true 21.93/12.64 Simplify supporting invariants: trueOverapproximate stem: false 21.93/12.64 [2019-03-28 11:52:54,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.93/12.64 [2019-03-28 11:52:54,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.93/12.64 [2019-03-28 11:52:54,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.93/12.64 [2019-03-28 11:52:54,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.93/12.64 [2019-03-28 11:52:54,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.93/12.64 [2019-03-28 11:52:54,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.93/12.64 [2019-03-28 11:52:54,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.93/12.64 [2019-03-28 11:52:54,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.93/12.64 [2019-03-28 11:52:54,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.93/12.64 Termination analysis: LINEAR_WITH_GUESSES 21.93/12.64 Number of strict supporting invariants: 0 21.93/12.64 Number of non-strict supporting invariants: 1 21.93/12.64 Consider only non-deceasing supporting invariants: true 21.93/12.64 Simplify termination arguments: true 21.93/12.64 Simplify supporting invariants: trueOverapproximate stem: false 21.93/12.64 [2019-03-28 11:52:54,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.93/12.64 [2019-03-28 11:52:54,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.93/12.64 [2019-03-28 11:52:54,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.93/12.64 [2019-03-28 11:52:54,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.93/12.64 [2019-03-28 11:52:54,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.93/12.64 [2019-03-28 11:52:54,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.93/12.64 [2019-03-28 11:52:54,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.93/12.64 [2019-03-28 11:52:54,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.93/12.64 [2019-03-28 11:52:54,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.93/12.64 Termination analysis: LINEAR_WITH_GUESSES 21.93/12.64 Number of strict supporting invariants: 0 21.93/12.64 Number of non-strict supporting invariants: 1 21.93/12.64 Consider only non-deceasing supporting invariants: true 21.93/12.64 Simplify termination arguments: true 21.93/12.64 Simplify supporting invariants: trueOverapproximate stem: false 21.93/12.64 [2019-03-28 11:52:54,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.93/12.64 [2019-03-28 11:52:54,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.93/12.64 [2019-03-28 11:52:54,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.93/12.64 [2019-03-28 11:52:54,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.93/12.64 [2019-03-28 11:52:54,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.93/12.64 [2019-03-28 11:52:54,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.93/12.64 [2019-03-28 11:52:54,929 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 21.93/12.64 [2019-03-28 11:52:54,949 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 21.93/12.64 [2019-03-28 11:52:54,949 INFO L444 ModelExtractionUtils]: 30 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. 21.93/12.64 [2019-03-28 11:52:54,952 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 21.93/12.64 [2019-03-28 11:52:54,953 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 21.93/12.64 [2019-03-28 11:52:54,954 INFO L518 LassoAnalysis]: Proved termination. 21.93/12.64 [2019-03-28 11:52:54,954 INFO L520 LassoAnalysis]: Termination argument consisting of: 21.93/12.64 Ranking function f(ULTIMATE.start_cstrlen_~p~0.offset, v_rep(select #length ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base)_1) = -1*ULTIMATE.start_cstrlen_~p~0.offset + 1*v_rep(select #length ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base)_1 21.93/12.64 Supporting invariants [] 21.93/12.64 [2019-03-28 11:52:54,966 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed 21.93/12.64 [2019-03-28 11:52:54,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:54,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.93/12.64 [2019-03-28 11:52:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.93/12.64 [2019-03-28 11:52:55,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 14 conjunts are in the unsatisfiable core 21.93/12.64 [2019-03-28 11:52:55,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.93/12.64 [2019-03-28 11:52:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.93/12.64 [2019-03-28 11:52:55,032 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core 21.93/12.64 [2019-03-28 11:52:55,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.93/12.64 [2019-03-28 11:52:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.93/12.64 [2019-03-28 11:52:55,081 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 21.93/12.64 [2019-03-28 11:52:55,085 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates 21.93/12.64 [2019-03-28 11:52:55,086 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states. Second operand 4 states. 21.93/12.64 [2019-03-28 11:52:55,165 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 12 states.. Second operand 4 states. Result 18 states and 38 transitions. Complement of second has 7 states. 21.93/12.64 [2019-03-28 11:52:55,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states 21.93/12.64 [2019-03-28 11:52:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 21.93/12.64 [2019-03-28 11:52:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. 21.93/12.64 [2019-03-28 11:52:55,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 2 letters. 21.93/12.64 [2019-03-28 11:52:55,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.93/12.64 [2019-03-28 11:52:55,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 2 letters. 21.93/12.64 [2019-03-28 11:52:55,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.93/12.64 [2019-03-28 11:52:55,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 4 letters. 21.93/12.64 [2019-03-28 11:52:55,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.93/12.64 [2019-03-28 11:52:55,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 38 transitions. 21.93/12.64 [2019-03-28 11:52:55,178 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 21.93/12.64 [2019-03-28 11:52:55,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. 21.93/12.64 [2019-03-28 11:52:55,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 21.93/12.64 [2019-03-28 11:52:55,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 21.93/12.64 [2019-03-28 11:52:55,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 21.93/12.64 [2019-03-28 11:52:55,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 21.93/12.64 [2019-03-28 11:52:55,180 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 21.93/12.64 [2019-03-28 11:52:55,181 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 21.93/12.64 [2019-03-28 11:52:55,181 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 21.93/12.64 [2019-03-28 11:52:55,181 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 21.93/12.64 [2019-03-28 11:52:55,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 21.93/12.64 [2019-03-28 11:52:55,181 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 21.93/12.64 [2019-03-28 11:52:55,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 21.93/12.64 [2019-03-28 11:52:55,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:52:55 BasicIcfg 21.93/12.64 [2019-03-28 11:52:55,187 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 21.93/12.64 [2019-03-28 11:52:55,187 INFO L168 Benchmark]: Toolchain (without parser) took 5631.01 ms. Allocated memory was 649.6 MB in the beginning and 761.3 MB in the end (delta: 111.7 MB). Free memory was 559.1 MB in the beginning and 685.6 MB in the end (delta: -126.5 MB). There was no memory consumed. Max. memory is 50.3 GB. 21.93/12.64 [2019-03-28 11:52:55,188 INFO L168 Benchmark]: CDTParser took 0.23 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. 21.93/12.64 [2019-03-28 11:52:55,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.67 ms. Allocated memory was 649.6 MB in the beginning and 660.1 MB in the end (delta: 10.5 MB). Free memory was 558.0 MB in the beginning and 626.9 MB in the end (delta: -68.9 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. 21.93/12.64 [2019-03-28 11:52:55,189 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.69 ms. Allocated memory is still 660.1 MB. Free memory was 626.9 MB in the beginning and 623.0 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 21.93/12.64 [2019-03-28 11:52:55,190 INFO L168 Benchmark]: Boogie Preprocessor took 27.57 ms. Allocated memory is still 660.1 MB. Free memory was 623.0 MB in the beginning and 621.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 21.93/12.64 [2019-03-28 11:52:55,190 INFO L168 Benchmark]: RCFGBuilder took 683.75 ms. Allocated memory is still 660.1 MB. Free memory was 621.9 MB in the beginning and 602.7 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 50.3 GB. 21.93/12.64 [2019-03-28 11:52:55,191 INFO L168 Benchmark]: BlockEncodingV2 took 118.07 ms. Allocated memory is still 660.1 MB. Free memory was 602.7 MB in the beginning and 595.1 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 50.3 GB. 21.93/12.64 [2019-03-28 11:52:55,191 INFO L168 Benchmark]: TraceAbstraction took 3280.11 ms. Allocated memory was 660.1 MB in the beginning and 737.7 MB in the end (delta: 77.6 MB). Free memory was 594.0 MB in the beginning and 513.3 MB in the end (delta: 80.7 MB). Peak memory consumption was 158.3 MB. Max. memory is 50.3 GB. 21.93/12.64 [2019-03-28 11:52:55,192 INFO L168 Benchmark]: BuchiAutomizer took 1171.40 ms. Allocated memory was 737.7 MB in the beginning and 761.3 MB in the end (delta: 23.6 MB). Free memory was 513.3 MB in the beginning and 685.6 MB in the end (delta: -172.4 MB). There was no memory consumed. Max. memory is 50.3 GB. 21.93/12.64 [2019-03-28 11:52:55,196 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 21.93/12.64 --- Results --- 21.93/12.64 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 21.93/12.64 - StatisticsResult: Initial Icfg 21.93/12.64 19 locations, 21 edges 21.93/12.64 - StatisticsResult: Encoded RCFG 21.93/12.64 12 locations, 20 edges 21.93/12.64 * Results from de.uni_freiburg.informatik.ultimate.core: 21.93/12.64 - StatisticsResult: Toolchain Benchmarks 21.93/12.64 Benchmark results are: 21.93/12.64 * CDTParser took 0.23 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. 21.93/12.64 * CACSL2BoogieTranslator took 303.67 ms. Allocated memory was 649.6 MB in the beginning and 660.1 MB in the end (delta: 10.5 MB). Free memory was 558.0 MB in the beginning and 626.9 MB in the end (delta: -68.9 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. 21.93/12.64 * Boogie Procedure Inliner took 40.69 ms. Allocated memory is still 660.1 MB. Free memory was 626.9 MB in the beginning and 623.0 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 21.93/12.64 * Boogie Preprocessor took 27.57 ms. Allocated memory is still 660.1 MB. Free memory was 623.0 MB in the beginning and 621.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 21.93/12.64 * RCFGBuilder took 683.75 ms. Allocated memory is still 660.1 MB. Free memory was 621.9 MB in the beginning and 602.7 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 50.3 GB. 21.93/12.64 * BlockEncodingV2 took 118.07 ms. Allocated memory is still 660.1 MB. Free memory was 602.7 MB in the beginning and 595.1 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 50.3 GB. 21.93/12.64 * TraceAbstraction took 3280.11 ms. Allocated memory was 660.1 MB in the beginning and 737.7 MB in the end (delta: 77.6 MB). Free memory was 594.0 MB in the beginning and 513.3 MB in the end (delta: 80.7 MB). Peak memory consumption was 158.3 MB. Max. memory is 50.3 GB. 21.93/12.64 * BuchiAutomizer took 1171.40 ms. Allocated memory was 737.7 MB in the beginning and 761.3 MB in the end (delta: 23.6 MB). Free memory was 513.3 MB in the beginning and 685.6 MB in the end (delta: -172.4 MB). There was no memory consumed. Max. memory is 50.3 GB. 21.93/12.64 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #length 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #length 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #length 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #memory_int 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #length 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #length 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #length 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #memory_int 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #length 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #length 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #length 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #memory_int 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #length 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #length 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #memory_int 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #length 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #length 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #length 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #memory_int 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #length 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #length 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #length 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #memory_int 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #length 21.93/12.64 - GenericResult: Unfinished Backtranslation 21.93/12.64 unknown boogie variable #length 21.93/12.64 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 21.93/12.64 - PositiveResult [Line: 30]: pointer arithmetic is always legal 21.93/12.64 For all program executions holds that pointer arithmetic is always legal at this location 21.93/12.64 - PositiveResult [Line: 28]: pointer dereference always succeeds 21.93/12.64 For all program executions holds that pointer dereference always succeeds at this location 21.93/12.64 - PositiveResult [Line: 16]: pointer dereference always succeeds 21.93/12.64 For all program executions holds that pointer dereference always succeeds at this location 21.93/12.64 - PositiveResult [Line: 16]: pointer dereference always succeeds 21.93/12.64 For all program executions holds that pointer dereference always succeeds at this location 21.93/12.64 - PositiveResult [Line: 28]: pointer dereference always succeeds 21.93/12.64 For all program executions holds that pointer dereference always succeeds at this location 21.93/12.64 - AllSpecificationsHoldResult: All specifications hold 21.93/12.64 5 specifications checked. All of them hold 21.93/12.64 - InvariantResult [Line: 16]: Loop Invariant 21.93/12.64 [2019-03-28 11:52:55,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:55,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 Derived loop invariant: ((1 <= length && nondetString == 0) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1 21.93/12.64 - InvariantResult [Line: 28]: Loop Invariant 21.93/12.64 [2019-03-28 11:52:55,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:55,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 21.93/12.64 [2019-03-28 11:52:55,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:55,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:55,209 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:55,209 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 21.93/12.64 [2019-03-28 11:52:55,209 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:55,209 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:55,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:55,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 21.93/12.64 [2019-03-28 11:52:55,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:55,212 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:55,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 21.93/12.64 [2019-03-28 11:52:55,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:55,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:55,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:55,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 21.93/12.64 [2019-03-28 11:52:55,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:55,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:55,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 [2019-03-28 11:52:55,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 21.93/12.64 [2019-03-28 11:52:55,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.93/12.64 Derived loop invariant: (((((((((length + nondetString == 1 && 0 == p) && 1 <= unknown-#length-unknown[p]) && nondetString == 0) && \valid[p] == 1) && unknown-#memory_int-unknown[p][p] == 0) && p == s) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) || ((((((((0 == p && 1 <= length) && nondetString == 0) && p + 1 <= unknown-#length-unknown[p]) && \valid[p] == 1) && unknown-#length-unknown[nondetString] == length) && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1]) && p == s) && \valid[nondetString] == 1)) || ((((((((1 <= p && p + 1 <= unknown-#length-unknown[p]) && 1 <= length) && nondetString == 0) && \valid[p] == 1) && p == s) && unknown-#length-unknown[nondetString] == length) && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1]) && \valid[nondetString] == 1) 21.93/12.64 - StatisticsResult: Ultimate Automizer benchmark data 21.93/12.64 CFG has 1 procedures, 12 locations, 5 error locations. SAFE Result, 3.1s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 33 SDtfs, 171 SDslu, 79 SDs, 0 SdLazy, 322 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=8, 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.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 13 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 152 HoareAnnotationTreeSize, 2 FomulaSimplifications, 163 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 73 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 93 ConstructedInterpolants, 4 QuantifiedInterpolants, 4835 SizeOfPredicates, 33 NumberOfNonLiveVariables, 263 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 9/31 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 21.93/12.64 - StatisticsResult: Constructed decomposition of program 21.93/12.64 Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * p + unknown-#length-unknown[malloc(length * sizeof(char))] and consists of 5 locations. 21.93/12.64 - StatisticsResult: Timing statistics 21.93/12.64 BüchiAutomizer plugin needed 1.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 5 SDtfs, 54 SDslu, 3 SDs, 0 SdLazy, 41 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital123 mio100 ax100 hnf100 lsp95 ukn92 mio100 lsp47 div100 bol100 ite100 ukn100 eq198 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 21.93/12.64 - TerminationAnalysisResult: Termination proven 21.93/12.64 Buchi Automizer proved that your program is terminating 21.93/12.64 RESULT: Ultimate proved your program to be correct! 21.93/12.64 !SESSION 2019-03-28 11:52:45.586 ----------------------------------------------- 21.93/12.64 eclipse.buildId=unknown 21.93/12.64 java.version=1.8.0_181 21.93/12.64 java.vendor=Oracle Corporation 21.93/12.64 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 21.93/12.64 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 21.93/12.64 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 21.93/12.64 21.93/12.64 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 11:52:55.444 21.93/12.64 !MESSAGE The workspace will exit with unsaved changes in this session. 21.93/12.64 Received shutdown request... 21.93/12.64 Ultimate: 21.93/12.64 GTK+ Version Check 21.93/12.64 EOF