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_imprecise.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 01:04:46,995 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 01:04:46,998 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 01:04:47,012 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 01:04:47,013 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 01:04:47,014 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 01:04:47,015 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 01:04:47,017 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 01:04:47,019 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 01:04:47,020 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 01:04:47,020 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 01:04:47,020 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 01:04:47,021 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 01:04:47,022 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 01:04:47,023 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 01:04:47,026 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 01:04:47,028 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 01:04:47,030 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 01:04:47,031 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 01:04:47,033 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 01:04:47,035 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 01:04:47,035 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 01:04:47,035 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 01:04:47,036 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 01:04:47,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 01:04:47,039 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 01:04:47,039 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 01:04:47,039 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 01:04:47,040 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 01:04:47,040 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 01:04:47,040 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 01:04:47,041 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_imprecise.epf [2018-01-21 01:04:47,051 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 01:04:47,051 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 01:04:47,052 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 01:04:47,052 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 01:04:47,052 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 01:04:47,052 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 01:04:47,053 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 01:04:47,053 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 01:04:47,053 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 01:04:47,054 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 01:04:47,054 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 01:04:47,054 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 01:04:47,054 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 01:04:47,055 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 01:04:47,055 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 01:04:47,055 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 01:04:47,055 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 01:04:47,055 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 01:04:47,055 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 01:04:47,056 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 01:04:47,056 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 01:04:47,056 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 01:04:47,056 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 01:04:47,056 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 01:04:47,057 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 01:04:47,057 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 01:04:47,057 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 01:04:47,057 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 01:04:47,058 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 01:04:47,058 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 01:04:47,058 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 01:04:47,058 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 01:04:47,058 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 01:04:47,059 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 01:04:47,059 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 01:04:47,059 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 01:04:47,059 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 01:04:47,060 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 01:04:47,060 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 01:04:47,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 01:04:47,109 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 01:04:47,114 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 01:04:47,115 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 01:04:47,116 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 01:04:47,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:04:47,312 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 01:04:47,320 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 01:04:47,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 01:04:47,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 01:04:47,326 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 01:04:47,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:04:47" (1/1) ... [2018-01-21 01:04:47,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a663d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:47, skipping insertion in model container [2018-01-21 01:04:47,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:04:47" (1/1) ... [2018-01-21 01:04:47,350 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:04:47,393 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:04:47,506 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:04:47,524 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:04:47,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:47 WrapperNode [2018-01-21 01:04:47,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 01:04:47,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 01:04:47,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 01:04:47,535 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 01:04:47,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:47" (1/1) ... [2018-01-21 01:04:47,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:47" (1/1) ... [2018-01-21 01:04:47,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:47" (1/1) ... [2018-01-21 01:04:47,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:47" (1/1) ... [2018-01-21 01:04:47,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:47" (1/1) ... [2018-01-21 01:04:47,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:47" (1/1) ... [2018-01-21 01:04:47,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:47" (1/1) ... [2018-01-21 01:04:47,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 01:04:47,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 01:04:47,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 01:04:47,576 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 01:04:47,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:47" (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 01:04:47,626 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 01:04:47,626 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 01:04:47,626 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 01:04:47,627 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 01:04:47,627 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 01:04:47,627 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 01:04:47,627 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 01:04:47,627 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 01:04:47,627 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 01:04:47,628 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 01:04:47,628 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 01:04:47,628 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 01:04:47,628 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 01:04:47,628 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 01:04:47,628 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 01:04:47,629 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 01:04:47,629 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 01:04:47,949 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 01:04:47,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:04:47 BoogieIcfgContainer [2018-01-21 01:04:47,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 01:04:47,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 01:04:47,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 01:04:47,954 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 01:04:47,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 01:04:47" (1/3) ... [2018-01-21 01:04:47,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72981b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:04:47, skipping insertion in model container [2018-01-21 01:04:47,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:47" (2/3) ... [2018-01-21 01:04:47,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72981b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:04:47, skipping insertion in model container [2018-01-21 01:04:47,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:04:47" (3/3) ... [2018-01-21 01:04:47,957 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:04:47,964 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 01:04:47,970 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 01:04:48,030 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:04:48,030 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:04:48,030 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:04:48,031 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:04:48,031 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:04:48,031 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:04:48,031 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:04:48,031 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 01:04:48,031 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:04:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-21 01:04:48,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 01:04:48,055 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:48,056 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 01:04:48,057 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 01:04:48,060 INFO L82 PathProgramCache]: Analyzing trace with hash 202351, now seen corresponding path program 1 times [2018-01-21 01:04:48,062 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:48,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:48,108 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:48,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:48,109 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:04:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:04:48,157 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:04:48,163 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:04:48,168 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:04:48,168 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:04:48,168 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:04:48,168 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:04:48,168 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:04:48,169 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:04:48,169 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:04:48,169 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 01:04:48,169 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:04:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-21 01:04:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 01:04:48,173 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:48,174 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] [2018-01-21 01:04:48,174 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:04:48,174 INFO L82 PathProgramCache]: Analyzing trace with hash -579641887, now seen corresponding path program 1 times [2018-01-21 01:04:48,174 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:48,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:48,176 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:48,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:48,177 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:48,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:48,248 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 01:04:48,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:04:48,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:04:48,250 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:04:48,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:04:48,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:04:48,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:04:48,344 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 2 states. [2018-01-21 01:04:48,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:48,368 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2018-01-21 01:04:48,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:04:48,369 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-21 01:04:48,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:48,378 INFO L225 Difference]: With dead ends: 117 [2018-01-21 01:04:48,378 INFO L226 Difference]: Without dead ends: 70 [2018-01-21 01:04:48,381 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 01:04:48,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-21 01:04:48,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-21 01:04:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-21 01:04:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-01-21 01:04:48,412 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 20 [2018-01-21 01:04:48,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:48,413 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-01-21 01:04:48,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:04:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-01-21 01:04:48,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 01:04:48,414 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:48,414 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] [2018-01-21 01:04:48,414 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:04:48,414 INFO L82 PathProgramCache]: Analyzing trace with hash -675072438, now seen corresponding path program 1 times [2018-01-21 01:04:48,414 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:48,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:48,416 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:48,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:48,417 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:48,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:48,538 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 01:04:48,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:04:48,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:04:48,539 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:04:48,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:04:48,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:04:48,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:04:48,542 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 5 states. [2018-01-21 01:04:48,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:48,710 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2018-01-21 01:04:48,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:04:48,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-21 01:04:48,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:48,713 INFO L225 Difference]: With dead ends: 118 [2018-01-21 01:04:48,713 INFO L226 Difference]: Without dead ends: 99 [2018-01-21 01:04:48,714 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 01:04:48,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-21 01:04:48,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 74. [2018-01-21 01:04:48,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-21 01:04:48,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-01-21 01:04:48,725 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 29 [2018-01-21 01:04:48,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:48,725 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-01-21 01:04:48,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:04:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-01-21 01:04:48,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-21 01:04:48,727 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:48,727 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] [2018-01-21 01:04:48,728 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:04:48,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1367476593, now seen corresponding path program 1 times [2018-01-21 01:04:48,728 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:48,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:48,730 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:48,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:48,730 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:04:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:04:48,817 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:04:48,826 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:04:48,833 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:04:48,834 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:04:48,848 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:04:48,849 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:04:48,849 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:04:48,849 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:04:48,849 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:04:48,849 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:04:48,849 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:04:48,849 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 01:04:48,849 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:04:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-21 01:04:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 01:04:48,853 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:48,853 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:04:48,853 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 01:04:48,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1698925306, now seen corresponding path program 1 times [2018-01-21 01:04:48,853 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:48,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:48,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:48,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:48,855 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:48,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:48,881 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 01:04:48,881 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:04:48,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:04:48,882 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:04:48,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:04:48,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:04:48,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:04:48,882 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 2 states. [2018-01-21 01:04:48,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:48,889 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2018-01-21 01:04:48,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:04:48,889 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-21 01:04:48,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:48,890 INFO L225 Difference]: With dead ends: 117 [2018-01-21 01:04:48,890 INFO L226 Difference]: Without dead ends: 68 [2018-01-21 01:04:48,891 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 01:04:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-21 01:04:48,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-21 01:04:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-21 01:04:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-01-21 01:04:48,898 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 18 [2018-01-21 01:04:48,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:48,898 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-01-21 01:04:48,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:04:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-01-21 01:04:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 01:04:48,900 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:48,900 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] [2018-01-21 01:04:48,900 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 01:04:48,900 INFO L82 PathProgramCache]: Analyzing trace with hash -456567889, now seen corresponding path program 1 times [2018-01-21 01:04:48,900 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:48,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:48,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:48,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:48,902 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:48,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:48,964 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 01:04:48,965 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:04:48,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:04:48,965 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:04:48,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:04:48,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:04:48,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:04:48,966 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 5 states. [2018-01-21 01:04:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:49,182 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2018-01-21 01:04:49,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:04:49,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-21 01:04:49,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:49,184 INFO L225 Difference]: With dead ends: 114 [2018-01-21 01:04:49,184 INFO L226 Difference]: Without dead ends: 97 [2018-01-21 01:04:49,184 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 01:04:49,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-21 01:04:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 72. [2018-01-21 01:04:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-21 01:04:49,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-01-21 01:04:49,195 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 27 [2018-01-21 01:04:49,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:49,195 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-01-21 01:04:49,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:04:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-01-21 01:04:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-21 01:04:49,197 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:49,197 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] [2018-01-21 01:04:49,197 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 01:04:49,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1118740172, now seen corresponding path program 1 times [2018-01-21 01:04:49,197 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:49,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:49,198 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:49,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:49,199 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:49,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:04:49,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:04:49,381 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:04:49,382 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-21 01:04:49,384 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [8], [10], [13], [39], [43], [48], [52], [60], [61], [66], [70], [78], [82], [84], [85], [128], [130], [131], [137], [141], [143], [144], [155], [156], [157], [158], [159], [164], [166], [167], [168], [174], [175], [176] [2018-01-21 01:04:49,432 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:04:49,433 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:04:49,932 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:04:49,933 INFO L268 AbstractInterpreter]: Visited 39 different actions 85 times. Merged at 18 different actions 41 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 31 variables. [2018-01-21 01:04:49,949 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:04:49,949 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:04:49,949 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 01:04:49,964 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:49,964 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:04:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:50,012 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:04:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:04:50,141 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:04:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:04:50,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:04:50,366 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 01:04:50,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:50,376 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:04:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:50,420 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:04:50,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:04:50,642 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:04:50,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:04:50,695 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 01:04:50,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6, 7, 5] total 18 [2018-01-21 01:04:50,696 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 01:04:50,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-21 01:04:50,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-21 01:04:50,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=266, Unknown=9, NotChecked=0, Total=342 [2018-01-21 01:04:50,697 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 9 states. [2018-01-21 01:04:50,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:50,926 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2018-01-21 01:04:50,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 01:04:50,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-01-21 01:04:50,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:50,927 INFO L225 Difference]: With dead ends: 128 [2018-01-21 01:04:50,927 INFO L226 Difference]: Without dead ends: 125 [2018-01-21 01:04:50,928 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 149 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=395, Unknown=9, NotChecked=0, Total=506 [2018-01-21 01:04:50,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-21 01:04:50,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2018-01-21 01:04:50,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-21 01:04:50,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-01-21 01:04:50,936 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 41 [2018-01-21 01:04:50,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:50,937 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-01-21 01:04:50,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-21 01:04:50,937 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-01-21 01:04:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-21 01:04:50,939 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:50,939 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] [2018-01-21 01:04:50,939 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 01:04:50,940 INFO L82 PathProgramCache]: Analyzing trace with hash -152877011, now seen corresponding path program 1 times [2018-01-21 01:04:50,940 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:50,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:50,941 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:50,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:50,941 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:50,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:04:51,095 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:04:51,095 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:04:51,095 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-01-21 01:04:51,096 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [8], [10], [13], [39], [43], [48], [52], [60], [61], [66], [70], [78], [82], [84], [85], [128], [130], [131], [137], [141], [143], [144], [147], [148], [149], [150], [151], [152], [153], [164], [166], [167], [168], [174], [175], [176] [2018-01-21 01:04:51,098 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:04:51,098 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:04:51,488 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:04:51,488 INFO L268 AbstractInterpreter]: Visited 41 different actions 83 times. Merged at 20 different actions 38 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 33 variables. [2018-01-21 01:04:51,493 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:04:51,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:04:51,494 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 01:04:51,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:51,503 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:04:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:51,527 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:04:51,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-21 01:04:51,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-21 01:04:51,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:51,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:51,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:51,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-21 01:04:51,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-21 01:04:51,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-21 01:04:51,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:51,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:51,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:51,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-21 01:04:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:04:51,587 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:04:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:04:51,630 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-21 01:04:51,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 9 [2018-01-21 01:04:51,630 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:04:51,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 01:04:51,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 01:04:51,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-21 01:04:51,631 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 4 states. [2018-01-21 01:04:51,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:51,673 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2018-01-21 01:04:51,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 01:04:51,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-01-21 01:04:51,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:51,674 INFO L225 Difference]: With dead ends: 127 [2018-01-21 01:04:51,675 INFO L226 Difference]: Without dead ends: 110 [2018-01-21 01:04:51,675 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-21 01:04:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-21 01:04:51,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-01-21 01:04:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-21 01:04:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-01-21 01:04:51,685 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 43 [2018-01-21 01:04:51,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:51,686 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-01-21 01:04:51,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 01:04:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-01-21 01:04:51,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-21 01:04:51,688 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:51,688 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:04:51,688 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-21 01:04:51,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1919622631, now seen corresponding path program 2 times [2018-01-21 01:04:51,689 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:51,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:51,690 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:51,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:51,691 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:51,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:51,745 ERROR L119 erpolLogProxyWrapper]: Interpolant 25 not inductive: (Check returned sat) [2018-01-21 01:04:51,755 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1003) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-21 01:04:51,758 INFO L168 Benchmark]: Toolchain (without parser) took 4444.83 ms. Allocated memory was 301.5 MB in the beginning and 515.9 MB in the end (delta: 214.4 MB). Free memory was 260.2 MB in the beginning and 391.1 MB in the end (delta: -130.9 MB). Peak memory consumption was 83.5 MB. Max. memory is 5.3 GB. [2018-01-21 01:04:51,759 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 301.5 MB. Free memory is still 266.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 01:04:51,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.41 ms. Allocated memory is still 301.5 MB. Free memory was 260.2 MB in the beginning and 248.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:04:51,759 INFO L168 Benchmark]: Boogie Preprocessor took 40.38 ms. Allocated memory is still 301.5 MB. Free memory was 248.3 MB in the beginning and 246.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:04:51,759 INFO L168 Benchmark]: RCFGBuilder took 374.96 ms. Allocated memory is still 301.5 MB. Free memory was 246.3 MB in the beginning and 221.3 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 5.3 GB. [2018-01-21 01:04:51,760 INFO L168 Benchmark]: TraceAbstraction took 3805.75 ms. Allocated memory was 301.5 MB in the beginning and 515.9 MB in the end (delta: 214.4 MB). Free memory was 221.3 MB in the beginning and 391.1 MB in the end (delta: -169.8 MB). Peak memory consumption was 44.6 MB. Max. memory is 5.3 GB. [2018-01-21 01:04:51,761 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.22 ms. Allocated memory is still 301.5 MB. Free memory is still 266.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 213.41 ms. Allocated memory is still 301.5 MB. Free memory was 260.2 MB in the beginning and 248.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.38 ms. Allocated memory is still 301.5 MB. Free memory was 248.3 MB in the beginning and 246.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 374.96 ms. Allocated memory is still 301.5 MB. Free memory was 246.3 MB in the beginning and 221.3 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3805.75 ms. Allocated memory was 301.5 MB in the beginning and 515.9 MB in the end (delta: 214.4 MB). Free memory was 221.3 MB in the beginning and 391.1 MB in the end (delta: -169.8 MB). Peak memory consumption was 44.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 37 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 359 LocStat_NO_SUPPORTING_DISEQUALITIES : 113 LocStat_NO_DISJUNCTIONS : -74 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 43 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 67 TransStat_NO_SUPPORTING_DISEQUALITIES : 15 TransStat_NO_DISJUNCTIONS : 49 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.366420 RENAME_VARIABLES(MILLISECONDS) : 0.418857 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.334427 PROJECTAWAY(MILLISECONDS) : 1.338031 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001543 DISJOIN(MILLISECONDS) : 1.021922 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.447198 ADD_EQUALITY(MILLISECONDS) : 0.041140 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012776 #CONJOIN_DISJUNCTIVE : 136 #RENAME_VARIABLES : 267 #UNFREEZE : 0 #CONJOIN : 215 #PROJECTAWAY : 170 #ADD_WEAK_EQUALITY : 16 #DISJOIN : 20 #RENAME_VARIABLES_DISJUNCTIVE : 239 #ADD_EQUALITY : 68 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 11 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 39 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 382 LocStat_NO_SUPPORTING_DISEQUALITIES : 113 LocStat_NO_DISJUNCTIONS : -78 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 45 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 84 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 54 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.752339 RENAME_VARIABLES(MILLISECONDS) : 0.659917 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.699501 PROJECTAWAY(MILLISECONDS) : 1.481282 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001722 DISJOIN(MILLISECONDS) : 1.041004 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.696548 ADD_EQUALITY(MILLISECONDS) : 0.036661 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017125 #CONJOIN_DISJUNCTIVE : 133 #RENAME_VARIABLES : 257 #UNFREEZE : 0 #CONJOIN : 235 #PROJECTAWAY : 176 #ADD_WEAK_EQUALITY : 17 #DISJOIN : 19 #RENAME_VARIABLES_DISJUNCTIVE : 229 #ADD_EQUALITY : 77 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 11 * 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 Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * 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, 73 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=73occurred 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: [L995] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={10:0}] [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L996] FCALL list->next = ((void*)0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L997] FCALL list->colour = BLACK VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L999] SLL* end = list; VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1027] COND FALSE !(0) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1028] EXPR, FCALL end->colour VAL [end={10:0}, end->colour=1, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1028] COND FALSE !(0) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1030] COND TRUE ((void*)0) != end VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1032] EXPR, FCALL end->colour VAL [end={10:0}, end->colour=1, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1032] COND FALSE !(RED == end->colour) [L1039] EXPR, FCALL end->next VAL [end={10:0}, end->next={0:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1039] end = end->next [L1030] COND FALSE !(((void*)0) != end) VAL [end={0:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1043] COND TRUE ((void*)0) != list VAL [end={0:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1045] EXPR, FCALL list->colour VAL [end={0:0}, list={10:0}, list->colour=1, malloc(sizeof(SLL))={10:0}] [L1045] COND FALSE !(RED == list->colour) [L1054] EXPR, FCALL list->next VAL [end={0:0}, list={10:0}, list->next={0:0}, malloc(sizeof(SLL))={10:0}] [L1054] end = list->next [L1055] FCALL free(list) VAL [end={0:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1056] list = end VAL [end={0:0}, list={0:0}, malloc(sizeof(SLL))={10:0}] [L1043] COND FALSE !(((void*)0) != list) VAL [end={0:0}, list={0:0}, malloc(sizeof(SLL))={10:0}] [L1060] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 73 locations, 3 error locations. UNSAFE Result, 0.6s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 134 SDtfs, 179 SDslu, 56 SDs, 0 SdLazy, 62 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=2, 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, 2 MinimizatonAttempts, 25 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 2573 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1003) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_01-04-51-770.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_01-04-51-770.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_01-04-51-770.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-21_01-04-51-770.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-21_01-04-51-770.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_01-04-51-770.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_01-04-51-770.csv Received shutdown request...