java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/sll2c_update_all_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:58:46,524 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:58:46,526 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:58:46,539 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:58:46,539 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:58:46,540 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:58:46,541 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:58:46,543 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:58:46,545 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:58:46,546 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:58:46,547 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:58:46,547 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:58:46,548 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:58:46,549 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:58:46,550 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:58:46,551 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:58:46,552 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:58:46,554 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:58:46,556 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:58:46,558 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:58:46,559 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:58:46,560 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:58:46,563 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:58:46,563 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:58:46,563 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:58:46,564 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:58:46,565 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:58:46,566 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:58:46,567 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:58:46,568 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:58:46,569 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:58:46,569 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:58:46,569 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:58:46,570 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:58:46,571 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:58:46,572 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:58:46,572 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:58:46,603 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:58:46,604 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:58:46,605 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:58:46,606 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:58:46,606 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:58:46,608 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:58:46,608 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:58:46,608 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:58:46,608 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:58:46,609 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:58:46,609 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:58:46,609 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:58:46,609 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:58:46,609 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:58:46,610 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:58:46,610 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:58:46,611 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:58:46,611 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:58:46,611 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:58:46,611 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:58:46,611 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:58:46,613 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:58:46,613 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:58:46,613 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:58:46,613 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:58:46,614 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:58:46,614 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:58:46,614 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:58:46,614 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:58:46,614 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:58:46,615 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:58:46,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:58:46,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:58:46,710 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:58:46,712 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:58:46,712 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:58:46,713 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:58:46,781 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0e9e2ddc/52a15e294572403ba95a730b809fba34/FLAGab9f977f4 [2018-11-23 12:58:47,347 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:58:47,348 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:58:47,362 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0e9e2ddc/52a15e294572403ba95a730b809fba34/FLAGab9f977f4 [2018-11-23 12:58:47,629 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0e9e2ddc/52a15e294572403ba95a730b809fba34 [2018-11-23 12:58:47,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:58:47,646 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:58:47,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:58:47,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:58:47,651 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:58:47,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:58:47" (1/1) ... [2018-11-23 12:58:47,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f288c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:47, skipping insertion in model container [2018-11-23 12:58:47,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:58:47" (1/1) ... [2018-11-23 12:58:47,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:58:47,728 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:58:48,119 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:58:48,135 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:58:48,198 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:58:48,291 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:58:48,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:48 WrapperNode [2018-11-23 12:58:48,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:58:48,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:58:48,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:58:48,293 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:58:48,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:48" (1/1) ... [2018-11-23 12:58:48,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:48" (1/1) ... [2018-11-23 12:58:48,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:58:48,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:58:48,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:58:48,410 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:58:48,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:48" (1/1) ... [2018-11-23 12:58:48,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:48" (1/1) ... [2018-11-23 12:58:48,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:48" (1/1) ... [2018-11-23 12:58:48,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:48" (1/1) ... [2018-11-23 12:58:48,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:48" (1/1) ... [2018-11-23 12:58:48,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:48" (1/1) ... [2018-11-23 12:58:48,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:48" (1/1) ... [2018-11-23 12:58:48,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:58:48,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:58:48,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:58:48,458 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:58:48,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:58:48,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:58:48,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:58:48,523 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:58:48,523 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:58:48,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:58:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 12:58:48,524 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 12:58:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:58:48,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:58:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:58:48,524 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:58:48,525 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2018-11-23 12:58:48,525 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2018-11-23 12:58:48,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:58:48,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:58:48,525 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-11-23 12:58:48,525 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-11-23 12:58:48,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:58:48,526 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-11-23 12:58:48,526 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-11-23 12:58:48,526 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2018-11-23 12:58:48,526 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2018-11-23 12:58:48,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:58:48,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:58:49,540 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:58:49,540 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 12:58:49,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:58:49 BoogieIcfgContainer [2018-11-23 12:58:49,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:58:49,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:58:49,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:58:49,546 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:58:49,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:58:47" (1/3) ... [2018-11-23 12:58:49,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1355423c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:58:49, skipping insertion in model container [2018-11-23 12:58:49,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:48" (2/3) ... [2018-11-23 12:58:49,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1355423c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:58:49, skipping insertion in model container [2018-11-23 12:58:49,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:58:49" (3/3) ... [2018-11-23 12:58:49,550 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:58:49,561 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:58:49,570 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:58:49,589 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:58:49,622 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:58:49,623 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:58:49,623 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:58:49,623 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:58:49,624 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:58:49,624 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:58:49,624 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:58:49,624 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:58:49,624 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:58:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-11-23 12:58:49,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:58:49,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:49,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:49,654 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:49,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:49,659 INFO L82 PathProgramCache]: Analyzing trace with hash 738413617, now seen corresponding path program 1 times [2018-11-23 12:58:49,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:49,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:49,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:49,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:49,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:50,082 INFO L256 TraceCheckUtils]: 0: Hoare triple {61#true} call ULTIMATE.init(); {61#true} is VALID [2018-11-23 12:58:50,086 INFO L273 TraceCheckUtils]: 1: Hoare triple {61#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {61#true} is VALID [2018-11-23 12:58:50,086 INFO L273 TraceCheckUtils]: 2: Hoare triple {61#true} assume true; {61#true} is VALID [2018-11-23 12:58:50,087 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {61#true} {61#true} #146#return; {61#true} is VALID [2018-11-23 12:58:50,087 INFO L256 TraceCheckUtils]: 4: Hoare triple {61#true} call #t~ret17 := main(); {61#true} is VALID [2018-11-23 12:58:50,088 INFO L273 TraceCheckUtils]: 5: Hoare triple {61#true} ~len~0 := 2;~data~0 := 1; {63#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:50,089 INFO L256 TraceCheckUtils]: 6: Hoare triple {63#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {61#true} is VALID [2018-11-23 12:58:50,094 INFO L273 TraceCheckUtils]: 7: Hoare triple {61#true} ~len := #in~len;~data := #in~data; {64#(<= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-23 12:58:50,094 INFO L256 TraceCheckUtils]: 8: Hoare triple {64#(<= |sll_circular_create_#in~len| sll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {61#true} is VALID [2018-11-23 12:58:50,095 INFO L273 TraceCheckUtils]: 9: Hoare triple {61#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {61#true} is VALID [2018-11-23 12:58:50,095 INFO L273 TraceCheckUtils]: 10: Hoare triple {61#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {61#true} is VALID [2018-11-23 12:58:50,095 INFO L273 TraceCheckUtils]: 11: Hoare triple {61#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 4 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {61#true} is VALID [2018-11-23 12:58:50,096 INFO L273 TraceCheckUtils]: 12: Hoare triple {61#true} assume true; {61#true} is VALID [2018-11-23 12:58:50,097 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {61#true} {64#(<= |sll_circular_create_#in~len| sll_circular_create_~len)} #142#return; {64#(<= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-23 12:58:50,101 INFO L273 TraceCheckUtils]: 14: Hoare triple {64#(<= |sll_circular_create_#in~len| sll_circular_create_~len)} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {64#(<= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-23 12:58:50,104 INFO L273 TraceCheckUtils]: 15: Hoare triple {64#(<= |sll_circular_create_#in~len| sll_circular_create_~len)} assume !(~len > 1); {65#(<= |sll_circular_create_#in~len| 1)} is VALID [2018-11-23 12:58:50,104 INFO L273 TraceCheckUtils]: 16: Hoare triple {65#(<= |sll_circular_create_#in~len| 1)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {65#(<= |sll_circular_create_#in~len| 1)} is VALID [2018-11-23 12:58:50,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {65#(<= |sll_circular_create_#in~len| 1)} assume true; {65#(<= |sll_circular_create_#in~len| 1)} is VALID [2018-11-23 12:58:50,107 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {65#(<= |sll_circular_create_#in~len| 1)} {63#(<= 2 main_~len~0)} #134#return; {62#false} is VALID [2018-11-23 12:58:50,107 INFO L273 TraceCheckUtils]: 19: Hoare triple {62#false} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := 0; {62#false} is VALID [2018-11-23 12:58:50,108 INFO L273 TraceCheckUtils]: 20: Hoare triple {62#false} assume !(~i~0 < ~len~0); {62#false} is VALID [2018-11-23 12:58:50,108 INFO L273 TraceCheckUtils]: 21: Hoare triple {62#false} ~i~0 := 0; {62#false} is VALID [2018-11-23 12:58:50,108 INFO L273 TraceCheckUtils]: 22: Hoare triple {62#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {62#false} is VALID [2018-11-23 12:58:50,109 INFO L256 TraceCheckUtils]: 23: Hoare triple {62#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {61#true} is VALID [2018-11-23 12:58:50,109 INFO L273 TraceCheckUtils]: 24: Hoare triple {61#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {61#true} is VALID [2018-11-23 12:58:50,109 INFO L273 TraceCheckUtils]: 25: Hoare triple {61#true} assume !(~index > 0); {61#true} is VALID [2018-11-23 12:58:50,110 INFO L273 TraceCheckUtils]: 26: Hoare triple {61#true} call #t~mem10 := read~int(~head.base, 4 + ~head.offset, 4);#res := #t~mem10;havoc #t~mem10; {61#true} is VALID [2018-11-23 12:58:50,110 INFO L273 TraceCheckUtils]: 27: Hoare triple {61#true} assume true; {61#true} is VALID [2018-11-23 12:58:50,110 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {61#true} {62#false} #138#return; {62#false} is VALID [2018-11-23 12:58:50,111 INFO L273 TraceCheckUtils]: 29: Hoare triple {62#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {62#false} is VALID [2018-11-23 12:58:50,111 INFO L273 TraceCheckUtils]: 30: Hoare triple {62#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {62#false} is VALID [2018-11-23 12:58:50,112 INFO L273 TraceCheckUtils]: 31: Hoare triple {62#false} assume !false; {62#false} is VALID [2018-11-23 12:58:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:50,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:58:50,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:58:50,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 12:58:50,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:58:50,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:58:50,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:50,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:58:50,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:58:50,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:58:50,295 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 5 states. [2018-11-23 12:58:51,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:51,388 INFO L93 Difference]: Finished difference Result 101 states and 133 transitions. [2018-11-23 12:58:51,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:58:51,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 12:58:51,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:58:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:58:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2018-11-23 12:58:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:58:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2018-11-23 12:58:51,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 133 transitions. [2018-11-23 12:58:51,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:51,764 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:58:51,764 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:58:51,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:58:51,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:58:52,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-23 12:58:52,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:58:52,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2018-11-23 12:58:52,170 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2018-11-23 12:58:52,171 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2018-11-23 12:58:52,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:52,178 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-23 12:58:52,178 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-23 12:58:52,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:52,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:52,180 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2018-11-23 12:58:52,180 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2018-11-23 12:58:52,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:52,193 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-23 12:58:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-23 12:58:52,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:52,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:52,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:58:52,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:58:52,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:58:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-23 12:58:52,208 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 32 [2018-11-23 12:58:52,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:58:52,208 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-23 12:58:52,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:58:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-23 12:58:52,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:58:52,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:52,216 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:52,216 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:52,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:52,218 INFO L82 PathProgramCache]: Analyzing trace with hash -708885943, now seen corresponding path program 1 times [2018-11-23 12:58:52,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:52,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:52,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:52,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:52,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:52,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {366#true} call ULTIMATE.init(); {366#true} is VALID [2018-11-23 12:58:52,401 INFO L273 TraceCheckUtils]: 1: Hoare triple {366#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {366#true} is VALID [2018-11-23 12:58:52,401 INFO L273 TraceCheckUtils]: 2: Hoare triple {366#true} assume true; {366#true} is VALID [2018-11-23 12:58:52,401 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {366#true} {366#true} #146#return; {366#true} is VALID [2018-11-23 12:58:52,401 INFO L256 TraceCheckUtils]: 4: Hoare triple {366#true} call #t~ret17 := main(); {366#true} is VALID [2018-11-23 12:58:52,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {366#true} ~len~0 := 2;~data~0 := 1; {368#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:52,403 INFO L256 TraceCheckUtils]: 6: Hoare triple {368#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {366#true} is VALID [2018-11-23 12:58:52,403 INFO L273 TraceCheckUtils]: 7: Hoare triple {366#true} ~len := #in~len;~data := #in~data; {366#true} is VALID [2018-11-23 12:58:52,404 INFO L256 TraceCheckUtils]: 8: Hoare triple {366#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {366#true} is VALID [2018-11-23 12:58:52,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {366#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {366#true} is VALID [2018-11-23 12:58:52,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {366#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {366#true} is VALID [2018-11-23 12:58:52,405 INFO L273 TraceCheckUtils]: 11: Hoare triple {366#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 4 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {366#true} is VALID [2018-11-23 12:58:52,405 INFO L273 TraceCheckUtils]: 12: Hoare triple {366#true} assume true; {366#true} is VALID [2018-11-23 12:58:52,406 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {366#true} {366#true} #142#return; {366#true} is VALID [2018-11-23 12:58:52,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {366#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {366#true} is VALID [2018-11-23 12:58:52,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {366#true} assume !!(~len > 1); {366#true} is VALID [2018-11-23 12:58:52,407 INFO L256 TraceCheckUtils]: 16: Hoare triple {366#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {366#true} is VALID [2018-11-23 12:58:52,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {366#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {366#true} is VALID [2018-11-23 12:58:52,407 INFO L273 TraceCheckUtils]: 18: Hoare triple {366#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {366#true} is VALID [2018-11-23 12:58:52,408 INFO L273 TraceCheckUtils]: 19: Hoare triple {366#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 4 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {366#true} is VALID [2018-11-23 12:58:52,408 INFO L273 TraceCheckUtils]: 20: Hoare triple {366#true} assume true; {366#true} is VALID [2018-11-23 12:58:52,408 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {366#true} {366#true} #144#return; {366#true} is VALID [2018-11-23 12:58:52,409 INFO L273 TraceCheckUtils]: 22: Hoare triple {366#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {366#true} is VALID [2018-11-23 12:58:52,409 INFO L273 TraceCheckUtils]: 23: Hoare triple {366#true} assume !(~len > 1); {366#true} is VALID [2018-11-23 12:58:52,409 INFO L273 TraceCheckUtils]: 24: Hoare triple {366#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {366#true} is VALID [2018-11-23 12:58:52,410 INFO L273 TraceCheckUtils]: 25: Hoare triple {366#true} assume true; {366#true} is VALID [2018-11-23 12:58:52,428 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {366#true} {368#(<= 2 main_~len~0)} #134#return; {368#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:52,443 INFO L273 TraceCheckUtils]: 27: Hoare triple {368#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := 0; {369#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 12:58:52,445 INFO L273 TraceCheckUtils]: 28: Hoare triple {369#(and (<= 2 main_~len~0) (= main_~i~0 0))} assume !(~i~0 < ~len~0); {367#false} is VALID [2018-11-23 12:58:52,446 INFO L273 TraceCheckUtils]: 29: Hoare triple {367#false} ~i~0 := 0; {367#false} is VALID [2018-11-23 12:58:52,446 INFO L273 TraceCheckUtils]: 30: Hoare triple {367#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {367#false} is VALID [2018-11-23 12:58:52,446 INFO L256 TraceCheckUtils]: 31: Hoare triple {367#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {366#true} is VALID [2018-11-23 12:58:52,447 INFO L273 TraceCheckUtils]: 32: Hoare triple {366#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {366#true} is VALID [2018-11-23 12:58:52,447 INFO L273 TraceCheckUtils]: 33: Hoare triple {366#true} assume !(~index > 0); {366#true} is VALID [2018-11-23 12:58:52,447 INFO L273 TraceCheckUtils]: 34: Hoare triple {366#true} call #t~mem10 := read~int(~head.base, 4 + ~head.offset, 4);#res := #t~mem10;havoc #t~mem10; {366#true} is VALID [2018-11-23 12:58:52,448 INFO L273 TraceCheckUtils]: 35: Hoare triple {366#true} assume true; {366#true} is VALID [2018-11-23 12:58:52,448 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {366#true} {367#false} #138#return; {367#false} is VALID [2018-11-23 12:58:52,448 INFO L273 TraceCheckUtils]: 37: Hoare triple {367#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {367#false} is VALID [2018-11-23 12:58:52,449 INFO L273 TraceCheckUtils]: 38: Hoare triple {367#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {367#false} is VALID [2018-11-23 12:58:52,449 INFO L273 TraceCheckUtils]: 39: Hoare triple {367#false} assume !false; {367#false} is VALID [2018-11-23 12:58:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:58:52,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:58:52,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:58:52,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-23 12:58:52,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:58:52,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:58:52,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:52,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:58:52,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:58:52,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:58:52,530 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 4 states. [2018-11-23 12:58:52,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:52,773 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-11-23 12:58:52,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:58:52,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-23 12:58:52,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:58:52,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:58:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2018-11-23 12:58:52,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:58:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2018-11-23 12:58:52,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2018-11-23 12:58:52,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:52,946 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:58:52,947 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:58:52,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:58:52,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:58:53,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-11-23 12:58:53,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:58:53,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 45 states. [2018-11-23 12:58:53,016 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 45 states. [2018-11-23 12:58:53,016 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 45 states. [2018-11-23 12:58:53,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:53,021 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-23 12:58:53,022 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-23 12:58:53,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:53,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:53,023 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 54 states. [2018-11-23 12:58:53,023 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 54 states. [2018-11-23 12:58:53,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:53,028 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-23 12:58:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-23 12:58:53,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:53,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:53,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:58:53,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:58:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:58:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-11-23 12:58:53,034 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 40 [2018-11-23 12:58:53,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:58:53,034 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-23 12:58:53,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:58:53,035 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-23 12:58:53,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:58:53,036 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:53,037 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:53,037 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:53,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:53,037 INFO L82 PathProgramCache]: Analyzing trace with hash 827422803, now seen corresponding path program 1 times [2018-11-23 12:58:53,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:53,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:53,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:53,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:53,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:53,211 INFO L256 TraceCheckUtils]: 0: Hoare triple {643#true} call ULTIMATE.init(); {643#true} is VALID [2018-11-23 12:58:53,212 INFO L273 TraceCheckUtils]: 1: Hoare triple {643#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {643#true} is VALID [2018-11-23 12:58:53,212 INFO L273 TraceCheckUtils]: 2: Hoare triple {643#true} assume true; {643#true} is VALID [2018-11-23 12:58:53,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {643#true} {643#true} #146#return; {643#true} is VALID [2018-11-23 12:58:53,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {643#true} call #t~ret17 := main(); {643#true} is VALID [2018-11-23 12:58:53,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {643#true} ~len~0 := 2;~data~0 := 1; {645#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:53,219 INFO L256 TraceCheckUtils]: 6: Hoare triple {645#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {643#true} is VALID [2018-11-23 12:58:53,219 INFO L273 TraceCheckUtils]: 7: Hoare triple {643#true} ~len := #in~len;~data := #in~data; {643#true} is VALID [2018-11-23 12:58:53,219 INFO L256 TraceCheckUtils]: 8: Hoare triple {643#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {643#true} is VALID [2018-11-23 12:58:53,220 INFO L273 TraceCheckUtils]: 9: Hoare triple {643#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {643#true} is VALID [2018-11-23 12:58:53,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {643#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {643#true} is VALID [2018-11-23 12:58:53,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {643#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 4 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {643#true} is VALID [2018-11-23 12:58:53,221 INFO L273 TraceCheckUtils]: 12: Hoare triple {643#true} assume true; {643#true} is VALID [2018-11-23 12:58:53,221 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {643#true} {643#true} #142#return; {643#true} is VALID [2018-11-23 12:58:53,221 INFO L273 TraceCheckUtils]: 14: Hoare triple {643#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {643#true} is VALID [2018-11-23 12:58:53,222 INFO L273 TraceCheckUtils]: 15: Hoare triple {643#true} assume !!(~len > 1); {643#true} is VALID [2018-11-23 12:58:53,222 INFO L256 TraceCheckUtils]: 16: Hoare triple {643#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {643#true} is VALID [2018-11-23 12:58:53,222 INFO L273 TraceCheckUtils]: 17: Hoare triple {643#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {643#true} is VALID [2018-11-23 12:58:53,223 INFO L273 TraceCheckUtils]: 18: Hoare triple {643#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {643#true} is VALID [2018-11-23 12:58:53,223 INFO L273 TraceCheckUtils]: 19: Hoare triple {643#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 4 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {643#true} is VALID [2018-11-23 12:58:53,223 INFO L273 TraceCheckUtils]: 20: Hoare triple {643#true} assume true; {643#true} is VALID [2018-11-23 12:58:53,223 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {643#true} {643#true} #144#return; {643#true} is VALID [2018-11-23 12:58:53,224 INFO L273 TraceCheckUtils]: 22: Hoare triple {643#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {643#true} is VALID [2018-11-23 12:58:53,224 INFO L273 TraceCheckUtils]: 23: Hoare triple {643#true} assume !(~len > 1); {643#true} is VALID [2018-11-23 12:58:53,224 INFO L273 TraceCheckUtils]: 24: Hoare triple {643#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {643#true} is VALID [2018-11-23 12:58:53,225 INFO L273 TraceCheckUtils]: 25: Hoare triple {643#true} assume true; {643#true} is VALID [2018-11-23 12:58:53,233 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {643#true} {645#(<= 2 main_~len~0)} #134#return; {645#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:53,234 INFO L273 TraceCheckUtils]: 27: Hoare triple {645#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := 0; {646#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 12:58:53,235 INFO L273 TraceCheckUtils]: 28: Hoare triple {646#(and (<= 2 main_~len~0) (= main_~i~0 0))} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {646#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 12:58:53,235 INFO L256 TraceCheckUtils]: 29: Hoare triple {646#(and (<= 2 main_~len~0) (= main_~i~0 0))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {643#true} is VALID [2018-11-23 12:58:53,235 INFO L273 TraceCheckUtils]: 30: Hoare triple {643#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {643#true} is VALID [2018-11-23 12:58:53,236 INFO L273 TraceCheckUtils]: 31: Hoare triple {643#true} assume !(~index > 0); {643#true} is VALID [2018-11-23 12:58:53,236 INFO L273 TraceCheckUtils]: 32: Hoare triple {643#true} call write~int(~data, ~head.base, 4 + ~head.offset, 4); {643#true} is VALID [2018-11-23 12:58:53,236 INFO L273 TraceCheckUtils]: 33: Hoare triple {643#true} assume true; {643#true} is VALID [2018-11-23 12:58:53,243 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {643#true} {646#(and (<= 2 main_~len~0) (= main_~i~0 0))} #136#return; {646#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 12:58:53,244 INFO L273 TraceCheckUtils]: 35: Hoare triple {646#(and (<= 2 main_~len~0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {647#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2018-11-23 12:58:53,249 INFO L273 TraceCheckUtils]: 36: Hoare triple {647#(<= (+ main_~i~0 1) main_~len~0)} assume !(~i~0 < ~len~0); {644#false} is VALID [2018-11-23 12:58:53,249 INFO L273 TraceCheckUtils]: 37: Hoare triple {644#false} ~i~0 := 0; {644#false} is VALID [2018-11-23 12:58:53,249 INFO L273 TraceCheckUtils]: 38: Hoare triple {644#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {644#false} is VALID [2018-11-23 12:58:53,249 INFO L256 TraceCheckUtils]: 39: Hoare triple {644#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {643#true} is VALID [2018-11-23 12:58:53,250 INFO L273 TraceCheckUtils]: 40: Hoare triple {643#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {643#true} is VALID [2018-11-23 12:58:53,250 INFO L273 TraceCheckUtils]: 41: Hoare triple {643#true} assume !(~index > 0); {643#true} is VALID [2018-11-23 12:58:53,250 INFO L273 TraceCheckUtils]: 42: Hoare triple {643#true} call #t~mem10 := read~int(~head.base, 4 + ~head.offset, 4);#res := #t~mem10;havoc #t~mem10; {643#true} is VALID [2018-11-23 12:58:53,251 INFO L273 TraceCheckUtils]: 43: Hoare triple {643#true} assume true; {643#true} is VALID [2018-11-23 12:58:53,251 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {643#true} {644#false} #138#return; {644#false} is VALID [2018-11-23 12:58:53,251 INFO L273 TraceCheckUtils]: 45: Hoare triple {644#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {644#false} is VALID [2018-11-23 12:58:53,251 INFO L273 TraceCheckUtils]: 46: Hoare triple {644#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {644#false} is VALID [2018-11-23 12:58:53,252 INFO L273 TraceCheckUtils]: 47: Hoare triple {644#false} assume !false; {644#false} is VALID [2018-11-23 12:58:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:58:53,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:58:53,256 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:58:53,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:53,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:53,823 INFO L256 TraceCheckUtils]: 0: Hoare triple {643#true} call ULTIMATE.init(); {643#true} is VALID [2018-11-23 12:58:53,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {643#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {643#true} is VALID [2018-11-23 12:58:53,824 INFO L273 TraceCheckUtils]: 2: Hoare triple {643#true} assume true; {643#true} is VALID [2018-11-23 12:58:53,824 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {643#true} {643#true} #146#return; {643#true} is VALID [2018-11-23 12:58:53,824 INFO L256 TraceCheckUtils]: 4: Hoare triple {643#true} call #t~ret17 := main(); {643#true} is VALID [2018-11-23 12:58:53,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {643#true} ~len~0 := 2;~data~0 := 1; {645#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:53,841 INFO L256 TraceCheckUtils]: 6: Hoare triple {645#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {643#true} is VALID [2018-11-23 12:58:53,841 INFO L273 TraceCheckUtils]: 7: Hoare triple {643#true} ~len := #in~len;~data := #in~data; {643#true} is VALID [2018-11-23 12:58:53,842 INFO L256 TraceCheckUtils]: 8: Hoare triple {643#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {643#true} is VALID [2018-11-23 12:58:53,842 INFO L273 TraceCheckUtils]: 9: Hoare triple {643#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {643#true} is VALID [2018-11-23 12:58:53,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {643#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {643#true} is VALID [2018-11-23 12:58:53,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {643#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 4 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {643#true} is VALID [2018-11-23 12:58:53,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {643#true} assume true; {643#true} is VALID [2018-11-23 12:58:53,843 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {643#true} {643#true} #142#return; {643#true} is VALID [2018-11-23 12:58:53,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {643#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {643#true} is VALID [2018-11-23 12:58:53,844 INFO L273 TraceCheckUtils]: 15: Hoare triple {643#true} assume !!(~len > 1); {643#true} is VALID [2018-11-23 12:58:53,844 INFO L256 TraceCheckUtils]: 16: Hoare triple {643#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {643#true} is VALID [2018-11-23 12:58:53,844 INFO L273 TraceCheckUtils]: 17: Hoare triple {643#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {643#true} is VALID [2018-11-23 12:58:53,844 INFO L273 TraceCheckUtils]: 18: Hoare triple {643#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {643#true} is VALID [2018-11-23 12:58:53,845 INFO L273 TraceCheckUtils]: 19: Hoare triple {643#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 4 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {643#true} is VALID [2018-11-23 12:58:53,845 INFO L273 TraceCheckUtils]: 20: Hoare triple {643#true} assume true; {643#true} is VALID [2018-11-23 12:58:53,845 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {643#true} {643#true} #144#return; {643#true} is VALID [2018-11-23 12:58:53,846 INFO L273 TraceCheckUtils]: 22: Hoare triple {643#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {643#true} is VALID [2018-11-23 12:58:53,846 INFO L273 TraceCheckUtils]: 23: Hoare triple {643#true} assume !(~len > 1); {643#true} is VALID [2018-11-23 12:58:53,846 INFO L273 TraceCheckUtils]: 24: Hoare triple {643#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {643#true} is VALID [2018-11-23 12:58:53,846 INFO L273 TraceCheckUtils]: 25: Hoare triple {643#true} assume true; {643#true} is VALID [2018-11-23 12:58:53,853 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {643#true} {645#(<= 2 main_~len~0)} #134#return; {645#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:53,854 INFO L273 TraceCheckUtils]: 27: Hoare triple {645#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := 0; {732#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-23 12:58:53,854 INFO L273 TraceCheckUtils]: 28: Hoare triple {732#(and (<= main_~i~0 0) (<= 2 main_~len~0))} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {732#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-23 12:58:53,855 INFO L256 TraceCheckUtils]: 29: Hoare triple {732#(and (<= main_~i~0 0) (<= 2 main_~len~0))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {643#true} is VALID [2018-11-23 12:58:53,855 INFO L273 TraceCheckUtils]: 30: Hoare triple {643#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {643#true} is VALID [2018-11-23 12:58:53,855 INFO L273 TraceCheckUtils]: 31: Hoare triple {643#true} assume !(~index > 0); {643#true} is VALID [2018-11-23 12:58:53,855 INFO L273 TraceCheckUtils]: 32: Hoare triple {643#true} call write~int(~data, ~head.base, 4 + ~head.offset, 4); {643#true} is VALID [2018-11-23 12:58:53,856 INFO L273 TraceCheckUtils]: 33: Hoare triple {643#true} assume true; {643#true} is VALID [2018-11-23 12:58:53,857 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {643#true} {732#(and (<= main_~i~0 0) (<= 2 main_~len~0))} #136#return; {732#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-23 12:58:53,857 INFO L273 TraceCheckUtils]: 35: Hoare triple {732#(and (<= main_~i~0 0) (<= 2 main_~len~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {757#(and (<= main_~i~0 1) (<= 2 main_~len~0))} is VALID [2018-11-23 12:58:53,858 INFO L273 TraceCheckUtils]: 36: Hoare triple {757#(and (<= main_~i~0 1) (<= 2 main_~len~0))} assume !(~i~0 < ~len~0); {644#false} is VALID [2018-11-23 12:58:53,858 INFO L273 TraceCheckUtils]: 37: Hoare triple {644#false} ~i~0 := 0; {644#false} is VALID [2018-11-23 12:58:53,859 INFO L273 TraceCheckUtils]: 38: Hoare triple {644#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {644#false} is VALID [2018-11-23 12:58:53,859 INFO L256 TraceCheckUtils]: 39: Hoare triple {644#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {644#false} is VALID [2018-11-23 12:58:53,859 INFO L273 TraceCheckUtils]: 40: Hoare triple {644#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {644#false} is VALID [2018-11-23 12:58:53,859 INFO L273 TraceCheckUtils]: 41: Hoare triple {644#false} assume !(~index > 0); {644#false} is VALID [2018-11-23 12:58:53,859 INFO L273 TraceCheckUtils]: 42: Hoare triple {644#false} call #t~mem10 := read~int(~head.base, 4 + ~head.offset, 4);#res := #t~mem10;havoc #t~mem10; {644#false} is VALID [2018-11-23 12:58:53,860 INFO L273 TraceCheckUtils]: 43: Hoare triple {644#false} assume true; {644#false} is VALID [2018-11-23 12:58:53,860 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {644#false} {644#false} #138#return; {644#false} is VALID [2018-11-23 12:58:53,860 INFO L273 TraceCheckUtils]: 45: Hoare triple {644#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {644#false} is VALID [2018-11-23 12:58:53,862 INFO L273 TraceCheckUtils]: 46: Hoare triple {644#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {644#false} is VALID [2018-11-23 12:58:53,862 INFO L273 TraceCheckUtils]: 47: Hoare triple {644#false} assume !false; {644#false} is VALID [2018-11-23 12:58:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:58:53,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:58:53,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 12:58:53,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-23 12:58:53,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:58:53,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:58:54,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:54,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:58:54,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:58:54,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:58:54,019 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 7 states. [2018-11-23 12:58:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:54,629 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2018-11-23 12:58:54,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:58:54,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-23 12:58:54,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:58:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:58:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2018-11-23 12:58:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:58:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2018-11-23 12:58:54,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2018-11-23 12:58:54,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:54,843 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:58:54,844 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 12:58:54,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:58:54,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 12:58:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2018-11-23 12:58:54,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:58:54,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 48 states. [2018-11-23 12:58:54,905 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 48 states. [2018-11-23 12:58:54,905 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 48 states. [2018-11-23 12:58:54,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:54,910 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-11-23 12:58:54,910 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-23 12:58:54,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:54,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:54,912 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 64 states. [2018-11-23 12:58:54,912 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 64 states. [2018-11-23 12:58:54,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:54,917 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-11-23 12:58:54,918 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-23 12:58:54,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:54,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:54,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:58:54,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:58:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:58:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-23 12:58:54,923 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 48 [2018-11-23 12:58:54,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:58:54,924 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-23 12:58:54,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:58:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-23 12:58:54,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:58:54,927 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:54,928 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:54,928 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:54,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:54,928 INFO L82 PathProgramCache]: Analyzing trace with hash 351929437, now seen corresponding path program 2 times [2018-11-23 12:58:54,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:54,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:54,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:54,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:54,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:55,205 INFO L256 TraceCheckUtils]: 0: Hoare triple {1106#true} call ULTIMATE.init(); {1106#true} is VALID [2018-11-23 12:58:55,206 INFO L273 TraceCheckUtils]: 1: Hoare triple {1106#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1106#true} is VALID [2018-11-23 12:58:55,206 INFO L273 TraceCheckUtils]: 2: Hoare triple {1106#true} assume true; {1106#true} is VALID [2018-11-23 12:58:55,207 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1106#true} {1106#true} #146#return; {1106#true} is VALID [2018-11-23 12:58:55,207 INFO L256 TraceCheckUtils]: 4: Hoare triple {1106#true} call #t~ret17 := main(); {1106#true} is VALID [2018-11-23 12:58:55,208 INFO L273 TraceCheckUtils]: 5: Hoare triple {1106#true} ~len~0 := 2;~data~0 := 1; {1108#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:55,208 INFO L256 TraceCheckUtils]: 6: Hoare triple {1108#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {1106#true} is VALID [2018-11-23 12:58:55,209 INFO L273 TraceCheckUtils]: 7: Hoare triple {1106#true} ~len := #in~len;~data := #in~data; {1106#true} is VALID [2018-11-23 12:58:55,209 INFO L256 TraceCheckUtils]: 8: Hoare triple {1106#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1106#true} is VALID [2018-11-23 12:58:55,209 INFO L273 TraceCheckUtils]: 9: Hoare triple {1106#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1106#true} is VALID [2018-11-23 12:58:55,209 INFO L273 TraceCheckUtils]: 10: Hoare triple {1106#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1106#true} is VALID [2018-11-23 12:58:55,209 INFO L273 TraceCheckUtils]: 11: Hoare triple {1106#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 4 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1106#true} is VALID [2018-11-23 12:58:55,210 INFO L273 TraceCheckUtils]: 12: Hoare triple {1106#true} assume true; {1106#true} is VALID [2018-11-23 12:58:55,210 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1106#true} {1106#true} #142#return; {1106#true} is VALID [2018-11-23 12:58:55,210 INFO L273 TraceCheckUtils]: 14: Hoare triple {1106#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1106#true} is VALID [2018-11-23 12:58:55,210 INFO L273 TraceCheckUtils]: 15: Hoare triple {1106#true} assume !!(~len > 1); {1106#true} is VALID [2018-11-23 12:58:55,210 INFO L256 TraceCheckUtils]: 16: Hoare triple {1106#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1106#true} is VALID [2018-11-23 12:58:55,211 INFO L273 TraceCheckUtils]: 17: Hoare triple {1106#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1106#true} is VALID [2018-11-23 12:58:55,211 INFO L273 TraceCheckUtils]: 18: Hoare triple {1106#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1106#true} is VALID [2018-11-23 12:58:55,211 INFO L273 TraceCheckUtils]: 19: Hoare triple {1106#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 4 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1106#true} is VALID [2018-11-23 12:58:55,211 INFO L273 TraceCheckUtils]: 20: Hoare triple {1106#true} assume true; {1106#true} is VALID [2018-11-23 12:58:55,211 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1106#true} {1106#true} #144#return; {1106#true} is VALID [2018-11-23 12:58:55,212 INFO L273 TraceCheckUtils]: 22: Hoare triple {1106#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1106#true} is VALID [2018-11-23 12:58:55,212 INFO L273 TraceCheckUtils]: 23: Hoare triple {1106#true} assume !(~len > 1); {1106#true} is VALID [2018-11-23 12:58:55,212 INFO L273 TraceCheckUtils]: 24: Hoare triple {1106#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1106#true} is VALID [2018-11-23 12:58:55,212 INFO L273 TraceCheckUtils]: 25: Hoare triple {1106#true} assume true; {1106#true} is VALID [2018-11-23 12:58:55,214 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1106#true} {1108#(<= 2 main_~len~0)} #134#return; {1108#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:55,214 INFO L273 TraceCheckUtils]: 27: Hoare triple {1108#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := 0; {1108#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:55,215 INFO L273 TraceCheckUtils]: 28: Hoare triple {1108#(<= 2 main_~len~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1108#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:55,215 INFO L256 TraceCheckUtils]: 29: Hoare triple {1108#(<= 2 main_~len~0)} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1106#true} is VALID [2018-11-23 12:58:55,215 INFO L273 TraceCheckUtils]: 30: Hoare triple {1106#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1106#true} is VALID [2018-11-23 12:58:55,215 INFO L273 TraceCheckUtils]: 31: Hoare triple {1106#true} assume !(~index > 0); {1106#true} is VALID [2018-11-23 12:58:55,216 INFO L273 TraceCheckUtils]: 32: Hoare triple {1106#true} call write~int(~data, ~head.base, 4 + ~head.offset, 4); {1106#true} is VALID [2018-11-23 12:58:55,216 INFO L273 TraceCheckUtils]: 33: Hoare triple {1106#true} assume true; {1106#true} is VALID [2018-11-23 12:58:55,217 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1106#true} {1108#(<= 2 main_~len~0)} #136#return; {1108#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:55,217 INFO L273 TraceCheckUtils]: 35: Hoare triple {1108#(<= 2 main_~len~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1108#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:55,218 INFO L273 TraceCheckUtils]: 36: Hoare triple {1108#(<= 2 main_~len~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1108#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:55,218 INFO L256 TraceCheckUtils]: 37: Hoare triple {1108#(<= 2 main_~len~0)} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1106#true} is VALID [2018-11-23 12:58:55,219 INFO L273 TraceCheckUtils]: 38: Hoare triple {1106#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1109#(<= |sll_circular_update_at_#in~index| sll_circular_update_at_~index)} is VALID [2018-11-23 12:58:55,220 INFO L273 TraceCheckUtils]: 39: Hoare triple {1109#(<= |sll_circular_update_at_#in~index| sll_circular_update_at_~index)} assume !(~index > 0); {1110#(<= |sll_circular_update_at_#in~index| 0)} is VALID [2018-11-23 12:58:55,221 INFO L273 TraceCheckUtils]: 40: Hoare triple {1110#(<= |sll_circular_update_at_#in~index| 0)} call write~int(~data, ~head.base, 4 + ~head.offset, 4); {1110#(<= |sll_circular_update_at_#in~index| 0)} is VALID [2018-11-23 12:58:55,221 INFO L273 TraceCheckUtils]: 41: Hoare triple {1110#(<= |sll_circular_update_at_#in~index| 0)} assume true; {1110#(<= |sll_circular_update_at_#in~index| 0)} is VALID [2018-11-23 12:58:55,223 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1110#(<= |sll_circular_update_at_#in~index| 0)} {1108#(<= 2 main_~len~0)} #136#return; {1111#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2018-11-23 12:58:55,224 INFO L273 TraceCheckUtils]: 43: Hoare triple {1111#(<= (+ main_~i~0 2) main_~len~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1112#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2018-11-23 12:58:55,225 INFO L273 TraceCheckUtils]: 44: Hoare triple {1112#(<= (+ main_~i~0 1) main_~len~0)} assume !(~i~0 < ~len~0); {1107#false} is VALID [2018-11-23 12:58:55,225 INFO L273 TraceCheckUtils]: 45: Hoare triple {1107#false} ~i~0 := 0; {1107#false} is VALID [2018-11-23 12:58:55,226 INFO L273 TraceCheckUtils]: 46: Hoare triple {1107#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {1107#false} is VALID [2018-11-23 12:58:55,226 INFO L256 TraceCheckUtils]: 47: Hoare triple {1107#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1106#true} is VALID [2018-11-23 12:58:55,226 INFO L273 TraceCheckUtils]: 48: Hoare triple {1106#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1106#true} is VALID [2018-11-23 12:58:55,227 INFO L273 TraceCheckUtils]: 49: Hoare triple {1106#true} assume !(~index > 0); {1106#true} is VALID [2018-11-23 12:58:55,227 INFO L273 TraceCheckUtils]: 50: Hoare triple {1106#true} call #t~mem10 := read~int(~head.base, 4 + ~head.offset, 4);#res := #t~mem10;havoc #t~mem10; {1106#true} is VALID [2018-11-23 12:58:55,227 INFO L273 TraceCheckUtils]: 51: Hoare triple {1106#true} assume true; {1106#true} is VALID [2018-11-23 12:58:55,228 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {1106#true} {1107#false} #138#return; {1107#false} is VALID [2018-11-23 12:58:55,228 INFO L273 TraceCheckUtils]: 53: Hoare triple {1107#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {1107#false} is VALID [2018-11-23 12:58:55,229 INFO L273 TraceCheckUtils]: 54: Hoare triple {1107#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1107#false} is VALID [2018-11-23 12:58:55,229 INFO L273 TraceCheckUtils]: 55: Hoare triple {1107#false} assume !false; {1107#false} is VALID [2018-11-23 12:58:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:58:55,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:58:55,233 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:58:55,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:58:55,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:58:55,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:58:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:55,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:55,485 INFO L256 TraceCheckUtils]: 0: Hoare triple {1106#true} call ULTIMATE.init(); {1106#true} is VALID [2018-11-23 12:58:55,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {1106#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1106#true} is VALID [2018-11-23 12:58:55,486 INFO L273 TraceCheckUtils]: 2: Hoare triple {1106#true} assume true; {1106#true} is VALID [2018-11-23 12:58:55,486 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1106#true} {1106#true} #146#return; {1106#true} is VALID [2018-11-23 12:58:55,486 INFO L256 TraceCheckUtils]: 4: Hoare triple {1106#true} call #t~ret17 := main(); {1106#true} is VALID [2018-11-23 12:58:55,487 INFO L273 TraceCheckUtils]: 5: Hoare triple {1106#true} ~len~0 := 2;~data~0 := 1; {1106#true} is VALID [2018-11-23 12:58:55,487 INFO L256 TraceCheckUtils]: 6: Hoare triple {1106#true} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {1106#true} is VALID [2018-11-23 12:58:55,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {1106#true} ~len := #in~len;~data := #in~data; {1106#true} is VALID [2018-11-23 12:58:55,487 INFO L256 TraceCheckUtils]: 8: Hoare triple {1106#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1106#true} is VALID [2018-11-23 12:58:55,488 INFO L273 TraceCheckUtils]: 9: Hoare triple {1106#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1106#true} is VALID [2018-11-23 12:58:55,488 INFO L273 TraceCheckUtils]: 10: Hoare triple {1106#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1106#true} is VALID [2018-11-23 12:58:55,488 INFO L273 TraceCheckUtils]: 11: Hoare triple {1106#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 4 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1106#true} is VALID [2018-11-23 12:58:55,488 INFO L273 TraceCheckUtils]: 12: Hoare triple {1106#true} assume true; {1106#true} is VALID [2018-11-23 12:58:55,489 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1106#true} {1106#true} #142#return; {1106#true} is VALID [2018-11-23 12:58:55,489 INFO L273 TraceCheckUtils]: 14: Hoare triple {1106#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1106#true} is VALID [2018-11-23 12:58:55,489 INFO L273 TraceCheckUtils]: 15: Hoare triple {1106#true} assume !!(~len > 1); {1106#true} is VALID [2018-11-23 12:58:55,490 INFO L256 TraceCheckUtils]: 16: Hoare triple {1106#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1106#true} is VALID [2018-11-23 12:58:55,490 INFO L273 TraceCheckUtils]: 17: Hoare triple {1106#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1106#true} is VALID [2018-11-23 12:58:55,490 INFO L273 TraceCheckUtils]: 18: Hoare triple {1106#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1106#true} is VALID [2018-11-23 12:58:55,490 INFO L273 TraceCheckUtils]: 19: Hoare triple {1106#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 4 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1106#true} is VALID [2018-11-23 12:58:55,491 INFO L273 TraceCheckUtils]: 20: Hoare triple {1106#true} assume true; {1106#true} is VALID [2018-11-23 12:58:55,491 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1106#true} {1106#true} #144#return; {1106#true} is VALID [2018-11-23 12:58:55,491 INFO L273 TraceCheckUtils]: 22: Hoare triple {1106#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1106#true} is VALID [2018-11-23 12:58:55,492 INFO L273 TraceCheckUtils]: 23: Hoare triple {1106#true} assume !(~len > 1); {1106#true} is VALID [2018-11-23 12:58:55,492 INFO L273 TraceCheckUtils]: 24: Hoare triple {1106#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1106#true} is VALID [2018-11-23 12:58:55,492 INFO L273 TraceCheckUtils]: 25: Hoare triple {1106#true} assume true; {1106#true} is VALID [2018-11-23 12:58:55,492 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1106#true} {1106#true} #134#return; {1106#true} is VALID [2018-11-23 12:58:55,497 INFO L273 TraceCheckUtils]: 27: Hoare triple {1106#true} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := 0; {1197#(<= 0 main_~i~0)} is VALID [2018-11-23 12:58:55,498 INFO L273 TraceCheckUtils]: 28: Hoare triple {1197#(<= 0 main_~i~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1197#(<= 0 main_~i~0)} is VALID [2018-11-23 12:58:55,499 INFO L256 TraceCheckUtils]: 29: Hoare triple {1197#(<= 0 main_~i~0)} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1106#true} is VALID [2018-11-23 12:58:55,499 INFO L273 TraceCheckUtils]: 30: Hoare triple {1106#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1106#true} is VALID [2018-11-23 12:58:55,499 INFO L273 TraceCheckUtils]: 31: Hoare triple {1106#true} assume !(~index > 0); {1106#true} is VALID [2018-11-23 12:58:55,500 INFO L273 TraceCheckUtils]: 32: Hoare triple {1106#true} call write~int(~data, ~head.base, 4 + ~head.offset, 4); {1106#true} is VALID [2018-11-23 12:58:55,500 INFO L273 TraceCheckUtils]: 33: Hoare triple {1106#true} assume true; {1106#true} is VALID [2018-11-23 12:58:55,502 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1106#true} {1197#(<= 0 main_~i~0)} #136#return; {1197#(<= 0 main_~i~0)} is VALID [2018-11-23 12:58:55,503 INFO L273 TraceCheckUtils]: 35: Hoare triple {1197#(<= 0 main_~i~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1222#(<= 1 main_~i~0)} is VALID [2018-11-23 12:58:55,503 INFO L273 TraceCheckUtils]: 36: Hoare triple {1222#(<= 1 main_~i~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1222#(<= 1 main_~i~0)} is VALID [2018-11-23 12:58:55,503 INFO L256 TraceCheckUtils]: 37: Hoare triple {1222#(<= 1 main_~i~0)} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1106#true} is VALID [2018-11-23 12:58:55,504 INFO L273 TraceCheckUtils]: 38: Hoare triple {1106#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1109#(<= |sll_circular_update_at_#in~index| sll_circular_update_at_~index)} is VALID [2018-11-23 12:58:55,505 INFO L273 TraceCheckUtils]: 39: Hoare triple {1109#(<= |sll_circular_update_at_#in~index| sll_circular_update_at_~index)} assume !(~index > 0); {1110#(<= |sll_circular_update_at_#in~index| 0)} is VALID [2018-11-23 12:58:55,505 INFO L273 TraceCheckUtils]: 40: Hoare triple {1110#(<= |sll_circular_update_at_#in~index| 0)} call write~int(~data, ~head.base, 4 + ~head.offset, 4); {1110#(<= |sll_circular_update_at_#in~index| 0)} is VALID [2018-11-23 12:58:55,506 INFO L273 TraceCheckUtils]: 41: Hoare triple {1110#(<= |sll_circular_update_at_#in~index| 0)} assume true; {1110#(<= |sll_circular_update_at_#in~index| 0)} is VALID [2018-11-23 12:58:55,508 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1110#(<= |sll_circular_update_at_#in~index| 0)} {1222#(<= 1 main_~i~0)} #136#return; {1107#false} is VALID [2018-11-23 12:58:55,508 INFO L273 TraceCheckUtils]: 43: Hoare triple {1107#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1107#false} is VALID [2018-11-23 12:58:55,508 INFO L273 TraceCheckUtils]: 44: Hoare triple {1107#false} assume !(~i~0 < ~len~0); {1107#false} is VALID [2018-11-23 12:58:55,509 INFO L273 TraceCheckUtils]: 45: Hoare triple {1107#false} ~i~0 := 0; {1107#false} is VALID [2018-11-23 12:58:55,509 INFO L273 TraceCheckUtils]: 46: Hoare triple {1107#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {1107#false} is VALID [2018-11-23 12:58:55,509 INFO L256 TraceCheckUtils]: 47: Hoare triple {1107#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1107#false} is VALID [2018-11-23 12:58:55,510 INFO L273 TraceCheckUtils]: 48: Hoare triple {1107#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1107#false} is VALID [2018-11-23 12:58:55,510 INFO L273 TraceCheckUtils]: 49: Hoare triple {1107#false} assume !(~index > 0); {1107#false} is VALID [2018-11-23 12:58:55,510 INFO L273 TraceCheckUtils]: 50: Hoare triple {1107#false} call #t~mem10 := read~int(~head.base, 4 + ~head.offset, 4);#res := #t~mem10;havoc #t~mem10; {1107#false} is VALID [2018-11-23 12:58:55,510 INFO L273 TraceCheckUtils]: 51: Hoare triple {1107#false} assume true; {1107#false} is VALID [2018-11-23 12:58:55,511 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {1107#false} {1107#false} #138#return; {1107#false} is VALID [2018-11-23 12:58:55,511 INFO L273 TraceCheckUtils]: 53: Hoare triple {1107#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {1107#false} is VALID [2018-11-23 12:58:55,511 INFO L273 TraceCheckUtils]: 54: Hoare triple {1107#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1107#false} is VALID [2018-11-23 12:58:55,511 INFO L273 TraceCheckUtils]: 55: Hoare triple {1107#false} assume !false; {1107#false} is VALID [2018-11-23 12:58:55,515 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:58:55,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:58:55,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-23 12:58:55,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-11-23 12:58:55,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:58:55,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:58:55,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:55,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:58:55,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:58:55,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:58:55,660 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2018-11-23 12:58:56,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:56,769 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2018-11-23 12:58:56,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:58:56,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-11-23 12:58:56,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:58:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:58:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2018-11-23 12:58:56,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:58:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2018-11-23 12:58:56,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2018-11-23 12:58:56,941 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:56,945 INFO L225 Difference]: With dead ends: 81 [2018-11-23 12:58:56,945 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:58:56,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:58:56,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:58:57,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-11-23 12:58:57,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:58:57,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 52 states. [2018-11-23 12:58:57,133 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 52 states. [2018-11-23 12:58:57,133 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 52 states. [2018-11-23 12:58:57,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:57,138 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-23 12:58:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-11-23 12:58:57,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:57,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:57,139 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 60 states. [2018-11-23 12:58:57,140 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 60 states. [2018-11-23 12:58:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:57,144 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-23 12:58:57,144 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-11-23 12:58:57,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:57,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:57,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:58:57,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:58:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:58:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-23 12:58:57,149 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 56 [2018-11-23 12:58:57,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:58:57,149 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-23 12:58:57,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:58:57,150 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-23 12:58:57,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:58:57,152 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:57,152 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:57,152 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:57,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:57,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2002797564, now seen corresponding path program 1 times [2018-11-23 12:58:57,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:57,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:57,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:57,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:58:57,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:58,229 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-23 12:58:59,021 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 12:58:59,071 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 12:58:59,076 INFO L168 Benchmark]: Toolchain (without parser) took 11431.18 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 862.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.0 MB). Peak memory consumption was 53.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:59,077 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:58:59,078 INFO L168 Benchmark]: CACSL2BoogieTranslator took 645.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:59,079 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -822.2 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:59,080 INFO L168 Benchmark]: Boogie Preprocessor took 48.17 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:58:59,080 INFO L168 Benchmark]: RCFGBuilder took 1083.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:59,081 INFO L168 Benchmark]: TraceAbstraction took 9532.15 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 130.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -78.6 MB). Peak memory consumption was 51.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:59,086 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 645.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 116.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -822.2 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.17 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1083.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9532.15 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 130.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -78.6 MB). Peak memory consumption was 51.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...