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_test18_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:25:56,533 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:25:56,535 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:25:56,550 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:25:56,550 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:25:56,551 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:25:56,553 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:25:56,554 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:25:56,556 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:25:56,557 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:25:56,558 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:25:56,558 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:25:56,559 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:25:56,560 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:25:56,561 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:25:56,564 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:25:56,566 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:25:56,568 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:25:56,569 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:25:56,570 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:25:56,573 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:25:56,573 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:25:56,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:25:56,574 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:25:56,575 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:25:56,576 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:25:56,577 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:25:56,577 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:25:56,577 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:25:56,578 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:25:56,578 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:25:56,579 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:25:56,587 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:25:56,587 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:25:56,588 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:25:56,588 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:25:56,588 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:25:56,588 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:25:56,589 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:25:56,589 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:25:56,589 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:25:56,589 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:25:56,589 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:25:56,589 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:25:56,590 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:25:56,590 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:25:56,590 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:25:56,590 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:25:56,590 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:25:56,590 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:25:56,590 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:25:56,590 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:25:56,591 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:25:56,591 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:25:56,591 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:25:56,591 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:25:56,591 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:25:56,592 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:25:56,592 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:25:56,592 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:25:56,592 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:25:56,592 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:25:56,592 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:25:56,592 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:25:56,592 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:25:56,593 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:25:56,593 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:25:56,593 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:25:56,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:25:56,635 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:25:56,639 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:25:56,640 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:25:56,640 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:25:56,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2018-01-24 17:25:56,820 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:25:56,824 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:25:56,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:25:56,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:25:56,830 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:25:56,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:25:56" (1/1) ... [2018-01-24 17:25:56,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b331d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:25:56, skipping insertion in model container [2018-01-24 17:25:56,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:25:56" (1/1) ... [2018-01-24 17:25:56,848 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:25:56,895 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:25:57,013 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:25:57,032 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:25:57,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:25:57 WrapperNode [2018-01-24 17:25:57,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:25:57,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:25:57,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:25:57,042 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:25:57,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:25:57" (1/1) ... [2018-01-24 17:25:57,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:25:57" (1/1) ... [2018-01-24 17:25:57,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:25:57" (1/1) ... [2018-01-24 17:25:57,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:25:57" (1/1) ... [2018-01-24 17:25:57,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:25:57" (1/1) ... [2018-01-24 17:25:57,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:25:57" (1/1) ... [2018-01-24 17:25:57,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:25:57" (1/1) ... [2018-01-24 17:25:57,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:25:57,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:25:57,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:25:57,079 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:25:57,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:25: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:25:57,125 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:25:57,125 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:25:57,125 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 17:25:57,125 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 17:25:57,125 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:25:57,125 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:25:57,126 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:25:57,126 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:25:57,126 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:25:57,126 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:25:57,126 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:25:57,126 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:25:57,126 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:25:57,126 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 17:25:57,126 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 17:25:57,126 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:25:57,127 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:25:57,127 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:25:57,310 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:25:57,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:25:57 BoogieIcfgContainer [2018-01-24 17:25:57,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:25:57,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:25:57,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:25:57,314 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:25:57,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:25:56" (1/3) ... [2018-01-24 17:25:57,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ed7e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:25:57, skipping insertion in model container [2018-01-24 17:25:57,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:25:57" (2/3) ... [2018-01-24 17:25:57,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ed7e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:25:57, skipping insertion in model container [2018-01-24 17:25:57,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:25:57" (3/3) ... [2018-01-24 17:25:57,318 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i [2018-01-24 17:25:57,327 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:25:57,335 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 17:25:57,385 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:25:57,385 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:25:57,386 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:25:57,386 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:25:57,386 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:25:57,386 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:25:57,386 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:25:57,386 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:25:57,387 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:25:57,407 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 17:25:57,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 17:25:57,414 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:25:57,416 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:25:57,416 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:25:57,421 INFO L82 PathProgramCache]: Analyzing trace with hash 932191006, now seen corresponding path program 1 times [2018-01-24 17:25:57,424 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:25:57,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:57,479 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:25:57,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:57,479 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:25:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:25:57,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:25:57,616 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:25:57,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:25:57,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:25:57,619 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:25:57,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:25:57,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:25:57,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:25:57,639 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-24 17:25:57,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:25:57,839 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2018-01-24 17:25:57,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:25:57,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 17:25:57,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:25:57,853 INFO L225 Difference]: With dead ends: 95 [2018-01-24 17:25:57,853 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 17:25:57,857 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:25:57,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 17:25:57,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-01-24 17:25:57,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 17:25:57,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-01-24 17:25:57,906 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 17 [2018-01-24 17:25:57,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:25:57,907 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-01-24 17:25:57,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:25:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-01-24 17:25:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 17:25:57,909 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:25:57,909 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:25:57,909 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:25:57,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1509814464, now seen corresponding path program 1 times [2018-01-24 17:25:57,910 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:25:57,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:57,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:25:57,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:57,912 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:25:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:25:57,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:25:58,001 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:25:58,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:25:58,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:25:58,001 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:25:58,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:25:58,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:25:58,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:25:58,003 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 6 states. [2018-01-24 17:25:58,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:25:58,071 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2018-01-24 17:25:58,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:25:58,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 17:25:58,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:25:58,074 INFO L225 Difference]: With dead ends: 75 [2018-01-24 17:25:58,074 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 17:25:58,075 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:25:58,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 17:25:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2018-01-24 17:25:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 17:25:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-24 17:25:58,084 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2018-01-24 17:25:58,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:25:58,084 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-24 17:25:58,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:25:58,085 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-24 17:25:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 17:25:58,086 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:25:58,086 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:25:58,086 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:25:58,086 INFO L82 PathProgramCache]: Analyzing trace with hash 179879494, now seen corresponding path program 1 times [2018-01-24 17:25:58,086 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:25:58,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:58,088 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:25:58,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:58,088 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:25:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:25:58,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:25:58,150 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:25:58,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:25:58,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:25:58,151 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:25:58,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:25:58,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:25:58,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:25:58,152 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-01-24 17:25:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:25:58,187 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-24 17:25:58,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:25:58,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 17:25:58,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:25:58,189 INFO L225 Difference]: With dead ends: 70 [2018-01-24 17:25:58,189 INFO L226 Difference]: Without dead ends: 69 [2018-01-24 17:25:58,190 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:25:58,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-24 17:25:58,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-01-24 17:25:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 17:25:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-01-24 17:25:58,199 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 20 [2018-01-24 17:25:58,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:25:58,200 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-01-24 17:25:58,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:25:58,200 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-01-24 17:25:58,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 17:25:58,201 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:25:58,202 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:25:58,202 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:25:58,202 INFO L82 PathProgramCache]: Analyzing trace with hash 179879495, now seen corresponding path program 1 times [2018-01-24 17:25:58,202 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:25:58,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:58,204 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:25:58,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:58,204 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:25:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:25:58,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:25:58,253 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:25:58,254 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:25:58,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:25:58,254 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:25:58,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:25:58,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:25:58,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:25:58,255 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 5 states. [2018-01-24 17:25:58,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:25:58,320 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-01-24 17:25:58,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:25:58,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 17:25:58,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:25:58,322 INFO L225 Difference]: With dead ends: 71 [2018-01-24 17:25:58,322 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 17:25:58,322 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:25:58,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 17:25:58,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-01-24 17:25:58,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 17:25:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-01-24 17:25:58,332 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 20 [2018-01-24 17:25:58,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:25:58,332 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-01-24 17:25:58,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:25:58,332 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-01-24 17:25:58,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 17:25:58,333 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:25:58,334 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:25:58,334 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:25:58,334 INFO L82 PathProgramCache]: Analyzing trace with hash 179879544, now seen corresponding path program 1 times [2018-01-24 17:25:58,334 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:25:58,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:58,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:25:58,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:58,336 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:25:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:25:58,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:25:58,419 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:25:58,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:25:58,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:25:58,419 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:25:58,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:25:58,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:25:58,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:25:58,420 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 5 states. [2018-01-24 17:25:58,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:25:58,463 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-01-24 17:25:58,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:25:58,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 17:25:58,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:25:58,464 INFO L225 Difference]: With dead ends: 80 [2018-01-24 17:25:58,464 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 17:25:58,465 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:25:58,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 17:25:58,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-24 17:25:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 17:25:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-24 17:25:58,471 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 20 [2018-01-24 17:25:58,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:25:58,471 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-24 17:25:58,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:25:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-24 17:25:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 17:25:58,472 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:25:58,472 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:25:58,472 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:25:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638300, now seen corresponding path program 1 times [2018-01-24 17:25:58,473 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:25:58,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:58,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:25:58,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:58,474 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:25:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:25:58,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:25:58,540 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:25:58,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:25:58,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:25:58,541 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:25:58,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:25:58,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:25:58,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:25:58,542 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-01-24 17:25:58,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:25:58,585 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-24 17:25:58,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:25:58,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 17:25:58,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:25:58,586 INFO L225 Difference]: With dead ends: 45 [2018-01-24 17:25:58,586 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 17:25:58,587 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:25:58,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 17:25:58,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-24 17:25:58,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 17:25:58,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-24 17:25:58,591 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 22 [2018-01-24 17:25:58,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:25:58,591 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-24 17:25:58,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:25:58,591 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-24 17:25:58,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 17:25:58,592 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:25:58,592 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:25:58,592 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:25:58,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638299, now seen corresponding path program 1 times [2018-01-24 17:25:58,592 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:25:58,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:58,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:25:58,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:58,594 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:25:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:25:58,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:25:58,650 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:25:58,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:25:58,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:25:58,651 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:25:58,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:25:58,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:25:58,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:25:58,652 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-01-24 17:25:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:25:58,741 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-24 17:25:58,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:25:58,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 17:25:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:25:58,743 INFO L225 Difference]: With dead ends: 52 [2018-01-24 17:25:58,743 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 17:25:58,743 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:25:58,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 17:25:58,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-01-24 17:25:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 17:25:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-01-24 17:25:58,750 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2018-01-24 17:25:58,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:25:58,750 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-01-24 17:25:58,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:25:58,750 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-01-24 17:25:58,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 17:25:58,751 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:25:58,751 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:25:58,752 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:25:58,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638249, now seen corresponding path program 1 times [2018-01-24 17:25:58,752 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:25:58,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:58,753 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:25:58,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:58,754 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:25:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:25:58,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:25:58,837 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:25:58,837 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:25:58,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:25:58,838 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:25:58,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:25:58,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:25:58,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:25:58,839 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2018-01-24 17:25:58,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:25:58,941 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2018-01-24 17:25:58,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:25:58,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-24 17:25:58,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:25:58,943 INFO L225 Difference]: With dead ends: 94 [2018-01-24 17:25:58,943 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 17:25:58,943 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:25:58,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 17:25:58,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-01-24 17:25:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 17:25:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-01-24 17:25:58,951 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 22 [2018-01-24 17:25:58,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:25:58,952 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-01-24 17:25:58,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:25:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-01-24 17:25:58,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 17:25:58,953 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:25:58,953 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:25:58,953 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:25:58,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1600952977, now seen corresponding path program 1 times [2018-01-24 17:25:58,954 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:25:58,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:58,955 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:25:58,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:58,955 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:25:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:25:58,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:25:59,020 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:25:59,020 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:25:59,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:25:59,064 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:25:59,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:25:59,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:25:59,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:25:59,065 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-01-24 17:25:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:25:59,080 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-01-24 17:25:59,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:25:59,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-24 17:25:59,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:25:59,083 INFO L225 Difference]: With dead ends: 106 [2018-01-24 17:25:59,083 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 17:25:59,088 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:25:59,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 17:25:59,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-01-24 17:25:59,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 17:25:59,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-01-24 17:25:59,096 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 26 [2018-01-24 17:25:59,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:25:59,096 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-01-24 17:25:59,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:25:59,096 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-01-24 17:25:59,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:25:59,097 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:25:59,098 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:25:59,098 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:25:59,098 INFO L82 PathProgramCache]: Analyzing trace with hash -578226829, now seen corresponding path program 1 times [2018-01-24 17:25:59,098 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:25:59,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:59,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:25:59,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:25:59,100 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:25:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:25:59,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:25:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:25:59,275 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:25:59,276 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:25:59,276 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 17:25:59,278 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [21], [25], [30], [32], [37], [39], [75], [77], [78], [79], [81], [82], [83], [84] [2018-01-24 17:25:59,320 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:25:59,320 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:25:59,468 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:25:59,470 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-24 17:25:59,488 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:25:59,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:25:59,489 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:25:59,500 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:25:59,500 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:25:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:25:59,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:25:59,571 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:25:59,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:25:59,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:25:59,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:25:59,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:25:59,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:25:59,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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:25:59,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:25:59,648 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:25:59,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 17:25:59,688 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:25:59,688 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:26:00,003 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:26:00,031 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:26:00,031 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:26:00,035 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:26:00,035 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:26:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:26:00,069 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:26:00,071 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:26:00,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:00,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:26:00,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:26:00,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:26:00,091 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:26:00,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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:26:00,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:00,097 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:26:00,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 17:26:00,101 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:26:00,102 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:26:01,143 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:26:01,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:26:01,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 16 [2018-01-24 17:26:01,145 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:26:01,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 17:26:01,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 17:26:01,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-01-24 17:26:01,146 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 11 states. [2018-01-24 17:26:01,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:26:01,418 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2018-01-24 17:26:01,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:26:01,419 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-01-24 17:26:01,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:26:01,420 INFO L225 Difference]: With dead ends: 75 [2018-01-24 17:26:01,420 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 17:26:01,421 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 96 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-01-24 17:26:01,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 17:26:01,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2018-01-24 17:26:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 17:26:01,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-01-24 17:26:01,429 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 28 [2018-01-24 17:26:01,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:26:01,430 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-01-24 17:26:01,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 17:26:01,430 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-01-24 17:26:01,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:26:01,431 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:26:01,431 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:26:01,431 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:26:01,431 INFO L82 PathProgramCache]: Analyzing trace with hash -578226828, now seen corresponding path program 1 times [2018-01-24 17:26:01,431 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:26:01,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:26:01,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:26:01,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:26:01,433 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:26:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:26:01,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:26:01,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:26:01,850 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:26:01,851 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:26:01,851 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 17:26:01,851 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [21], [25], [30], [32], [37], [40], [75], [77], [78], [79], [81], [82], [83], [84] [2018-01-24 17:26:01,852 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:26:01,852 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:26:01,916 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:26:01,917 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-24 17:26:01,918 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:26:01,918 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:26:01,918 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:26:01,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:26:01,930 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:26:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:26:01,952 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:26:01,982 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 23 treesize of output 22 [2018-01-24 17:26:01,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:02,010 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 22 treesize of output 21 [2018-01-24 17:26:02,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:02,013 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 26 treesize of output 25 [2018-01-24 17:26:02,014 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:02,030 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 25 treesize of output 24 [2018-01-24 17:26:02,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:02,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:26:02,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 17:26:02,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:26:02,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:26:02,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-24 17:26:02,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:02,345 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:26:02,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:26:02,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-01-24 17:26:02,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:02,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:26:02,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:26:02,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-01-24 17:26:02,396 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:02,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-01-24 17:26:02,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:02,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 17:26:02,471 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 17:26:02,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:26:02,571 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:26:03,352 WARN L146 SmtUtils]: Spent 684ms on a formula simplification. DAG size of input: 46 DAG size of output 34 [2018-01-24 17:26:03,371 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-24 17:26:05,512 WARN L146 SmtUtils]: Spent 2014ms on a formula simplification. DAG size of input: 84 DAG size of output 31 [2018-01-24 17:26:05,526 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 17:26:07,873 WARN L146 SmtUtils]: Spent 2211ms on a formula simplification. DAG size of input: 73 DAG size of output 41 [2018-01-24 17:26:08,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 34 treesize of output 37 [2018-01-24 17:26:08,205 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 17:26:08,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:08,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:26:08,240 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 17:26:08,240 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:08,268 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 17:26:08,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:08,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:26:08,295 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-24 17:26:11,145 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-24 17:26:11,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:11,174 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-24 17:26:11,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:11,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 46 treesize of output 49 [2018-01-24 17:26:11,242 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-24 17:26:11,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:11,253 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:26:11,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 17:26:11,278 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-24 17:26:13,479 WARN L1029 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ldv_malloc_#in~size| 4294967296))) (and (or (<= 4 .cse0) (forall ((v_prenex_41 Int)) (let ((.cse2 (* 4 v_prenex_41))) (let ((.cse1 (mod .cse2 4294967296))) (or (< .cse1 4) (not (= .cse2 |c_ldv_malloc_#in~size|)) (< 2147483647 .cse1)))))) (or (forall ((v_prenex_35 Int)) (let ((.cse3 (* 4 v_prenex_35))) (let ((.cse4 (mod .cse3 4294967296))) (or (not (= .cse3 |c_ldv_malloc_#in~size|)) (< 2147483647 .cse4) (< .cse4 4))))) (<= .cse0 2147483647)))) is different from true [2018-01-24 17:26:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-01-24 17:26:13,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:26:13,509 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 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 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:26:13,512 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:26:13,512 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:26:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:26:13,569 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:26:13,580 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 26 treesize of output 25 [2018-01-24 17:26:13,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:13,589 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 23 treesize of output 22 [2018-01-24 17:26:13,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:13,659 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 22 treesize of output 21 [2018-01-24 17:26:13,660 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:13,722 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 25 treesize of output 24 [2018-01-24 17:26:13,723 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:13,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:26:13,750 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 17:26:13,853 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:26:13,855 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:26:13,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 67 [2018-01-24 17:26:13,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:13,924 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:26:13,925 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:26:13,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-01-24 17:26:13,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:13,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:26:13,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-01-24 17:26:13,985 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:14,047 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:26:14,048 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:26:14,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-01-24 17:26:14,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:14,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 17:26:14,081 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 17:26:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:26:14,149 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:26:14,252 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-01-24 17:26:14,450 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 17:26:18,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 34 treesize of output 37 [2018-01-24 17:26:18,865 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 17:26:18,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:18,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:26:18,889 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 17:26:18,889 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:18,905 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 17:26:18,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:18,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:26:18,921 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-24 17:26:21,264 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-24 17:26:21,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:21,292 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-24 17:26:21,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:21,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 46 treesize of output 49 [2018-01-24 17:26:21,348 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-24 17:26:21,348 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:26:21,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:26:21,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 17:26:21,411 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-24 17:26:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-01-24 17:26:21,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:26:21,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12, 11, 12] total 32 [2018-01-24 17:26:21,964 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:26:21,965 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 17:26:21,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 17:26:21,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=4, NotChecked=60, Total=1056 [2018-01-24 17:26:21,966 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 21 states. [2018-01-24 17:26:22,353 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-24 17:27:01,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:01,818 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2018-01-24 17:27:01,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 17:27:01,818 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-01-24 17:27:01,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:01,819 INFO L225 Difference]: With dead ends: 117 [2018-01-24 17:27:01,819 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 17:27:01,820 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 79 SyntacticMatches, 12 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=235, Invalid=1654, Unknown=7, NotChecked=84, Total=1980 [2018-01-24 17:27:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 17:27:01,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 55. [2018-01-24 17:27:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 17:27:01,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-01-24 17:27:01,834 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 28 [2018-01-24 17:27:01,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:01,834 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-01-24 17:27:01,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 17:27:01,834 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-01-24 17:27:01,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 17:27:01,835 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:01,835 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:27:01,835 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:27:01,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1623272965, now seen corresponding path program 1 times [2018-01-24 17:27:01,836 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:01,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:01,837 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:01,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:01,838 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:01,846 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:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 17:27:01,872 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:01,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:27:01,872 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:01,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:27:01,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:27:01,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:27:01,873 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 4 states. [2018-01-24 17:27:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:01,911 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2018-01-24 17:27:01,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:27:01,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-24 17:27:01,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:01,913 INFO L225 Difference]: With dead ends: 81 [2018-01-24 17:27:01,913 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 17:27:01,913 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:27:01,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 17:27:01,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-01-24 17:27:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 17:27:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-01-24 17:27:01,944 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 29 [2018-01-24 17:27:01,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:01,945 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-01-24 17:27:01,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:27:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-01-24 17:27:01,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 17:27:01,947 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:01,947 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:27:01,947 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:27:01,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1889590311, now seen corresponding path program 1 times [2018-01-24 17:27:01,948 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:01,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:01,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:01,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:01,949 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:01,960 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:02,078 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:02,078 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:02,078 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:27:02,079 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-24 17:27:02,079 INFO L201 CegarAbsIntRunner]: [2], [3], [6], [7], [8], [9], [10], [11], [12], [16], [18], [21], [25], [30], [32], [35], [46], [50], [53], [68], [74], [75], [76], [77], [78], [79], [81], [82], [83], [84] [2018-01-24 17:27:02,080 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:27:02,081 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:27:02,184 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:27:02,184 INFO L268 AbstractInterpreter]: Visited 30 different actions 44 times. Merged at 6 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 19 variables. [2018-01-24 17:27:02,189 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:27:02,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:02,190 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:27:02,198 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:02,198 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:27:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:02,222 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:27:02,357 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:02,357 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:27:02,469 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_10| 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:27:02,471 INFO L168 Benchmark]: Toolchain (without parser) took 65650.34 ms. Allocated memory was 304.1 MB in the beginning and 520.1 MB in the end (delta: 216.0 MB). Free memory was 263.0 MB in the beginning and 396.0 MB in the end (delta: -133.0 MB). Peak memory consumption was 83.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:27:02,472 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 304.1 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:27:02,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.23 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 249.0 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:27:02,472 INFO L168 Benchmark]: Boogie Preprocessor took 36.40 ms. Allocated memory is still 304.1 MB. Free memory was 249.0 MB in the beginning and 247.0 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:27:02,473 INFO L168 Benchmark]: RCFGBuilder took 232.86 ms. Allocated memory is still 304.1 MB. Free memory was 247.0 MB in the beginning and 230.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:27:02,473 INFO L168 Benchmark]: TraceAbstraction took 65158.53 ms. Allocated memory was 304.1 MB in the beginning and 520.1 MB in the end (delta: 216.0 MB). Free memory was 230.0 MB in the beginning and 396.0 MB in the end (delta: -166.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:27:02,475 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 304.1 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.23 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 249.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.40 ms. Allocated memory is still 304.1 MB. Free memory was 249.0 MB in the beginning and 247.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 232.86 ms. Allocated memory is still 304.1 MB. Free memory was 247.0 MB in the beginning and 230.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 65158.53 ms. Allocated memory was 304.1 MB in the beginning and 520.1 MB in the end (delta: 216.0 MB). Free memory was 230.0 MB in the beginning and 396.0 MB in the end (delta: -166.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 123 LocStat_NO_SUPPORTING_DISEQUALITIES : 24 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 41 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.476922 RENAME_VARIABLES(MILLISECONDS) : 0.205627 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.431837 PROJECTAWAY(MILLISECONDS) : 0.097792 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001656 DISJOIN(MILLISECONDS) : 0.491823 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.242323 ADD_EQUALITY(MILLISECONDS) : 0.035695 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.034559 #CONJOIN_DISJUNCTIVE : 45 #RENAME_VARIABLES : 77 #UNFREEZE : 0 #CONJOIN : 77 #PROJECTAWAY : 74 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 75 #ADD_EQUALITY : 40 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 123 LocStat_NO_SUPPORTING_DISEQUALITIES : 23 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 43 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.564488 RENAME_VARIABLES(MILLISECONDS) : 0.169602 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.220988 PROJECTAWAY(MILLISECONDS) : 0.071089 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001141 DISJOIN(MILLISECONDS) : 0.401222 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.206082 ADD_EQUALITY(MILLISECONDS) : 0.025254 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.037052 #CONJOIN_DISJUNCTIVE : 45 #RENAME_VARIABLES : 78 #UNFREEZE : 0 #CONJOIN : 78 #PROJECTAWAY : 76 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 7 #RENAME_VARIABLES_DISJUNCTIVE : 75 #ADD_EQUALITY : 42 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 155 LocStat_NO_SUPPORTING_DISEQUALITIES : 18 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 38 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 62 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 42 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.109767 RENAME_VARIABLES(MILLISECONDS) : 0.086388 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.070763 PROJECTAWAY(MILLISECONDS) : 0.033406 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001275 DISJOIN(MILLISECONDS) : 0.540362 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.110370 ADD_EQUALITY(MILLISECONDS) : 0.036711 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015601 #CONJOIN_DISJUNCTIVE : 72 #RENAME_VARIABLES : 144 #UNFREEZE : 0 #CONJOIN : 152 #PROJECTAWAY : 124 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 14 #RENAME_VARIABLES_DISJUNCTIVE : 138 #ADD_EQUALITY : 53 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_old(#valid)_BEFORE_CALL_10| term size 19 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_old(#valid)_BEFORE_CALL_10| 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_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-27-02-484.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-27-02-484.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-27-02-484.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_17-27-02-484.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_17-27-02-484.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_17-27-02-484.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_17-27-02-484.csv Received shutdown request...