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/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test4_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:27:57,003 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:27:57,005 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:27:57,020 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:27:57,020 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:27:57,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:27:57,022 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:27:57,024 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:27:57,026 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:27:57,027 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:27:57,028 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:27:57,028 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:27:57,029 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:27:57,030 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:27:57,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:27:57,033 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:27:57,035 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:27:57,038 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:27:57,039 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:27:57,040 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:27:57,042 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:27:57,043 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:27:57,043 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:27:57,044 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:27:57,045 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:27:57,046 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:27:57,046 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:27:57,047 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:27:57,047 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:27:57,048 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:27:57,048 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:27:57,048 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 17:27:57,057 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:27:57,057 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:27:57,058 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:27:57,058 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:27:57,058 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:27:57,058 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:27:57,058 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:27:57,058 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:27:57,059 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:27:57,059 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:27:57,059 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:27:57,059 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:27:57,059 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:27:57,059 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:27:57,060 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:27:57,060 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:27:57,060 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:27:57,060 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:27:57,060 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:27:57,060 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:27:57,060 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:27:57,060 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:27:57,061 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:27:57,061 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:27:57,061 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:27:57,061 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:27:57,061 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:27:57,062 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:27:57,062 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:27:57,062 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:27:57,062 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:27:57,062 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:27:57,062 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:27:57,062 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:27:57,063 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:27:57,063 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:27:57,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:27:57,108 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:27:57,111 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:27:57,112 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:27:57,112 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:27:57,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test4_true-valid-memsafety_true-termination.i [2018-01-24 17:27:57,295 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:27:57,299 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:27:57,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:27:57,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:27:57,305 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:27:57,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:27:57" (1/1) ... [2018-01-24 17:27:57,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388a8c3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:57, skipping insertion in model container [2018-01-24 17:27:57,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:27:57" (1/1) ... [2018-01-24 17:27:57,323 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:27:57,370 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:27:57,482 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:27:57,497 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:27:57,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:57 WrapperNode [2018-01-24 17:27:57,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:27:57,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:27:57,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:27:57,506 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:27:57,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:57" (1/1) ... [2018-01-24 17:27:57,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:57" (1/1) ... [2018-01-24 17:27:57,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:57" (1/1) ... [2018-01-24 17:27:57,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:57" (1/1) ... [2018-01-24 17:27:57,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:57" (1/1) ... [2018-01-24 17:27:57,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:57" (1/1) ... [2018-01-24 17:27:57,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:57" (1/1) ... [2018-01-24 17:27:57,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:27:57,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:27:57,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:27:57,538 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:27:57,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:57" (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-24 17:27:57,585 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:27:57,585 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:27:57,585 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 17:27:57,585 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 17:27:57,585 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:27:57,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:27:57,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:27:57,586 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:27:57,586 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:27:57,586 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:27:57,586 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:27:57,586 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 17:27:57,586 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 17:27:57,586 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:27:57,586 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:27:57,586 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:27:57,724 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:27:57,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:27:57 BoogieIcfgContainer [2018-01-24 17:27:57,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:27:57,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:27:57,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:27:57,727 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:27:57,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:27:57" (1/3) ... [2018-01-24 17:27:57,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585ce66f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:27:57, skipping insertion in model container [2018-01-24 17:27:57,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:57" (2/3) ... [2018-01-24 17:27:57,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585ce66f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:27:57, skipping insertion in model container [2018-01-24 17:27:57,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:27:57" (3/3) ... [2018-01-24 17:27:57,732 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test4_true-valid-memsafety_true-termination.i [2018-01-24 17:27:57,739 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:27:57,746 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-24 17:27:57,786 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:27:57,786 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:27:57,786 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:27:57,787 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:27:57,787 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:27:57,787 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:27:57,787 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:27:57,787 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:27:57,788 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:27:57,810 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-24 17:27:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 17:27:57,816 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:57,818 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:27:57,818 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:27:57,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1042309263, now seen corresponding path program 1 times [2018-01-24 17:27:57,825 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:57,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:57,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:57,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:57,880 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:57,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:58,003 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-24 17:27:58,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:58,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:27:58,005 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:58,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:27:58,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:27:58,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:27:58,022 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-01-24 17:27:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:58,202 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-01-24 17:27:58,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:27:58,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-24 17:27:58,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:58,213 INFO L225 Difference]: With dead ends: 43 [2018-01-24 17:27:58,213 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 17:27:58,216 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-24 17:27:58,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 17:27:58,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-01-24 17:27:58,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-24 17:27:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-24 17:27:58,249 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 16 [2018-01-24 17:27:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:58,249 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-24 17:27:58,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:27:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-24 17:27:58,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 17:27:58,251 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:58,251 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-24 17:27:58,251 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:27:58,252 INFO L82 PathProgramCache]: Analyzing trace with hash -96589069, now seen corresponding path program 1 times [2018-01-24 17:27:58,252 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:58,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:58,254 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:58,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:58,254 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:58,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:58,366 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-24 17:27:58,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:58,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:27:58,367 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:58,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:27:58,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:27:58,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:27:58,370 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states. [2018-01-24 17:27:58,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:58,429 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-01-24 17:27:58,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:27:58,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-24 17:27:58,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:58,431 INFO L225 Difference]: With dead ends: 44 [2018-01-24 17:27:58,431 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 17:27:58,432 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:27:58,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 17:27:58,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2018-01-24 17:27:58,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-24 17:27:58,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-01-24 17:27:58,439 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2018-01-24 17:27:58,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:58,439 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-01-24 17:27:58,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:27:58,440 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-01-24 17:27:58,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 17:27:58,440 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:58,441 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:27:58,441 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:27:58,441 INFO L82 PathProgramCache]: Analyzing trace with hash 220833638, now seen corresponding path program 1 times [2018-01-24 17:27:58,441 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:58,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:58,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:58,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:58,444 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:58,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:58,505 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-24 17:27:58,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:58,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:27:58,506 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:58,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:27:58,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:27:58,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:27:58,506 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2018-01-24 17:27:58,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:58,523 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-01-24 17:27:58,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:27:58,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 17:27:58,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:58,524 INFO L225 Difference]: With dead ends: 33 [2018-01-24 17:27:58,525 INFO L226 Difference]: Without dead ends: 32 [2018-01-24 17:27:58,525 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:27:58,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-24 17:27:58,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-01-24 17:27:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-24 17:27:58,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-24 17:27:58,531 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 20 [2018-01-24 17:27:58,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:58,532 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-24 17:27:58,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:27:58,532 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-24 17:27:58,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 17:27:58,533 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:58,534 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:27:58,534 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:27:58,534 INFO L82 PathProgramCache]: Analyzing trace with hash 220833639, now seen corresponding path program 1 times [2018-01-24 17:27:58,534 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:58,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:58,536 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:58,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:58,536 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:58,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:58,610 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-24 17:27:58,610 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:58,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:27:58,611 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:58,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:27:58,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:27:58,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:27:58,611 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2018-01-24 17:27:58,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:58,624 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 17:27:58,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:27:58,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 17:27:58,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:58,625 INFO L225 Difference]: With dead ends: 37 [2018-01-24 17:27:58,625 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 17:27:58,626 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:27:58,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 17:27:58,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-01-24 17:27:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-24 17:27:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-01-24 17:27:58,630 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-01-24 17:27:58,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:58,630 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-01-24 17:27:58,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:27:58,630 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-01-24 17:27:58,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 17:27:58,631 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:58,631 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:27:58,631 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:27:58,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1744091818, now seen corresponding path program 1 times [2018-01-24 17:27:58,631 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:58,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:58,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:58,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:58,633 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:58,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:58,707 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-24 17:27:58,708 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:58,708 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:27:58,709 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-01-24 17:27:58,710 INFO L201 CegarAbsIntRunner]: [0], [6], [7], [8], [9], [17], [20], [22], [23], [27], [33], [34], [35], [37], [39], [40], [41], [42] [2018-01-24 17:27:58,759 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:27:58,759 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:27:58,864 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 17:27:58,865 INFO L268 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-01-24 17:27:58,874 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 17:27:58,942 INFO L232 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 66.53% of their original sizes. [2018-01-24 17:27:58,942 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 17:27:58,965 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 17:27:58,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:27:58,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-01-24 17:27:58,966 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:58,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:27:58,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:27:58,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:27:58,967 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 7 states. [2018-01-24 17:27:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:59,417 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-01-24 17:27:59,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:27:59,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-24 17:27:59,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:59,418 INFO L225 Difference]: With dead ends: 55 [2018-01-24 17:27:59,418 INFO L226 Difference]: Without dead ends: 31 [2018-01-24 17:27:59,419 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:27:59,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-24 17:27:59,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-24 17:27:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-24 17:27:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-01-24 17:27:59,425 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2018-01-24 17:27:59,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:59,425 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-01-24 17:27:59,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:27:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-01-24 17:27:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:27:59,432 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:59,432 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] [2018-01-24 17:27:59,432 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:27:59,433 INFO L82 PathProgramCache]: Analyzing trace with hash -102655212, now seen corresponding path program 1 times [2018-01-24 17:27:59,433 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:59,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:59,434 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:59,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:59,434 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:59,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:59,495 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-24 17:27:59,496 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:59,496 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:27:59,496 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 17:27:59,496 INFO L201 CegarAbsIntRunner]: [0], [3], [4], [5], [6], [7], [8], [9], [17], [20], [22], [23], [27], [33], [34], [35], [37], [39], [40], [41], [42] [2018-01-24 17:27:59,497 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:27:59,498 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:27:59,579 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 17:27:59,580 INFO L268 AbstractInterpreter]: Visited 21 different actions 36 times. Merged at 7 different actions 9 times. Never widened. Never found a fixpoint. Largest state had 16 variables. [2018-01-24 17:27:59,582 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 17:27:59,650 INFO L232 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 71.45% of their original sizes. [2018-01-24 17:27:59,650 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 17:27:59,839 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 17:27:59,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:27:59,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [5] total 17 [2018-01-24 17:27:59,840 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:59,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 17:27:59,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 17:27:59,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-01-24 17:27:59,841 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 14 states. [2018-01-24 17:28:01,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:28:01,011 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-01-24 17:28:01,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 17:28:01,011 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-01-24 17:28:01,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:28:01,012 INFO L225 Difference]: With dead ends: 31 [2018-01-24 17:28:01,013 INFO L226 Difference]: Without dead ends: 28 [2018-01-24 17:28:01,013 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-01-24 17:28:01,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-01-24 17:28:01,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-01-24 17:28:01,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-24 17:28:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-24 17:28:01,018 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 23 [2018-01-24 17:28:01,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:28:01,018 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-24 17:28:01,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 17:28:01,019 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-24 17:28:01,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:28:01,019 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:28:01,019 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] [2018-01-24 17:28:01,019 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:28:01,020 INFO L82 PathProgramCache]: Analyzing trace with hash -102655211, now seen corresponding path program 1 times [2018-01-24 17:28:01,020 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:28:01,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:28:01,021 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:28:01,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:28:01,021 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:28:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:28:01,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:28:01,155 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-24 17:28:01,156 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:28:01,156 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:28:01,156 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 17:28:01,157 INFO L201 CegarAbsIntRunner]: [0], [3], [4], [5], [6], [7], [8], [9], [17], [20], [22], [23], [28], [33], [34], [35], [37], [39], [40], [41], [42] [2018-01-24 17:28:01,158 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:28:01,158 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:28:01,232 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:28:01,232 INFO L268 AbstractInterpreter]: Visited 21 different actions 36 times. Merged at 7 different actions 9 times. Never widened. Never found a fixpoint. Largest state had 16 variables. [2018-01-24 17:28:01,237 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:28:01,237 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:28:01,237 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-24 17:28:01,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:28:01,250 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:28:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:28:01,288 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:28:01,313 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 6 treesize of output 5 [2018-01-24 17:28:01,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:28:01,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:28:01,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:28:01,360 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-24 17:28:01,360 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:28:01,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-01-24 17:28:01,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:28:01,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:28:01,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2018-01-24 17:28:01,524 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-24 17:28:01,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:28:01,559 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-24 17:28:01,566 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:28:01,566 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:28:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:28:01,596 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:28:01,599 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 6 treesize of output 5 [2018-01-24 17:28:01,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:28:01,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:28:01,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:28:01,636 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-24 17:28:01,637 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:28:01,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-01-24 17:28:01,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:28:01,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:28:01,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2018-01-24 17:28:01,730 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-24 17:28:01,733 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:28:01,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 11 [2018-01-24 17:28:01,733 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:28:01,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:28:01,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:28:01,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=103, Unknown=1, NotChecked=0, Total=132 [2018-01-24 17:28:01,734 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 10 states. [2018-01-24 17:28:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:28:01,856 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-01-24 17:28:01,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:28:01,856 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-01-24 17:28:01,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:28:01,857 INFO L225 Difference]: With dead ends: 30 [2018-01-24 17:28:01,857 INFO L226 Difference]: Without dead ends: 29 [2018-01-24 17:28:01,857 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 81 SyntacticMatches, 9 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2018-01-24 17:28:01,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-24 17:28:01,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-01-24 17:28:01,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-24 17:28:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-01-24 17:28:01,862 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 23 [2018-01-24 17:28:01,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:28:01,863 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-01-24 17:28:01,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:28:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-01-24 17:28:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 17:28:01,864 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:28:01,864 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] [2018-01-24 17:28:01,864 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:28:01,864 INFO L82 PathProgramCache]: Analyzing trace with hash -240987817, now seen corresponding path program 1 times [2018-01-24 17:28:01,864 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:28:01,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:28:01,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:28:01,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:28:01,866 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:28:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:28:01,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:28:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:28:02,033 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:28:02,033 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:28:02,033 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-24 17:28:02,033 INFO L201 CegarAbsIntRunner]: [0], [3], [4], [5], [7], [8], [9], [17], [20], [22], [23], [28], [33], [34], [35], [37], [39], [40], [41], [42] [2018-01-24 17:28:02,034 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:28:02,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:28:02,084 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:28:02,084 INFO L268 AbstractInterpreter]: Visited 20 different actions 25 times. Never merged. Never widened. Never found a fixpoint. Largest state had 16 variables. [2018-01-24 17:28:02,091 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:28:02,092 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:28:02,092 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-24 17:28:02,103 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:28:02,103 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:28:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:28:02,126 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:28:02,138 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 6 treesize of output 5 [2018-01-24 17:28:02,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:28:02,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:28:02,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:28:02,206 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:28:02,208 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:28:02,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 17:28:02,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:28:02,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:28:02,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:19 [2018-01-24 17:28:02,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:28:02,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-01-24 17:28:02,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:28:02,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:28:02,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2018-01-24 17:28:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:28:02,307 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:28:02,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-01-24 17:28:02,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:28:02,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:28:02,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-01-24 17:28:02,440 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-01-24 17:28:14,647 WARN L146 SmtUtils]: Spent 12108ms on a formula simplification. DAG size of input: 72 DAG size of output 69 [2018-01-24 17:28:14,659 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-01-24 17:28:14,676 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-01-24 17:28:20,806 WARN L143 SmtUtils]: Spent 6057ms on a formula simplification that was a NOOP. DAG size: 69 [2018-01-24 17:28:20,814 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2018-01-24 17:28:20,886 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2018-01-24 17:28:20,894 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2018-01-24 17:28:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:28:21,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-24 17:28:21,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10, 11] total 22 [2018-01-24 17:28:21,030 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:28:21,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 17:28:21,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 17:28:21,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=429, Unknown=1, NotChecked=0, Total=506 [2018-01-24 17:28:21,031 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 12 states. [2018-01-24 17:28:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:28:21,137 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-01-24 17:28:21,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:28:21,137 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-01-24 17:28:21,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:28:21,138 INFO L225 Difference]: With dead ends: 29 [2018-01-24 17:28:21,138 INFO L226 Difference]: Without dead ends: 28 [2018-01-24 17:28:21,139 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=89, Invalid=462, Unknown=1, NotChecked=0, Total=552 [2018-01-24 17:28:21,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-01-24 17:28:21,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-01-24 17:28:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-24 17:28:21,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-01-24 17:28:21,143 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 25 [2018-01-24 17:28:21,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:28:21,144 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-01-24 17:28:21,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 17:28:21,144 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-01-24 17:28:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 17:28:21,145 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:28:21,145 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] [2018-01-24 17:28:21,145 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:28:21,145 INFO L82 PathProgramCache]: Analyzing trace with hash -184703786, now seen corresponding path program 1 times [2018-01-24 17:28:21,146 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:28:21,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:28:21,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:28:21,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:28:21,148 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:28:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:28:21,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:28:21,360 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-24 17:28:21,361 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:28:21,361 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:28:21,361 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 17:28:21,361 INFO L201 CegarAbsIntRunner]: [0], [3], [4], [5], [6], [7], [8], [9], [15], [17], [20], [22], [23], [26], [32], [33], [34], [35], [37], [38], [39], [40], [41], [42] [2018-01-24 17:28:21,362 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:28:21,363 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:28:21,441 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:28:21,442 INFO L268 AbstractInterpreter]: Visited 24 different actions 41 times. Merged at 9 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 16 variables. [2018-01-24 17:28:21,444 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:28:21,444 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:28:21,444 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:28:21,455 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:28:21,456 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:28:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:28:21,476 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:28:21,756 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-24 17:28:21,757 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:28:21,926 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_old(#valid)_BEFORE_CALL_14| term size 19 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:328) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) 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:149) 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-24 17:28:21,930 INFO L168 Benchmark]: Toolchain (without parser) took 24633.79 ms. Allocated memory was 309.3 MB in the beginning and 551.6 MB in the end (delta: 242.2 MB). Free memory was 268.2 MB in the beginning and 518.2 MB in the end (delta: -249.9 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:28:21,931 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 309.3 MB. Free memory is still 275.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:28:21,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.99 ms. Allocated memory is still 309.3 MB. Free memory was 268.2 MB in the beginning and 256.1 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-24 17:28:21,931 INFO L168 Benchmark]: Boogie Preprocessor took 31.79 ms. Allocated memory is still 309.3 MB. Free memory was 256.1 MB in the beginning and 254.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:28:21,932 INFO L168 Benchmark]: RCFGBuilder took 187.16 ms. Allocated memory is still 309.3 MB. Free memory was 254.1 MB in the beginning and 240.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:28:21,932 INFO L168 Benchmark]: TraceAbstraction took 24203.62 ms. Allocated memory was 309.3 MB in the beginning and 551.6 MB in the end (delta: 242.2 MB). Free memory was 240.1 MB in the beginning and 518.2 MB in the end (delta: -278.0 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:28:21,934 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 309.3 MB. Free memory is still 275.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 204.99 ms. Allocated memory is still 309.3 MB. Free memory was 268.2 MB in the beginning and 256.1 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.79 ms. Allocated memory is still 309.3 MB. Free memory was 256.1 MB in the beginning and 254.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 187.16 ms. Allocated memory is still 309.3 MB. Free memory was 254.1 MB in the beginning and 240.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 24203.62 ms. Allocated memory was 309.3 MB in the beginning and 551.6 MB in the end (delta: 242.2 MB). Free memory was 240.1 MB in the beginning and 518.2 MB in the end (delta: -278.0 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 12 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 57 LocStat_NO_SUPPORTING_DISEQUALITIES : 0 LocStat_NO_DISJUNCTIONS : -24 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 21 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 24 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 22 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.762225 RENAME_VARIABLES(MILLISECONDS) : 0.212284 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.275742 PROJECTAWAY(MILLISECONDS) : 0.037286 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.015517 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.265627 ADD_EQUALITY(MILLISECONDS) : 0.048676 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.018732 #CONJOIN_DISJUNCTIVE : 20 #RENAME_VARIABLES : 41 #UNFREEZE : 0 #CONJOIN : 42 #PROJECTAWAY : 42 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 40 #ADD_EQUALITY : 24 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 18 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 79 LocStat_NO_SUPPORTING_DISEQUALITIES : 11 LocStat_NO_DISJUNCTIONS : -36 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 55 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.158898 RENAME_VARIABLES(MILLISECONDS) : 0.080754 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.118914 PROJECTAWAY(MILLISECONDS) : 0.115167 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001869 DISJOIN(MILLISECONDS) : 0.382114 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.103846 ADD_EQUALITY(MILLISECONDS) : 0.020835 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.020234 #CONJOIN_DISJUNCTIVE : 63 #RENAME_VARIABLES : 133 #UNFREEZE : 0 #CONJOIN : 144 #PROJECTAWAY : 106 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 121 #ADD_EQUALITY : 47 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 84 LocStat_NO_SUPPORTING_DISEQUALITIES : 15 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 55 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.085354 RENAME_VARIABLES(MILLISECONDS) : 0.029705 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.069435 PROJECTAWAY(MILLISECONDS) : 0.027922 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001719 DISJOIN(MILLISECONDS) : 0.247265 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.041259 ADD_EQUALITY(MILLISECONDS) : 0.018964 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008866 #CONJOIN_DISJUNCTIVE : 64 #RENAME_VARIABLES : 133 #UNFREEZE : 0 #CONJOIN : 145 #PROJECTAWAY : 107 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 121 #ADD_EQUALITY : 47 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 99 LocStat_NO_SUPPORTING_DISEQUALITIES : 22 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 52 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 32 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.258711 RENAME_VARIABLES(MILLISECONDS) : 0.088920 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.232083 PROJECTAWAY(MILLISECONDS) : 0.044260 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002000 DISJOIN(MILLISECONDS) : 0.327677 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.110672 ADD_EQUALITY(MILLISECONDS) : 0.023214 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017078 #CONJOIN_DISJUNCTIVE : 43 #RENAME_VARIABLES : 73 #UNFREEZE : 0 #CONJOIN : 99 #PROJECTAWAY : 70 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 69 #ADD_EQUALITY : 44 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 93 LocStat_NO_SUPPORTING_DISEQUALITIES : 16 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 69 TransStat_NO_SUPPORTING_DISEQUALITIES : 10 TransStat_NO_DISJUNCTIONS : 39 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.244215 RENAME_VARIABLES(MILLISECONDS) : 0.005818 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.092646 PROJECTAWAY(MILLISECONDS) : 0.369258 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001806 DISJOIN(MILLISECONDS) : 0.291851 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.019448 ADD_EQUALITY(MILLISECONDS) : 0.014133 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017013 #CONJOIN_DISJUNCTIVE : 71 #RENAME_VARIABLES : 165 #UNFREEZE : 0 #CONJOIN : 196 #PROJECTAWAY : 134 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 17 #RENAME_VARIABLES_DISJUNCTIVE : 144 #ADD_EQUALITY : 53 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_old(#valid)_BEFORE_CALL_14| term size 19 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_old(#valid)_BEFORE_CALL_14| term size 19: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) 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/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-28-21-951.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-28-21-951.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-28-21-951.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_17-28-21-951.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_17-28-21-951.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_17-28-21-951.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_17-28-21-951.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_17-28-21-951.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_17-28-21-951.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-24_17-28-21-951.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-24_17-28-21-951.csv Received shutdown request...