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_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:19:49,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:19:49,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:19:49,572 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:19:49,572 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:19:49,573 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:19:49,574 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:19:49,576 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:19:49,578 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:19:49,579 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:19:49,580 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:19:49,580 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:19:49,581 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:19:49,582 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:19:49,583 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:19:49,586 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:19:49,588 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:19:49,590 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:19:49,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:19:49,593 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:19:49,595 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:19:49,596 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:19:49,596 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:19:49,597 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:19:49,598 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:19:49,599 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:19:49,600 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:19:49,600 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:19:49,601 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:19:49,601 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:19:49,602 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:19:49,602 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:19:49,611 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:19:49,612 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:19:49,612 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:19:49,613 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:19:49,613 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:19:49,613 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:19:49,613 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:19:49,613 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:19:49,613 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:19:49,614 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:19:49,614 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:19:49,614 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:19:49,614 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:19:49,614 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:19:49,614 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:19:49,614 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:19:49,615 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:19:49,615 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:19:49,615 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:19:49,615 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:19:49,615 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:19:49,615 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:19:49,616 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:19:49,616 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:19:49,616 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:19:49,616 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:19:49,616 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:19:49,617 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:19:49,617 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:19:49,617 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:19:49,617 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:19:49,617 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:19:49,617 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:19:49,617 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:19:49,618 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:19:49,618 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:19:49,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:19:49,662 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:19:49,665 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:19:49,666 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:19:49,667 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:19:49,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-01-24 17:19:49,849 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:19:49,854 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:19:49,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:19:49,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:19:49,859 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:19:49,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:19:49" (1/1) ... [2018-01-24 17:19:49,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3383522d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:19:49, skipping insertion in model container [2018-01-24 17:19:49,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:19:49" (1/1) ... [2018-01-24 17:19:49,876 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:19:49,924 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:19:50,046 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:19:50,066 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:19:50,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:19:50 WrapperNode [2018-01-24 17:19:50,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:19:50,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:19:50,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:19:50,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:19:50,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:19:50" (1/1) ... [2018-01-24 17:19:50,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:19:50" (1/1) ... [2018-01-24 17:19:50,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:19:50" (1/1) ... [2018-01-24 17:19:50,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:19:50" (1/1) ... [2018-01-24 17:19:50,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:19:50" (1/1) ... [2018-01-24 17:19:50,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:19:50" (1/1) ... [2018-01-24 17:19:50,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:19:50" (1/1) ... [2018-01-24 17:19:50,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:19:50,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:19:50,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:19:50,112 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:19:50,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:19:50" (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:19:50,162 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:19:50,163 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:19:50,163 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 17:19:50,163 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 17:19:50,163 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:19:50,163 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:19:50,164 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:19:50,164 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:19:50,164 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:19:50,164 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:19:50,164 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:19:50,164 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:19:50,165 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:19:50,165 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 17:19:50,165 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 17:19:50,165 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:19:50,165 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:19:50,165 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:19:50,385 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:19:50,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:19:50 BoogieIcfgContainer [2018-01-24 17:19:50,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:19:50,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:19:50,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:19:50,389 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:19:50,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:19:49" (1/3) ... [2018-01-24 17:19:50,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba9280e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:19:50, skipping insertion in model container [2018-01-24 17:19:50,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:19:50" (2/3) ... [2018-01-24 17:19:50,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba9280e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:19:50, skipping insertion in model container [2018-01-24 17:19:50,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:19:50" (3/3) ... [2018-01-24 17:19:50,392 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-01-24 17:19:50,399 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:19:50,407 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-24 17:19:50,450 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:19:50,450 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:19:50,451 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:19:50,451 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:19:50,451 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:19:50,451 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:19:50,451 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:19:50,451 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:19:50,452 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:19:50,473 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-24 17:19:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 17:19:50,479 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:19:50,479 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:19:50,479 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:19:50,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1647065445, now seen corresponding path program 1 times [2018-01-24 17:19:50,485 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:19:50,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:19:50,531 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:19:50,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:19:50,532 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:19:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:19:50,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:19:50,664 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:19:50,667 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:19:50,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:19:50,667 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:19:50,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:19:50,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:19:50,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:19:50,683 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-01-24 17:19:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:19:50,864 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2018-01-24 17:19:50,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:19:50,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 17:19:50,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:19:50,874 INFO L225 Difference]: With dead ends: 86 [2018-01-24 17:19:50,874 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 17:19:50,877 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:19:50,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 17:19:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-01-24 17:19:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 17:19:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-01-24 17:19:50,919 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 17 [2018-01-24 17:19:50,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:19:50,919 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-01-24 17:19:50,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:19:50,919 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-01-24 17:19:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 17:19:50,921 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:19:50,921 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:19:50,921 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:19:50,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1810172163, now seen corresponding path program 1 times [2018-01-24 17:19:50,922 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:19:50,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:19:50,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:19:50,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:19:50,924 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:19:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:19:50,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:19:51,026 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:19:51,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:19:51,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:19:51,027 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:19:51,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:19:51,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:19:51,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:19:51,029 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 6 states. [2018-01-24 17:19:51,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:19:51,183 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2018-01-24 17:19:51,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:19:51,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 17:19:51,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:19:51,185 INFO L225 Difference]: With dead ends: 80 [2018-01-24 17:19:51,185 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 17:19:51,186 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:19:51,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 17:19:51,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2018-01-24 17:19:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 17:19:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-01-24 17:19:51,197 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 19 [2018-01-24 17:19:51,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:19:51,197 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-01-24 17:19:51,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:19:51,197 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-01-24 17:19:51,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 17:19:51,198 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:19:51,198 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:19:51,198 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:19:51,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1893738511, now seen corresponding path program 1 times [2018-01-24 17:19:51,199 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:19:51,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:19:51,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:19:51,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:19:51,200 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:19:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:19:51,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:19:51,276 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:19:51,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:19:51,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:19:51,276 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:19:51,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:19:51,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:19:51,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:19:51,278 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 5 states. [2018-01-24 17:19:51,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:19:51,323 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2018-01-24 17:19:51,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:19:51,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 17:19:51,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:19:51,325 INFO L225 Difference]: With dead ends: 86 [2018-01-24 17:19:51,325 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 17:19:51,326 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:19:51,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 17:19:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-24 17:19:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 17:19:51,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-01-24 17:19:51,334 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-01-24 17:19:51,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:19:51,334 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-01-24 17:19:51,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:19:51,335 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-01-24 17:19:51,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 17:19:51,335 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:19:51,336 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:19:51,336 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:19:51,336 INFO L82 PathProgramCache]: Analyzing trace with hash 389514349, now seen corresponding path program 1 times [2018-01-24 17:19:51,336 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:19:51,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:19:51,338 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:19:51,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:19:51,338 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:19:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:19:51,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:19:51,399 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:19:51,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:19:51,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:19:51,400 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:19:51,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:19:51,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:19:51,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:19:51,401 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 6 states. [2018-01-24 17:19:51,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:19:51,547 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-24 17:19:51,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:19:51,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 17:19:51,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:19:51,549 INFO L225 Difference]: With dead ends: 50 [2018-01-24 17:19:51,549 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 17:19:51,549 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:19:51,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 17:19:51,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-01-24 17:19:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 17:19:51,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-01-24 17:19:51,556 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2018-01-24 17:19:51,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:19:51,556 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-01-24 17:19:51,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:19:51,556 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-01-24 17:19:51,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 17:19:51,557 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:19:51,557 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:19:51,557 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:19:51,558 INFO L82 PathProgramCache]: Analyzing trace with hash 389514350, now seen corresponding path program 1 times [2018-01-24 17:19:51,558 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:19:51,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:19:51,559 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:19:51,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:19:51,559 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:19:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:19:51,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:19:51,613 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:19:51,613 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:19:51,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:19:51,614 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:19:51,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:19:51,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:19:51,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:19:51,615 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 4 states. [2018-01-24 17:19:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:19:51,641 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2018-01-24 17:19:51,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:19:51,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-24 17:19:51,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:19:51,643 INFO L225 Difference]: With dead ends: 86 [2018-01-24 17:19:51,643 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 17:19:51,644 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:19:51,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 17:19:51,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2018-01-24 17:19:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 17:19:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-01-24 17:19:51,653 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 22 [2018-01-24 17:19:51,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:19:51,653 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-01-24 17:19:51,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:19:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-01-24 17:19:51,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 17:19:51,654 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:19:51,654 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:19:51,655 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:19:51,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1824781139, now seen corresponding path program 1 times [2018-01-24 17:19:51,655 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:19:51,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:19:51,657 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:19:51,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:19:51,657 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:19:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:19:51,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:19:51,735 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:19:51,735 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:19:51,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:19:51,735 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:19:51,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:19:51,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:19:51,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:19:51,736 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 5 states. [2018-01-24 17:19:51,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:19:51,755 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2018-01-24 17:19:51,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:19:51,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-24 17:19:51,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:19:51,758 INFO L225 Difference]: With dead ends: 98 [2018-01-24 17:19:51,758 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 17:19:51,759 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:19:51,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 17:19:51,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2018-01-24 17:19:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 17:19:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-24 17:19:51,767 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 26 [2018-01-24 17:19:51,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:19:51,767 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-24 17:19:51,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:19:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-24 17:19:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:19:51,769 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:19:51,769 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:19:51,769 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:19:51,769 INFO L82 PathProgramCache]: Analyzing trace with hash -85684427, now seen corresponding path program 1 times [2018-01-24 17:19:51,769 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:19:51,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:19:51,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:19:51,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:19:51,771 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:19:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:19:51,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:19:51,955 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:19:51,955 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:19:51,956 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:19:51,957 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 17:19:51,958 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [22], [26], [31], [33], [38], [40], [70], [72], [73], [74], [76], [77], [78], [79] [2018-01-24 17:19:52,011 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:19:52,012 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:19:52,146 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:19:52,148 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:19:52,155 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:19:52,156 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:19:52,156 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:19:52,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:19:52,165 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:19:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:19:52,211 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:19:52,241 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:19:52,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:19:52,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:19:52,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:19:52,292 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:19:52,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:19:52,294 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:19:52,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:19:52,301 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:19:52,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 17:19:52,340 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:19:52,341 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:19:52,677 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:19:52,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:19:52,697 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:19:52,701 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:19:52,702 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:19:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:19:52,737 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:19:52,740 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:19:52,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:19:52,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:19:52,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:19:52,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:19:52,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:19:52,764 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:19:52,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:19:52,770 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:19:52,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 17:19:52,775 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:19:52,775 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:19:53,714 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:19:53,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:19:53,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 16 [2018-01-24 17:19:53,746 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:19:53,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 17:19:53,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 17:19:53,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-01-24 17:19:53,747 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2018-01-24 17:19:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:19:54,061 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-01-24 17:19:54,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:19:54,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-01-24 17:19:54,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:19:54,063 INFO L225 Difference]: With dead ends: 75 [2018-01-24 17:19:54,063 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 17:19:54,063 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 97 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-01-24 17:19:54,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 17:19:54,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 48. [2018-01-24 17:19:54,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 17:19:54,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-01-24 17:19:54,071 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2018-01-24 17:19:54,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:19:54,071 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-01-24 17:19:54,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 17:19:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-01-24 17:19:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:19:54,072 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:19:54,072 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:19:54,072 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:19:54,072 INFO L82 PathProgramCache]: Analyzing trace with hash -85684426, now seen corresponding path program 1 times [2018-01-24 17:19:54,072 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:19:54,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:19:54,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:19:54,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:19:54,074 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:19:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:19:54,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:19:54,493 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:19:54,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:19:54,493 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:19:54,493 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 17:19:54,493 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [22], [26], [31], [33], [38], [41], [70], [72], [73], [74], [76], [77], [78], [79] [2018-01-24 17:19:54,494 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:19:54,494 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:19:54,565 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:19:54,565 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:19:54,567 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:19:54,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:19:54,567 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:19:54,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:19:54,579 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:19:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:19:54,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:19:54,624 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:19:54,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:19:54,642 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:19:54,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:19:54,656 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:19:54,657 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:19:54,658 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:19:54,658 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:19:54,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:19:54,671 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 17:19:54,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:19:54,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:19:54,902 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:19:54,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:19:54,943 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:19:54,944 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:19:54,945 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:19:54,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:19:54,993 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:19:54,993 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:19:54,994 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:19:54,994 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:19:55,034 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:19:55,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:19:55,077 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:19:55,077 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 17:19:55,191 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:19:55,191 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:19:55,406 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 46 DAG size of output 32 [2018-01-24 17:19:55,425 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-24 17:20:09,704 WARN L146 SmtUtils]: Spent 10719ms on a formula simplification. DAG size of input: 80 DAG size of output 29 [2018-01-24 17:20:09,716 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 17:20:12,239 WARN L146 SmtUtils]: Spent 322ms on a formula simplification. DAG size of input: 71 DAG size of output 38 [2018-01-24 17:20:12,517 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:20:12,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:12,532 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-24 17:20:12,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:12,544 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-24 17:20:12,559 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:20:12,560 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:12,564 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:20:12,577 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:20:12,578 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:82, output treesize:15 [2018-01-24 17:20:16,192 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-24 17:20:16,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:16,239 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:20:16,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:16,271 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-24 17:20:16,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-24 17:20:16,317 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:16,329 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:20:16,351 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:20:16,351 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:114, output treesize:53 [2018-01-24 17:20:16,694 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:20:16,714 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:20:16,714 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:20:16,717 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:20:16,717 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:20:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:20:16,752 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:20:16,769 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:20:16,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:16,789 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:20:16,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:16,791 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:20:16,791 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:16,810 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:20:16,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:16,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:20:16,827 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 17:20:16,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:20:16,930 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:20:16,931 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:20:16,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:16,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:20:16,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:20:16,982 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:20:16,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:17,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:20:17,028 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:20:17,028 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:17,077 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:20:17,077 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:20:17,078 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:20:17,078 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:17,111 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:20:17,111 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 17:20:17,163 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:20:17,163 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:20:17,421 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-01-24 17:20:35,768 WARN L146 SmtUtils]: Spent 14128ms on a formula simplification. DAG size of input: 76 DAG size of output 34 [2018-01-24 17:20:35,788 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 50 [2018-01-24 17:20:46,917 WARN L146 SmtUtils]: Spent 8047ms on a formula simplification. DAG size of input: 81 DAG size of output 71 [2018-01-24 17:20:46,922 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 17:20:46,933 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 17:20:47,034 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-24 17:20:47,053 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:20:47,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:47,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:20:47,078 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:20:47,079 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:47,093 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:20:47,094 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:47,106 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:20:47,106 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:82, output treesize:15 [2018-01-24 17:20:57,545 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 55 DAG size of output 47 [2018-01-24 17:20:57,547 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:20:57,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:57,586 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-24 17:20:57,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:57,624 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-24 17:20:57,653 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:20:57,654 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:20:57,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:20:57,689 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:20:57,690 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:114, output treesize:53 [2018-01-24 17:20:59,806 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:20:59,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:20:59,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10, 10, 10] total 29 [2018-01-24 17:20:59,808 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:20:59,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 17:20:59,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 17:20:59,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=776, Unknown=9, NotChecked=0, Total=870 [2018-01-24 17:20:59,809 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 19 states. [2018-01-24 17:21:00,248 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 67 DAG size of output 64 Received shutdown request... [2018-01-24 17:21:04,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:21:04,387 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 17:21:04,390 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 17:21:04,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:21:04 BoogieIcfgContainer [2018-01-24 17:21:04,390 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 17:21:04,391 INFO L168 Benchmark]: Toolchain (without parser) took 74541.49 ms. Allocated memory was 303.0 MB in the beginning and 545.3 MB in the end (delta: 242.2 MB). Free memory was 262.1 MB in the beginning and 486.4 MB in the end (delta: -224.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 5.3 GB. [2018-01-24 17:21:04,391 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:21:04,392 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.92 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 249.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-24 17:21:04,392 INFO L168 Benchmark]: Boogie Preprocessor took 35.71 ms. Allocated memory is still 303.0 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:21:04,392 INFO L168 Benchmark]: RCFGBuilder took 274.27 ms. Allocated memory is still 303.0 MB. Free memory was 247.0 MB in the beginning and 230.2 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 5.3 GB. [2018-01-24 17:21:04,393 INFO L168 Benchmark]: TraceAbstraction took 74003.37 ms. Allocated memory was 303.0 MB in the beginning and 545.3 MB in the end (delta: 242.2 MB). Free memory was 230.2 MB in the beginning and 486.4 MB in the end (delta: -256.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:21:04,394 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 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.92 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 249.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.71 ms. Allocated memory is still 303.0 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 274.27 ms. Allocated memory is still 303.0 MB. Free memory was 247.0 MB in the beginning and 230.2 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 74003.37 ms. Allocated memory was 303.0 MB in the beginning and 545.3 MB in the end (delta: 242.2 MB). Free memory was 230.2 MB in the beginning and 486.4 MB in the end (delta: -256.2 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 124 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 : 40 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.326479 RENAME_VARIABLES(MILLISECONDS) : 0.135304 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.295183 PROJECTAWAY(MILLISECONDS) : 0.067122 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001582 DISJOIN(MILLISECONDS) : 0.603264 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.160342 ADD_EQUALITY(MILLISECONDS) : 0.022342 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.027565 #CONJOIN_DISJUNCTIVE : 44 #RENAME_VARIABLES : 77 #UNFREEZE : 0 #CONJOIN : 76 #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 : 124 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 : 42 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.714206 RENAME_VARIABLES(MILLISECONDS) : 0.241965 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.268984 PROJECTAWAY(MILLISECONDS) : 0.070569 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001257 DISJOIN(MILLISECONDS) : 0.430416 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.284075 ADD_EQUALITY(MILLISECONDS) : 0.032823 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014020 #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: 1458]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1458). Cancelled while BasicCegarLoop was constructing difference of abstraction (48states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (48states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (48states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (48states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (48states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (48states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (48states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 7 error locations. TIMEOUT Result, 73.9s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 5.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 317 SDtfs, 228 SDslu, 910 SDs, 0 SdLazy, 487 SolverSat, 43 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 191 SyntacticMatches, 22 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 65.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 90 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 67.5s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 390 ConstructedInterpolants, 94 QuantifiedInterpolants, 142407 SizeOfPredicates, 24 NumberOfNonLiveVariables, 436 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 25/64 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_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-21-04-403.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-21-04-403.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-21-04-403.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_17-21-04-403.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_17-21-04-403.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_17-21-04-403.csv Completed graceful shutdown