java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/memsafety/test-0521_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 10:16:58,415 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 10:16:58,417 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 10:16:58,431 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 10:16:58,432 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 10:16:58,433 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 10:16:58,434 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 10:16:58,435 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 10:16:58,437 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 10:16:58,438 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 10:16:58,439 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 10:16:58,439 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 10:16:58,440 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 10:16:58,441 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 10:16:58,442 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 10:16:58,445 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 10:16:58,447 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 10:16:58,449 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 10:16:58,450 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 10:16:58,452 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 10:16:58,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 10:16:58,454 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 10:16:58,455 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 10:16:58,456 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 10:16:58,456 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 10:16:58,458 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 10:16:58,458 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 10:16:58,459 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 10:16:58,459 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 10:16:58,459 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 10:16:58,460 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 10:16:58,460 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-21 10:16:58,469 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 10:16:58,469 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 10:16:58,470 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 10:16:58,470 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 10:16:58,470 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 10:16:58,470 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 10:16:58,470 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 10:16:58,470 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 10:16:58,471 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 10:16:58,471 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 10:16:58,471 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 10:16:58,471 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 10:16:58,471 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 10:16:58,471 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 10:16:58,472 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 10:16:58,472 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 10:16:58,472 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 10:16:58,472 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 10:16:58,472 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 10:16:58,472 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 10:16:58,472 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 10:16:58,473 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 10:16:58,473 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 10:16:58,473 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 10:16:58,473 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 10:16:58,473 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 10:16:58,473 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:16:58,474 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 10:16:58,474 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 10:16:58,474 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 10:16:58,474 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 10:16:58,474 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 10:16:58,474 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 10:16:58,474 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 10:16:58,474 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 10:16:58,475 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 10:16:58,475 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 10:16:58,475 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 10:16:58,475 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 10:16:58,507 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 10:16:58,517 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 10:16:58,521 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 10:16:58,522 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 10:16:58,522 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 10:16:58,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0521_true-valid-memsafety.i [2018-01-21 10:16:58,701 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 10:16:58,706 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 10:16:58,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 10:16:58,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 10:16:58,737 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 10:16:58,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:16:58" (1/1) ... [2018-01-21 10:16:58,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a32728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:16:58, skipping insertion in model container [2018-01-21 10:16:58,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:16:58" (1/1) ... [2018-01-21 10:16:58,753 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:16:58,794 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:16:58,917 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:16:58,942 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:16:58,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:16:58 WrapperNode [2018-01-21 10:16:58,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 10:16:58,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 10:16:58,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 10:16:58,954 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 10:16:58,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:16:58" (1/1) ... [2018-01-21 10:16:58,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:16:58" (1/1) ... [2018-01-21 10:16:58,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:16:58" (1/1) ... [2018-01-21 10:16:58,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:16:58" (1/1) ... [2018-01-21 10:16:58,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:16:58" (1/1) ... [2018-01-21 10:16:58,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:16:58" (1/1) ... [2018-01-21 10:16:58,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:16:58" (1/1) ... [2018-01-21 10:16:58,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 10:16:58,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 10:16:58,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 10:16:58,997 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 10:16:58,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:16:58" (1/1) ... No working directory specified, using /storage/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-01-21 10:16:59,046 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 10:16:59,046 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 10:16:59,047 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 10:16:59,047 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 10:16:59,047 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 10:16:59,047 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 10:16:59,047 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 10:16:59,047 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 10:16:59,047 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 10:16:59,047 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 10:16:59,047 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 10:16:59,047 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-21 10:16:59,048 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 10:16:59,048 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 10:16:59,048 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 10:16:59,048 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 10:16:59,586 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 10:16:59,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:16:59 BoogieIcfgContainer [2018-01-21 10:16:59,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 10:16:59,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 10:16:59,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 10:16:59,589 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 10:16:59,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 10:16:58" (1/3) ... [2018-01-21 10:16:59,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682e3036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:16:59, skipping insertion in model container [2018-01-21 10:16:59,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:16:58" (2/3) ... [2018-01-21 10:16:59,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682e3036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:16:59, skipping insertion in model container [2018-01-21 10:16:59,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:16:59" (3/3) ... [2018-01-21 10:16:59,594 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0521_true-valid-memsafety.i [2018-01-21 10:16:59,601 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 10:16:59,606 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 10:16:59,648 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:16:59,648 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:16:59,648 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:16:59,648 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:16:59,648 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:16:59,648 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:16:59,648 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:16:59,649 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 10:16:59,649 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:16:59,673 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2018-01-21 10:16:59,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 10:16:59,680 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:16:59,681 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 10:16:59,681 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 10:16:59,685 INFO L82 PathProgramCache]: Analyzing trace with hash 373147, now seen corresponding path program 1 times [2018-01-21 10:16:59,687 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:16:59,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:16:59,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:16:59,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:16:59,733 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:16:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:16:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:16:59,790 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:16:59,797 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:16:59,807 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:16:59,807 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:16:59,808 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:16:59,808 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:16:59,808 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:16:59,808 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:16:59,808 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:16:59,808 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 10:16:59,809 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:16:59,813 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2018-01-21 10:16:59,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 10:16:59,817 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:16:59,817 INFO L322 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] [2018-01-21 10:16:59,817 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:16:59,818 INFO L82 PathProgramCache]: Analyzing trace with hash -26575740, now seen corresponding path program 1 times [2018-01-21 10:16:59,818 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:16:59,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:16:59,819 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:16:59,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:16:59,820 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:16:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:16:59,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:16:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:16:59,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:16:59,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:16:59,874 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:16:59,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:16:59,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:16:59,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:16:59,977 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 2 states. [2018-01-21 10:17:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:17:00,010 INFO L93 Difference]: Finished difference Result 311 states and 385 transitions. [2018-01-21 10:17:00,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:17:00,012 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-21 10:17:00,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:17:00,028 INFO L225 Difference]: With dead ends: 311 [2018-01-21 10:17:00,028 INFO L226 Difference]: Without dead ends: 156 [2018-01-21 10:17:00,032 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:17:00,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-21 10:17:00,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-01-21 10:17:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-21 10:17:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2018-01-21 10:17:00,076 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 24 [2018-01-21 10:17:00,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:17:00,077 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2018-01-21 10:17:00,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:17:00,077 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2018-01-21 10:17:00,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 10:17:00,079 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:00,079 INFO L322 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-01-21 10:17:00,079 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:17:00,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1949893135, now seen corresponding path program 1 times [2018-01-21 10:17:00,080 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:00,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:00,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:00,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:00,081 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:17:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:17:00,133 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:17:00,143 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:17:00,144 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,144 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,145 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,145 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,145 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,145 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,146 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,146 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,146 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,147 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,147 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,147 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,148 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,148 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,148 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,149 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,149 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,149 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,150 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,150 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,150 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,151 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,151 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,151 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,152 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,152 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,152 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,153 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,153 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,153 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,153 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,154 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,154 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,154 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,154 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,155 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,155 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,155 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,156 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,156 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,156 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,157 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,157 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,157 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,157 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,158 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,158 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,158 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,159 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,159 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,159 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,159 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,160 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,160 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,160 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,160 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,160 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,160 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,161 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:17:00,161 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,161 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,162 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,162 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 10:17:00,162 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:17:00,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 10:17:00,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 10:17:00,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 10:17:00,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 10:17:00,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 10:17:00,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 10:17:00,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 10:17:00,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 10:17:00,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 10:17:00,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 10:17:00,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 10:17:00,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 10:17:00,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 10:17:00,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 10:17:00,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 10:17:00,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 10:17:00,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 10:17:00,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 10:17:00,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 10:17:00,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 10:17:00,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 10:17:00,182 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:17:00,182 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:17:00,182 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:17:00,182 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:17:00,182 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:17:00,182 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:17:00,182 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:17:00,182 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 10:17:00,183 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:17:00,186 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2018-01-21 10:17:00,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 10:17:00,188 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:00,188 INFO L322 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] [2018-01-21 10:17:00,188 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 10:17:00,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1595501289, now seen corresponding path program 1 times [2018-01-21 10:17:00,189 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:00,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:00,190 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:00,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:00,190 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:17:00,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:17:00,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:17:00,212 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:17:00,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:17:00,213 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:17:00,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:17:00,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:17:00,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:17:00,214 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 2 states. [2018-01-21 10:17:00,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:17:00,228 INFO L93 Difference]: Finished difference Result 311 states and 385 transitions. [2018-01-21 10:17:00,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:17:00,228 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-01-21 10:17:00,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:17:00,230 INFO L225 Difference]: With dead ends: 311 [2018-01-21 10:17:00,231 INFO L226 Difference]: Without dead ends: 154 [2018-01-21 10:17:00,232 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:17:00,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-21 10:17:00,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-01-21 10:17:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-21 10:17:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 181 transitions. [2018-01-21 10:17:00,243 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 181 transitions. Word has length 22 [2018-01-21 10:17:00,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:17:00,244 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 181 transitions. [2018-01-21 10:17:00,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:17:00,244 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 181 transitions. [2018-01-21 10:17:00,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 10:17:00,245 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:00,246 INFO L322 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] [2018-01-21 10:17:00,246 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 10:17:00,246 INFO L82 PathProgramCache]: Analyzing trace with hash -359570538, now seen corresponding path program 1 times [2018-01-21 10:17:00,246 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:00,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:00,247 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:00,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:00,248 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:17:00,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:17:00,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:17:00,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:17:00,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:17:00,312 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:17:00,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:17:00,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:17:00,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:17:00,313 INFO L87 Difference]: Start difference. First operand 154 states and 181 transitions. Second operand 3 states. [2018-01-21 10:17:00,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:17:00,405 INFO L93 Difference]: Finished difference Result 243 states and 292 transitions. [2018-01-21 10:17:00,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:17:00,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-01-21 10:17:00,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:17:00,408 INFO L225 Difference]: With dead ends: 243 [2018-01-21 10:17:00,408 INFO L226 Difference]: Without dead ends: 240 [2018-01-21 10:17:00,409 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:17:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-21 10:17:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 228. [2018-01-21 10:17:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-01-21 10:17:00,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 276 transitions. [2018-01-21 10:17:00,427 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 276 transitions. Word has length 30 [2018-01-21 10:17:00,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:17:00,427 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 276 transitions. [2018-01-21 10:17:00,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:17:00,427 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 276 transitions. [2018-01-21 10:17:00,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-21 10:17:00,429 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:00,429 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-21 10:17:00,429 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 10:17:00,429 INFO L82 PathProgramCache]: Analyzing trace with hash -123063933, now seen corresponding path program 1 times [2018-01-21 10:17:00,429 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:00,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:00,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:00,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:00,430 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:17:00,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:17:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:17:00,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:17:00,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:17:00,546 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:17:00,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:17:00,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:17:00,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:17:00,548 INFO L87 Difference]: Start difference. First operand 228 states and 276 transitions. Second operand 4 states. [2018-01-21 10:17:00,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:17:00,634 INFO L93 Difference]: Finished difference Result 489 states and 587 transitions. [2018-01-21 10:17:00,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:17:00,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-21 10:17:00,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:17:00,638 INFO L225 Difference]: With dead ends: 489 [2018-01-21 10:17:00,638 INFO L226 Difference]: Without dead ends: 313 [2018-01-21 10:17:00,639 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:17:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-01-21 10:17:00,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 236. [2018-01-21 10:17:00,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-01-21 10:17:00,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 285 transitions. [2018-01-21 10:17:00,656 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 285 transitions. Word has length 40 [2018-01-21 10:17:00,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:17:00,656 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 285 transitions. [2018-01-21 10:17:00,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:17:00,656 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 285 transitions. [2018-01-21 10:17:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 10:17:00,658 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:00,658 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-01-21 10:17:00,659 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 10:17:00,659 INFO L82 PathProgramCache]: Analyzing trace with hash 90705220, now seen corresponding path program 1 times [2018-01-21 10:17:00,659 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:00,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:00,660 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:00,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:00,660 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:17:00,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:17:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:17:00,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:17:00,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 10:17:00,780 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:17:00,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 10:17:00,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 10:17:00,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:17:00,781 INFO L87 Difference]: Start difference. First operand 236 states and 285 transitions. Second operand 6 states. [2018-01-21 10:17:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:17:01,142 INFO L93 Difference]: Finished difference Result 594 states and 707 transitions. [2018-01-21 10:17:01,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 10:17:01,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-01-21 10:17:01,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:17:01,145 INFO L225 Difference]: With dead ends: 594 [2018-01-21 10:17:01,145 INFO L226 Difference]: Without dead ends: 466 [2018-01-21 10:17:01,146 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-21 10:17:01,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-01-21 10:17:01,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 242. [2018-01-21 10:17:01,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-01-21 10:17:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 291 transitions. [2018-01-21 10:17:01,159 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 291 transitions. Word has length 46 [2018-01-21 10:17:01,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:17:01,160 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 291 transitions. [2018-01-21 10:17:01,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 10:17:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 291 transitions. [2018-01-21 10:17:01,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-21 10:17:01,162 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:01,162 INFO L322 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] [2018-01-21 10:17:01,162 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-21 10:17:01,163 INFO L82 PathProgramCache]: Analyzing trace with hash 166146402, now seen corresponding path program 1 times [2018-01-21 10:17:01,163 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:01,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:01,164 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:01,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:01,164 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:17:01,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:17:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 10:17:01,195 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:17:01,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 10:17:01,195 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:17:01,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:17:01,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:17:01,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:17:01,197 INFO L87 Difference]: Start difference. First operand 242 states and 291 transitions. Second operand 3 states. [2018-01-21 10:17:01,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:17:01,224 INFO L93 Difference]: Finished difference Result 394 states and 475 transitions. [2018-01-21 10:17:01,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:17:01,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-01-21 10:17:01,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:17:01,227 INFO L225 Difference]: With dead ends: 394 [2018-01-21 10:17:01,227 INFO L226 Difference]: Without dead ends: 244 [2018-01-21 10:17:01,228 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:17:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-01-21 10:17:01,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2018-01-21 10:17:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-01-21 10:17:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 292 transitions. [2018-01-21 10:17:01,240 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 292 transitions. Word has length 47 [2018-01-21 10:17:01,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:17:01,241 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 292 transitions. [2018-01-21 10:17:01,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:17:01,241 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 292 transitions. [2018-01-21 10:17:01,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-21 10:17:01,242 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:01,243 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-01-21 10:17:01,243 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-21 10:17:01,243 INFO L82 PathProgramCache]: Analyzing trace with hash -987135777, now seen corresponding path program 1 times [2018-01-21 10:17:01,243 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:01,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:01,244 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:01,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:01,245 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:17:01,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:17:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 10:17:01,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:17:01,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:17:01,330 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:17:01,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:17:01,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:17:01,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:17:01,332 INFO L87 Difference]: Start difference. First operand 244 states and 292 transitions. Second operand 5 states. [2018-01-21 10:17:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:17:01,393 INFO L93 Difference]: Finished difference Result 363 states and 429 transitions. [2018-01-21 10:17:01,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 10:17:01,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-01-21 10:17:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:17:01,395 INFO L225 Difference]: With dead ends: 363 [2018-01-21 10:17:01,395 INFO L226 Difference]: Without dead ends: 178 [2018-01-21 10:17:01,396 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 10:17:01,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-21 10:17:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 164. [2018-01-21 10:17:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-21 10:17:01,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 191 transitions. [2018-01-21 10:17:01,402 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 191 transitions. Word has length 49 [2018-01-21 10:17:01,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:17:01,403 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 191 transitions. [2018-01-21 10:17:01,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:17:01,403 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 191 transitions. [2018-01-21 10:17:01,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-21 10:17:01,404 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:01,404 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:17:01,404 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-21 10:17:01,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1230398727, now seen corresponding path program 1 times [2018-01-21 10:17:01,404 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:01,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:01,405 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:01,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:01,406 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:17:01,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:17:01,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:17:01,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:17:01,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-21 10:17:01,522 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:17:01,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-21 10:17:01,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-21 10:17:01,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-21 10:17:01,524 INFO L87 Difference]: Start difference. First operand 164 states and 191 transitions. Second operand 7 states. [2018-01-21 10:17:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:17:01,792 INFO L93 Difference]: Finished difference Result 439 states and 510 transitions. [2018-01-21 10:17:01,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 10:17:01,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-01-21 10:17:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:17:01,794 INFO L225 Difference]: With dead ends: 439 [2018-01-21 10:17:01,795 INFO L226 Difference]: Without dead ends: 334 [2018-01-21 10:17:01,795 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-21 10:17:01,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-21 10:17:01,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 208. [2018-01-21 10:17:01,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-21 10:17:01,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 245 transitions. [2018-01-21 10:17:01,806 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 245 transitions. Word has length 51 [2018-01-21 10:17:01,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:17:01,806 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 245 transitions. [2018-01-21 10:17:01,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-21 10:17:01,807 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 245 transitions. [2018-01-21 10:17:01,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-21 10:17:01,808 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:01,808 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:17:01,808 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-21 10:17:01,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1850402931, now seen corresponding path program 1 times [2018-01-21 10:17:01,808 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:01,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:01,809 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:01,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:01,809 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:17:01,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:17:01,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-21 10:17:01,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:17:01,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 10:17:01,922 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:17:01,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 10:17:01,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 10:17:01,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-21 10:17:01,923 INFO L87 Difference]: Start difference. First operand 208 states and 245 transitions. Second operand 8 states. [2018-01-21 10:17:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:17:02,319 INFO L93 Difference]: Finished difference Result 597 states and 689 transitions. [2018-01-21 10:17:02,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-21 10:17:02,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-01-21 10:17:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:17:02,322 INFO L225 Difference]: With dead ends: 597 [2018-01-21 10:17:02,322 INFO L226 Difference]: Without dead ends: 492 [2018-01-21 10:17:02,323 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-01-21 10:17:02,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-01-21 10:17:02,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 262. [2018-01-21 10:17:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-01-21 10:17:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 306 transitions. [2018-01-21 10:17:02,334 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 306 transitions. Word has length 65 [2018-01-21 10:17:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:17:02,334 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 306 transitions. [2018-01-21 10:17:02,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 10:17:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 306 transitions. [2018-01-21 10:17:02,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-21 10:17:02,335 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:02,335 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:17:02,335 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-21 10:17:02,335 INFO L82 PathProgramCache]: Analyzing trace with hash 835647732, now seen corresponding path program 1 times [2018-01-21 10:17:02,336 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:02,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:02,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:02,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:02,337 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:17:02,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:17:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 10:17:02,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:17:02,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-21 10:17:02,442 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:17:02,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-21 10:17:02,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-21 10:17:02,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-21 10:17:02,443 INFO L87 Difference]: Start difference. First operand 262 states and 306 transitions. Second operand 7 states. [2018-01-21 10:17:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:17:02,562 INFO L93 Difference]: Finished difference Result 451 states and 522 transitions. [2018-01-21 10:17:02,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 10:17:02,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-01-21 10:17:02,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:17:02,565 INFO L225 Difference]: With dead ends: 451 [2018-01-21 10:17:02,565 INFO L226 Difference]: Without dead ends: 398 [2018-01-21 10:17:02,566 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-21 10:17:02,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-01-21 10:17:02,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 265. [2018-01-21 10:17:02,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-01-21 10:17:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 309 transitions. [2018-01-21 10:17:02,577 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 309 transitions. Word has length 66 [2018-01-21 10:17:02,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:17:02,577 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 309 transitions. [2018-01-21 10:17:02,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-21 10:17:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 309 transitions. [2018-01-21 10:17:02,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-21 10:17:02,579 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:02,579 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:17:02,579 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-21 10:17:02,579 INFO L82 PathProgramCache]: Analyzing trace with hash -475061263, now seen corresponding path program 1 times [2018-01-21 10:17:02,579 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:02,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:02,580 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:02,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:02,580 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:17:02,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:17:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 10:17:02,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:17:02,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-21 10:17:02,810 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:17:02,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-21 10:17:02,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-21 10:17:02,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-21 10:17:02,811 INFO L87 Difference]: Start difference. First operand 265 states and 309 transitions. Second operand 12 states. [2018-01-21 10:17:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:17:03,499 INFO L93 Difference]: Finished difference Result 383 states and 446 transitions. [2018-01-21 10:17:03,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-21 10:17:03,499 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2018-01-21 10:17:03,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:17:03,500 INFO L225 Difference]: With dead ends: 383 [2018-01-21 10:17:03,501 INFO L226 Difference]: Without dead ends: 364 [2018-01-21 10:17:03,501 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2018-01-21 10:17:03,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-01-21 10:17:03,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 287. [2018-01-21 10:17:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-01-21 10:17:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 334 transitions. [2018-01-21 10:17:03,519 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 334 transitions. Word has length 68 [2018-01-21 10:17:03,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:17:03,519 INFO L432 AbstractCegarLoop]: Abstraction has 287 states and 334 transitions. [2018-01-21 10:17:03,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-21 10:17:03,520 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 334 transitions. [2018-01-21 10:17:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-21 10:17:03,520 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:03,521 INFO L322 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, 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-01-21 10:17:03,521 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-21 10:17:03,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1235268699, now seen corresponding path program 1 times [2018-01-21 10:17:03,521 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:03,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:03,522 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:03,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:03,522 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:17:03,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:17:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-21 10:17:03,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:17:03,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-21 10:17:03,868 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:17:03,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-21 10:17:03,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-21 10:17:03,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-01-21 10:17:03,869 INFO L87 Difference]: Start difference. First operand 287 states and 334 transitions. Second operand 14 states. [2018-01-21 10:17:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:17:04,619 INFO L93 Difference]: Finished difference Result 445 states and 523 transitions. [2018-01-21 10:17:04,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-21 10:17:04,620 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-01-21 10:17:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:17:04,622 INFO L225 Difference]: With dead ends: 445 [2018-01-21 10:17:04,622 INFO L226 Difference]: Without dead ends: 374 [2018-01-21 10:17:04,622 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2018-01-21 10:17:04,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-01-21 10:17:04,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 302. [2018-01-21 10:17:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-01-21 10:17:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 351 transitions. [2018-01-21 10:17:04,631 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 351 transitions. Word has length 74 [2018-01-21 10:17:04,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:17:04,631 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 351 transitions. [2018-01-21 10:17:04,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-21 10:17:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 351 transitions. [2018-01-21 10:17:04,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-21 10:17:04,632 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:04,632 INFO L322 BasicCegarLoop]: trace histogram [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, 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-01-21 10:17:04,632 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-21 10:17:04,632 INFO L82 PathProgramCache]: Analyzing trace with hash 906430885, now seen corresponding path program 1 times [2018-01-21 10:17:04,632 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:04,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:04,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:04,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:04,633 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:17:04,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:17:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-21 10:17:04,741 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:17:04,741 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:17:04,742 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2018-01-21 10:17:04,743 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [12], [13], [18], [20], [21], [22], [23], [24], [25], [30], [32], [33], [34], [38], [41], [42], [43], [47], [52], [53], [54], [57], [74], [78], [80], [85], [86], [87], [90], [108], [112], [114], [117], [118], [119], [125], [231], [234], [235], [236], [240], [245], [246], [247], [250], [267], [271], [273], [278], [279], [280], [283], [303], [307], [309], [310], [311], [312], [313], [317], [321], [331], [332], [336], [338], [339], [340], [346], [347], [348] [2018-01-21 10:17:04,792 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:17:04,792 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-21 10:17:57,464 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-21 10:17:57,465 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-21 10:17:57,465 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:17:57,465 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:17:57,465 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-21 10:17:57,471 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:57,471 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:17:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:17:57,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:17:57,538 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-21 10:17:57,539 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 10:17:57,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 10:17:57 BoogieIcfgContainer [2018-01-21 10:17:57,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 10:17:57,542 INFO L168 Benchmark]: Toolchain (without parser) took 58840.94 ms. Allocated memory was 305.1 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 264.1 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 406.8 MB. Max. memory is 5.3 GB. [2018-01-21 10:17:57,544 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:17:57,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.60 ms. Allocated memory is still 305.1 MB. Free memory was 264.1 MB in the beginning and 252.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:17:57,544 INFO L168 Benchmark]: Boogie Preprocessor took 42.88 ms. Allocated memory is still 305.1 MB. Free memory was 252.1 MB in the beginning and 248.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:17:57,545 INFO L168 Benchmark]: RCFGBuilder took 590.33 ms. Allocated memory is still 305.1 MB. Free memory was 248.1 MB in the beginning and 205.1 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:17:57,545 INFO L168 Benchmark]: TraceAbstraction took 57953.69 ms. Allocated memory was 305.1 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 205.1 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 347.9 MB. Max. memory is 5.3 GB. [2018-01-21 10:17:57,547 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.60 ms. Allocated memory is still 305.1 MB. Free memory was 264.1 MB in the beginning and 252.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.88 ms. Allocated memory is still 305.1 MB. Free memory was 252.1 MB in the beginning and 248.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 590.33 ms. Allocated memory is still 305.1 MB. Free memory was 248.1 MB in the beginning and 205.1 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57953.69 ms. Allocated memory was 305.1 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 205.1 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 347.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 159 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L634] struct list *data = ((void *)0); VAL [data={0:0}] [L636] COND FALSE !(__VERIFIER_nondet_int()) [L652] struct iterator iter; [L654] struct list *list = data; [L655] EXPR iter.list = list VAL [data={0:0}, iter={0:0}, list={0:0}] [L655] COND FALSE !((iter.list = list)) VAL [data={0:0}, iter={0:0}, list={0:0}] [L658] struct node *node; VAL [data={0:0}, iter={0:0}, list={0:0}] [L660] COND TRUE !iter.list [L661] node = ((void *)0) VAL [data={0:0}, iter={0:0}, list={0:0}, node={0:0}] [L673] COND FALSE !((node)) VAL [data={0:0}, iter={0:0}, list={0:0}, node={0:0}] [L692] struct list *list = data; VAL [data={0:0}, iter={0:0}, list={0:0}, list={0:0}, node={0:0}] [L693] list && list->next VAL [data={0:0}, iter={0:0}, list={0:0}, list={0:0}, list && list->next=0, node={0:0}] [L693] COND FALSE !(list && list->next) [L726] data = list [L729] struct iterator iter; [L731] struct list *list = data; [L732] EXPR iter.list = list VAL [data={0:0}, iter={0:0}, iter={0:0}, list={0:0}, list={0:0}, list={0:0}, node={0:0}] [L732] COND FALSE !((iter.list = list)) VAL [data={0:0}, iter={0:0}, iter={0:0}, list={0:0}, list={0:0}, list={0:0}, node={0:0}] [L735] struct node *node; VAL [data={0:0}, iter={0:0}, iter={0:0}, list={0:0}, list={0:0}, list={0:0}, node={0:0}] [L737] COND TRUE !iter.list [L738] node = ((void *)0) VAL [data={0:0}, iter={0:0}, iter={0:0}, list={0:0}, list={0:0}, list={0:0}, node={0:0}, node={0:0}] [L750] COND FALSE !((node)) VAL [data={0:0}, iter={0:0}, iter={0:0}, list={0:0}, list={0:0}, list={0:0}, node={0:0}, node={0:0}] [L769] COND FALSE !(\read(*data)) VAL [data={0:0}, iter={0:0}, iter={0:0}, list={0:0}, list={0:0}, list={0:0}, node={0:0}, node={0:0}] [L781] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 159 locations, 3 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 186 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 5 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 159 locations, 3 error locations. TIMEOUT Result, 57.3s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2137 SDtfs, 6197 SDslu, 6216 SDs, 0 SdLazy, 1666 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 52.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 965 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 558 NumberOfCodeBlocks, 558 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 547 ConstructedInterpolants, 0 QuantifiedInterpolants, 96513 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 44/44 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0521_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_10-17-57-558.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0521_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_10-17-57-558.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0521_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_10-17-57-558.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0521_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_10-17-57-558.csv Completed graceful shutdown