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_precise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 00:04:13,523 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 00:04:13,549 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 00:04:13,565 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 00:04:13,565 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 00:04:13,566 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 00:04:13,568 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 00:04:13,569 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 00:04:13,571 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 00:04:13,572 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 00:04:13,573 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 00:04:13,573 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 00:04:13,574 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 00:04:13,575 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 00:04:13,576 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 00:04:13,579 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 00:04:13,581 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 00:04:13,583 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 00:04:13,584 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 00:04:13,585 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 00:04:13,588 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 00:04:13,588 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 00:04:13,588 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 00:04:13,589 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 00:04:13,590 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 00:04:13,591 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 00:04:13,592 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 00:04:13,592 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 00:04:13,593 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 00:04:13,593 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 00:04:13,593 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 00:04:13,594 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_precise.epf [2018-01-25 00:04:13,602 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 00:04:13,602 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 00:04:13,603 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 00:04:13,603 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 00:04:13,603 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 00:04:13,603 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 00:04:13,604 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 00:04:13,604 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 00:04:13,604 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 00:04:13,604 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 00:04:13,604 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 00:04:13,605 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 00:04:13,605 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 00:04:13,605 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 00:04:13,605 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 00:04:13,605 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 00:04:13,605 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 00:04:13,605 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 00:04:13,605 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 00:04:13,606 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 00:04:13,606 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 00:04:13,606 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 00:04:13,606 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 00:04:13,606 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 00:04:13,607 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 00:04:13,607 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 00:04:13,607 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 00:04:13,607 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 00:04:13,607 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 00:04:13,607 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 00:04:13,607 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 00:04:13,608 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 00:04:13,608 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 00:04:13,608 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 00:04:13,608 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 00:04:13,609 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 00:04:13,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 00:04:13,651 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 00:04:13,654 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 00:04:13,655 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 00:04:13,656 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 00:04:13,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-01-25 00:04:13,826 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 00:04:13,830 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 00:04:13,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 00:04:13,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 00:04:13,836 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 00:04:13,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:04:13" (1/1) ... [2018-01-25 00:04:13,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c0846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:04:13, skipping insertion in model container [2018-01-25 00:04:13,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:04:13" (1/1) ... [2018-01-25 00:04:13,852 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:04:13,899 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:04:14,012 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:04:14,033 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:04:14,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:04:14 WrapperNode [2018-01-25 00:04:14,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 00:04:14,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 00:04:14,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 00:04:14,043 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 00:04:14,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:04:14" (1/1) ... [2018-01-25 00:04:14,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:04:14" (1/1) ... [2018-01-25 00:04:14,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:04:14" (1/1) ... [2018-01-25 00:04:14,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:04:14" (1/1) ... [2018-01-25 00:04:14,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:04:14" (1/1) ... [2018-01-25 00:04:14,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:04:14" (1/1) ... [2018-01-25 00:04:14,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:04:14" (1/1) ... [2018-01-25 00:04:14,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 00:04:14,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 00:04:14,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 00:04:14,083 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 00:04:14,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:04:14" (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-25 00:04:14,138 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 00:04:14,139 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 00:04:14,139 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 00:04:14,139 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 00:04:14,139 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 00:04:14,139 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 00:04:14,139 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 00:04:14,139 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 00:04:14,139 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 00:04:14,139 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 00:04:14,140 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 00:04:14,140 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 00:04:14,140 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 00:04:14,140 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 00:04:14,140 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 00:04:14,140 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 00:04:14,140 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 00:04:14,140 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 00:04:14,340 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 00:04:14,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:04:14 BoogieIcfgContainer [2018-01-25 00:04:14,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 00:04:14,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 00:04:14,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 00:04:14,343 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 00:04:14,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 12:04:13" (1/3) ... [2018-01-25 00:04:14,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6375369c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:04:14, skipping insertion in model container [2018-01-25 00:04:14,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:04:14" (2/3) ... [2018-01-25 00:04:14,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6375369c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:04:14, skipping insertion in model container [2018-01-25 00:04:14,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:04:14" (3/3) ... [2018-01-25 00:04:14,346 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-01-25 00:04:14,352 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 00:04:14,357 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-25 00:04:14,400 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 00:04:14,401 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 00:04:14,401 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 00:04:14,401 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 00:04:14,401 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 00:04:14,401 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 00:04:14,401 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 00:04:14,401 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 00:04:14,402 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 00:04:14,418 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-25 00:04:14,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 00:04:14,423 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:04:14,424 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:04:14,424 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:04:14,428 INFO L82 PathProgramCache]: Analyzing trace with hash -100423179, now seen corresponding path program 1 times [2018-01-25 00:04:14,430 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:04:14,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:04:14,478 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:04:14,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:04:14,478 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:04:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:04:14,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:04:14,609 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-25 00:04:14,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:04:14,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:04:14,612 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:04:14,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:04:14,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:04:14,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:04:14,632 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-25 00:04:14,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:04:14,824 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2018-01-25 00:04:14,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:04:14,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-25 00:04:14,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:04:14,839 INFO L225 Difference]: With dead ends: 84 [2018-01-25 00:04:14,840 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 00:04:14,843 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-25 00:04:14,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 00:04:14,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-01-25 00:04:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 00:04:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-01-25 00:04:14,889 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 17 [2018-01-25 00:04:14,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:04:14,889 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-01-25 00:04:14,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:04:14,890 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-01-25 00:04:14,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 00:04:14,891 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:04:14,891 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-25 00:04:14,891 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:04:14,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1898895127, now seen corresponding path program 1 times [2018-01-25 00:04:14,891 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:04:14,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:04:14,894 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:04:14,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:04:14,894 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:04:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:04:14,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:04:14,973 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-25 00:04:14,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:04:14,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:04:14,974 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:04:14,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:04:14,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:04:14,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:04:14,975 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 6 states. [2018-01-25 00:04:15,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:04:15,067 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2018-01-25 00:04:15,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:04:15,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 00:04:15,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:04:15,070 INFO L225 Difference]: With dead ends: 82 [2018-01-25 00:04:15,070 INFO L226 Difference]: Without dead ends: 78 [2018-01-25 00:04:15,070 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-25 00:04:15,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-25 00:04:15,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-01-25 00:04:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 00:04:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-01-25 00:04:15,078 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 19 [2018-01-25 00:04:15,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:04:15,079 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-01-25 00:04:15,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:04:15,079 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-01-25 00:04:15,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 00:04:15,079 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:04:15,080 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] [2018-01-25 00:04:15,080 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:04:15,080 INFO L82 PathProgramCache]: Analyzing trace with hash -538007597, now seen corresponding path program 1 times [2018-01-25 00:04:15,080 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:04:15,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:04:15,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:04:15,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:04:15,082 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:04:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:04:15,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:04:15,145 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-25 00:04:15,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:04:15,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 00:04:15,146 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:04:15,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 00:04:15,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 00:04:15,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 00:04:15,147 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 4 states. [2018-01-25 00:04:15,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:04:15,186 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2018-01-25 00:04:15,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 00:04:15,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-25 00:04:15,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:04:15,188 INFO L225 Difference]: With dead ends: 90 [2018-01-25 00:04:15,188 INFO L226 Difference]: Without dead ends: 86 [2018-01-25 00:04:15,189 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 00:04:15,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-25 00:04:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2018-01-25 00:04:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 00:04:15,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-01-25 00:04:15,200 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 21 [2018-01-25 00:04:15,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:04:15,201 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-01-25 00:04:15,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 00:04:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-01-25 00:04:15,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 00:04:15,202 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:04:15,202 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:04:15,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-25 00:04:15,203 INFO L82 PathProgramCache]: Analyzing trace with hash -483541835, now seen corresponding path program 1 times [2018-01-25 00:04:15,203 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:04:15,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:04:15,204 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:04:15,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:04:15,204 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:04:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:04:15,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:04:15,271 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-25 00:04:15,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:04:15,272 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:04:15,273 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 00:04:15,275 INFO L201 CegarAbsIntRunner]: [3], [9], [10], [11], [12], [16], [18], [22], [26], [31], [33], [38], [40], [73], [75], [76], [77], [79], [80], [81], [82] [2018-01-25 00:04:15,318 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 00:04:15,318 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 00:04:15,442 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 00:04:15,444 INFO L268 AbstractInterpreter]: Visited 14 different actions 14 times. Never merged. Never widened. Never found a fixpoint. Largest state had 17 variables. [2018-01-25 00:04:15,451 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 00:04:15,532 INFO L232 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 67.07% of their original sizes. [2018-01-25 00:04:15,533 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 00:04:15,587 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 00:04:15,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 00:04:15,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-01-25 00:04:15,589 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:04:15,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 00:04:15,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 00:04:15,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:04:15,590 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 7 states. [2018-01-25 00:04:19,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:04:19,607 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-01-25 00:04:19,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 00:04:19,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-25 00:04:19,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:04:19,608 INFO L225 Difference]: With dead ends: 91 [2018-01-25 00:04:19,608 INFO L226 Difference]: Without dead ends: 47 [2018-01-25 00:04:19,609 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:04:19,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-25 00:04:19,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-25 00:04:19,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 00:04:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-25 00:04:19,617 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 24 [2018-01-25 00:04:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:04:19,617 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-25 00:04:19,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 00:04:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-25 00:04:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 00:04:19,618 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:04:19,619 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-25 00:04:19,619 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:04:19,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1986913619, now seen corresponding path program 1 times [2018-01-25 00:04:19,619 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:04:19,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:04:19,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:04:19,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:04:19,621 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:04:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:04:19,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:04:19,686 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-25 00:04:19,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:04:19,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:04:19,686 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:04:19,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:04:19,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:04:19,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:04:19,687 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2018-01-25 00:04:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:04:19,703 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-01-25 00:04:19,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:04:19,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-25 00:04:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:04:19,705 INFO L225 Difference]: With dead ends: 86 [2018-01-25 00:04:19,705 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 00:04:19,706 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-25 00:04:19,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 00:04:19,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-01-25 00:04:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 00:04:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-25 00:04:19,715 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 26 [2018-01-25 00:04:19,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:04:19,715 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-25 00:04:19,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:04:19,715 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-25 00:04:19,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 00:04:19,716 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:04:19,716 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-25 00:04:19,716 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:04:19,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008117, now seen corresponding path program 1 times [2018-01-25 00:04:19,717 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:04:19,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:04:19,718 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:04:19,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:04:19,718 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:04:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:04:19,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:04:19,922 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-25 00:04:19,923 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:04:19,923 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:04:19,923 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 00:04:19,923 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [22], [26], [31], [33], [38], [40], [73], [75], [76], [77], [79], [80], [81], [82] [2018-01-25 00:04:19,925 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 00:04:19,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 00:04:20,628 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 00:04:20,629 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-25 00:04:20,635 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 00:04:21,272 INFO L232 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 76.37% of their original sizes. [2018-01-25 00:04:21,272 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 00:04:21,559 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 00:04:21,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 00:04:21,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 21 [2018-01-25 00:04:21,560 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:04:21,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 00:04:21,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 00:04:21,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=158, Unknown=3, NotChecked=0, Total=210 [2018-01-25 00:04:21,561 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 15 states. [2018-01-25 00:04:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:04:27,944 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2018-01-25 00:04:27,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 00:04:27,944 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-01-25 00:04:27,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:04:27,946 INFO L225 Difference]: With dead ends: 100 [2018-01-25 00:04:27,946 INFO L226 Difference]: Without dead ends: 81 [2018-01-25 00:04:27,946 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=292, Unknown=3, NotChecked=0, Total=380 [2018-01-25 00:04:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-25 00:04:27,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2018-01-25 00:04:27,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-25 00:04:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-01-25 00:04:27,956 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 28 [2018-01-25 00:04:27,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:04:27,957 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-01-25 00:04:27,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 00:04:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-01-25 00:04:27,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 00:04:27,958 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:04:27,958 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-25 00:04:27,958 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:04:27,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008118, now seen corresponding path program 1 times [2018-01-25 00:04:27,958 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:04:27,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:04:27,960 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:04:27,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:04:27,960 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:04:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:04:27,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:04:28,443 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-25 00:04:28,444 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:04:28,444 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:04:28,444 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 00:04:28,444 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [22], [26], [31], [33], [38], [41], [73], [75], [76], [77], [79], [80], [81], [82] [2018-01-25 00:04:28,445 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 00:04:28,445 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 00:04:28,992 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 00:04:28,992 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-25 00:04:29,010 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 00:04:29,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:04:29,010 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-25 00:04:29,017 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:04:29,017 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 00:04:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:04:29,053 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:04:29,117 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-25 00:04:29,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:29,142 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-25 00:04:29,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:29,147 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-25 00:04:29,147 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:29,184 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-25 00:04:29,185 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:29,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:04:29,209 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-25 00:04:29,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:04:29,448 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:04:29,449 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-25 00:04:29,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:29,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:04:29,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:04:29,524 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-25 00:04:29,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:29,581 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:04:29,582 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:04:29,583 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 45 treesize of output 39 [2018-01-25 00:04:29,583 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:29,623 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-25 00:04:29,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:29,656 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-25 00:04:29,657 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-25 00:04:29,754 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-25 00:04:29,755 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:04:31,008 WARN L146 SmtUtils]: Spent 1161ms on a formula simplification. DAG size of input: 46 DAG size of output 32 [2018-01-25 00:04:31,022 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-01-25 00:04:44,272 WARN L146 SmtUtils]: Spent 8528ms on a formula simplification. DAG size of input: 76 DAG size of output 29 [2018-01-25 00:04:44,288 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 00:04:48,476 WARN L143 SmtUtils]: Spent 4019ms on a formula simplification that was a NOOP. DAG size: 71 [2018-01-25 00:04:48,486 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 00:04:48,500 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 00:04:48,692 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 32 treesize of output 26 [2018-01-25 00:04:48,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:48,714 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 26 treesize of output 29 [2018-01-25 00:04:48,734 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-25 00:04:48,735 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:48,741 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 00:04:48,756 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-25 00:04:48,756 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:48,769 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-25 00:04:48,769 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:82, output treesize:15 [2018-01-25 00:04:49,784 WARN L143 SmtUtils]: Spent 892ms on a formula simplification that was a NOOP. DAG size: 40 [2018-01-25 00:04:51,084 WARN L143 SmtUtils]: Spent 1112ms on a formula simplification that was a NOOP. DAG size: 49 [2018-01-25 00:04:51,154 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 50 treesize of output 44 [2018-01-25 00:04:51,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:51,184 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 44 treesize of output 47 [2018-01-25 00:04:51,216 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-25 00:04:51,216 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:51,226 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 00:04:51,251 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-25 00:04:51,251 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:51,274 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-25 00:04:51,274 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:114, output treesize:53 [2018-01-25 00:04:51,401 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-25 00:04:51,433 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:04:51,433 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-25 00:04:51,437 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:04:51,437 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 00:04:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:04:51,473 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:04:51,481 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-25 00:04:51,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:51,485 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-25 00:04:51,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:51,501 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-25 00:04:51,501 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:51,516 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-25 00:04:51,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:51,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:04:51,533 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-25 00:04:51,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:04:51,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:04:51,640 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 54 treesize of output 48 [2018-01-25 00:04:51,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:51,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:04:51,690 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 41 treesize of output 50 [2018-01-25 00:04:51,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:51,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:04:51,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:04:51,738 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 45 treesize of output 39 [2018-01-25 00:04:51,738 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:51,775 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-25 00:04:51,776 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:51,822 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-25 00:04:51,823 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-25 00:04:51,919 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-25 00:04:51,919 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:04:52,329 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-01-25 00:05:01,099 WARN L146 SmtUtils]: Spent 4066ms on a formula simplification. DAG size of input: 76 DAG size of output 29 [2018-01-25 00:05:01,109 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 00:05:09,421 WARN L143 SmtUtils]: Spent 4051ms on a formula simplification that was a NOOP. DAG size: 71 [2018-01-25 00:05:09,427 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 00:05:09,438 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 00:05:09,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-01-25 00:05:09,613 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-25 00:05:09,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:05:09,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 00:05:09,632 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-25 00:05:09,633 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:05:09,650 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-25 00:05:09,650 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:05:09,669 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-25 00:05:09,669 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:82, output treesize:15 [2018-01-25 00:05:10,389 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-25 00:05:10,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:05:10,415 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 50 treesize of output 44 [2018-01-25 00:05:10,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:05:10,440 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 44 treesize of output 47 [2018-01-25 00:05:10,466 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-25 00:05:10,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:05:10,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 00:05:10,497 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-25 00:05:10,497 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:114, output treesize:53 Received shutdown request... [2018-01-25 00:05:12,558 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 00:05:12,558 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 00:05:12,562 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 00:05:12,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 12:05:12 BoogieIcfgContainer [2018-01-25 00:05:12,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 00:05:12,563 INFO L168 Benchmark]: Toolchain (without parser) took 58736.85 ms. Allocated memory was 300.4 MB in the beginning and 1.1 GB in the end (delta: 822.6 MB). Free memory was 259.3 MB in the beginning and 356.2 MB in the end (delta: -96.9 MB). Peak memory consumption was 725.7 MB. Max. memory is 5.3 GB. [2018-01-25 00:05:12,564 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 300.4 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 00:05:12,564 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.01 ms. Allocated memory is still 300.4 MB. Free memory was 259.3 MB in the beginning and 246.3 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:05:12,564 INFO L168 Benchmark]: Boogie Preprocessor took 39.82 ms. Allocated memory is still 300.4 MB. Free memory was 246.3 MB in the beginning and 244.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:05:12,565 INFO L168 Benchmark]: RCFGBuilder took 258.22 ms. Allocated memory is still 300.4 MB. Free memory was 244.4 MB in the beginning and 227.4 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:05:12,565 INFO L168 Benchmark]: TraceAbstraction took 58221.36 ms. Allocated memory was 300.4 MB in the beginning and 1.1 GB in the end (delta: 822.6 MB). Free memory was 226.4 MB in the beginning and 356.2 MB in the end (delta: -129.9 MB). Peak memory consumption was 692.7 MB. Max. memory is 5.3 GB. [2018-01-25 00:05:12,566 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.12 ms. Allocated memory is still 300.4 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 211.01 ms. Allocated memory is still 300.4 MB. Free memory was 259.3 MB in the beginning and 246.3 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.82 ms. Allocated memory is still 300.4 MB. Free memory was 246.3 MB in the beginning and 244.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 258.22 ms. Allocated memory is still 300.4 MB. Free memory was 244.4 MB in the beginning and 227.4 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58221.36 ms. Allocated memory was 300.4 MB in the beginning and 1.1 GB in the end (delta: 822.6 MB). Free memory was 226.4 MB in the beginning and 356.2 MB in the end (delta: -129.9 MB). Peak memory consumption was 692.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 13 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 61 LocStat_NO_SUPPORTING_DISEQUALITIES : 0 LocStat_NO_DISJUNCTIONS : -26 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 22 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 26 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 23 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.850404 RENAME_VARIABLES(MILLISECONDS) : 0.161465 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.348660 PROJECTAWAY(MILLISECONDS) : 0.030028 ADD_WEAK_EQUALITY(MILLISECONDS) : 4.104545 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.205424 ADD_EQUALITY(MILLISECONDS) : 0.042471 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014197 #CONJOIN_DISJUNCTIVE : 21 #RENAME_VARIABLES : 43 #UNFREEZE : 0 #CONJOIN : 44 #PROJECTAWAY : 44 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 42 #ADD_EQUALITY : 26 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 134 LocStat_NO_SUPPORTING_DISEQUALITIES : 20 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 40 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.183101 RENAME_VARIABLES(MILLISECONDS) : 0.085622 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.154787 PROJECTAWAY(MILLISECONDS) : 0.023836 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.104820 DISJOIN(MILLISECONDS) : 0.495361 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.107266 ADD_EQUALITY(MILLISECONDS) : 0.011151 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012478 #CONJOIN_DISJUNCTIVE : 44 #RENAME_VARIABLES : 77 #UNFREEZE : 0 #CONJOIN : 76 #PROJECTAWAY : 73 #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 : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 143 LocStat_NO_SUPPORTING_DISEQUALITIES : 23 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 42 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.336012 RENAME_VARIABLES(MILLISECONDS) : 0.075802 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.140768 PROJECTAWAY(MILLISECONDS) : 0.060573 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.031721 DISJOIN(MILLISECONDS) : 0.295614 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.096933 ADD_EQUALITY(MILLISECONDS) : 0.015915 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005748 #CONJOIN_DISJUNCTIVE : 44 #RENAME_VARIABLES : 78 #UNFREEZE : 0 #CONJOIN : 77 #PROJECTAWAY : 76 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 7 #RENAME_VARIABLES_DISJUNCTIVE : 75 #ADD_EQUALITY : 42 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 58.1s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 10.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 286 SDtfs, 283 SDslu, 660 SDs, 0 SdLazy, 148 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.8817857142857142 AbsIntWeakeningRatio, 1.0 AbsIntAvgWeakeningVarsNumRemoved, 3.62 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 83 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 8403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 10/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_00-05-12-576.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_00-05-12-576.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_00-05-12-576.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_00-05-12-576.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_00-05-12-576.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_00-05-12-576.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_00-05-12-576.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_00-05-12-576.csv Completed graceful shutdown