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_smtcomp.epf -i ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:53:56,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:53:56,579 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:53:56,595 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:53:56,595 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:53:56,596 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:53:56,597 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:53:56,599 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:53:56,601 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:53:56,602 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:53:56,603 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:53:56,604 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:53:56,605 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:53:56,606 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:53:56,607 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:53:56,610 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:53:56,613 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:53:56,615 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:53:56,617 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:53:56,618 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:53:56,621 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:53:56,621 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:53:56,621 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:53:56,622 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:53:56,623 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:53:56,625 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:53:56,625 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:53:56,625 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:53:56,626 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:53:56,626 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:53:56,627 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:53:56,627 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_smtcomp.epf [2018-01-25 05:53:56,636 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:53:56,636 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:53:56,637 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:53:56,637 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:53:56,637 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:53:56,637 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:53:56,638 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:53:56,638 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:53:56,638 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:53:56,638 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:53:56,638 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:53:56,638 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:53:56,639 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:53:56,639 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:53:56,639 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:53:56,639 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:53:56,639 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:53:56,639 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:53:56,639 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:53:56,640 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:53:56,640 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:53:56,640 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:53:56,640 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:53:56,640 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:53:56,640 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:53:56,641 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:53:56,641 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:53:56,641 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:53:56,641 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:53:56,641 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:53:56,641 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:53:56,641 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:53:56,642 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:53:56,642 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:53:56,642 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:53:56,643 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:53:56,677 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:53:56,687 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:53:56,691 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:53:56,692 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:53:56,692 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:53:56,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-free.i [2018-01-25 05:53:56,864 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:53:56,869 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:53:56,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:53:56,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:53:56,875 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:53:56,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:53:56" (1/1) ... [2018-01-25 05:53:56,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@723e0caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:53:56, skipping insertion in model container [2018-01-25 05:53:56,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:53:56" (1/1) ... [2018-01-25 05:53:56,893 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:53:56,932 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:53:57,049 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:53:57,068 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:53:57,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:53:57 WrapperNode [2018-01-25 05:53:57,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:53:57,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:53:57,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:53:57,078 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:53:57,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:53:57" (1/1) ... [2018-01-25 05:53:57,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:53:57" (1/1) ... [2018-01-25 05:53:57,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:53:57" (1/1) ... [2018-01-25 05:53:57,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:53:57" (1/1) ... [2018-01-25 05:53:57,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:53:57" (1/1) ... [2018-01-25 05:53:57,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:53:57" (1/1) ... [2018-01-25 05:53:57,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:53:57" (1/1) ... [2018-01-25 05:53:57,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:53:57,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:53:57,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:53:57,109 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:53:57,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:53:57" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:53:57,158 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:53:57,158 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:53:57,158 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-25 05:53:57,158 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:53:57,159 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:53:57,159 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:53:57,159 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:53:57,159 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:53:57,159 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:53:57,159 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:53:57,160 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:53:57,160 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:53:57,160 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-25 05:53:57,160 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:53:57,160 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:53:57,160 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:53:57,358 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:53:57,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:53:57 BoogieIcfgContainer [2018-01-25 05:53:57,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:53:57,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:53:57,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:53:57,363 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:53:57,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:53:56" (1/3) ... [2018-01-25 05:53:57,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9dcc91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:53:57, skipping insertion in model container [2018-01-25 05:53:57,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:53:57" (2/3) ... [2018-01-25 05:53:57,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9dcc91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:53:57, skipping insertion in model container [2018-01-25 05:53:57,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:53:57" (3/3) ... [2018-01-25 05:53:57,367 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_1_false-valid-free.i [2018-01-25 05:53:57,378 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:53:57,386 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-25 05:53:57,425 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:53:57,425 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:53:57,426 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:53:57,426 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:53:57,426 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:53:57,426 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:53:57,426 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:53:57,426 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:53:57,427 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:53:57,450 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-25 05:53:57,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 05:53:57,457 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:53:57,457 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:53:57,458 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:53:57,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1352732268, now seen corresponding path program 1 times [2018-01-25 05:53:57,464 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:53:57,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:53:57,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:53:57,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:53:57,506 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:53:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:53:57,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:53:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:53:57,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:53:57,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:53:57,597 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:53:57,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 05:53:57,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 05:53:57,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:53:57,613 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-01-25 05:53:57,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:53:57,638 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-01-25 05:53:57,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 05:53:57,640 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-25 05:53:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:53:57,650 INFO L225 Difference]: With dead ends: 103 [2018-01-25 05:53:57,651 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 05:53:57,655 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:53:57,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 05:53:57,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-25 05:53:57,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 05:53:57,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-01-25 05:53:57,766 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 12 [2018-01-25 05:53:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:53:57,767 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-01-25 05:53:57,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 05:53:57,767 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-01-25 05:53:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:53:57,768 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:53:57,768 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:53:57,768 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:53:57,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920166, now seen corresponding path program 1 times [2018-01-25 05:53:57,768 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:53:57,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:53:57,770 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:53:57,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:53:57,770 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:53:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:53:57,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:53:57,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:53:57,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:53:57,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:53:57,869 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:53:57,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:53:57,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:53:57,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:53:57,871 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 4 states. [2018-01-25 05:53:57,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:53:57,996 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-01-25 05:53:57,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:53:57,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:53:57,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:53:57,998 INFO L225 Difference]: With dead ends: 53 [2018-01-25 05:53:57,998 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 05:53:57,999 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:53:58,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 05:53:58,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 05:53:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 05:53:58,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-25 05:53:58,006 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 14 [2018-01-25 05:53:58,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:53:58,006 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-25 05:53:58,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:53:58,007 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-25 05:53:58,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:53:58,007 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:53:58,007 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:53:58,008 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:53:58,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920165, now seen corresponding path program 1 times [2018-01-25 05:53:58,008 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:53:58,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:53:58,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:53:58,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:53:58,010 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:53:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:53:58,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:53:58,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:53:58,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:53:58,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:53:58,108 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:53:58,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:53:58,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:53:58,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:53:58,109 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-01-25 05:53:58,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:53:58,208 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-01-25 05:53:58,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:53:58,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 05:53:58,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:53:58,210 INFO L225 Difference]: With dead ends: 52 [2018-01-25 05:53:58,210 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 05:53:58,211 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:53:58,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 05:53:58,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 05:53:58,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 05:53:58,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-01-25 05:53:58,218 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 14 [2018-01-25 05:53:58,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:53:58,218 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-01-25 05:53:58,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:53:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-01-25 05:53:58,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:53:58,219 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:53:58,220 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-25 05:53:58,220 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:53:58,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748963, now seen corresponding path program 1 times [2018-01-25 05:53:58,220 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:53:58,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:53:58,221 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:53:58,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:53:58,222 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:53:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:53:58,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:53:58,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:53:58,329 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:53:58,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:53:58,329 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:53:58,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:53:58,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:53:58,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:53:58,330 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 6 states. [2018-01-25 05:53:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:53:58,497 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-01-25 05:53:58,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:53:58,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-25 05:53:58,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:53:58,498 INFO L225 Difference]: With dead ends: 51 [2018-01-25 05:53:58,498 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 05:53:58,498 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:53:58,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 05:53:58,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 05:53:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 05:53:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-01-25 05:53:58,503 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 20 [2018-01-25 05:53:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:53:58,503 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-01-25 05:53:58,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:53:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-01-25 05:53:58,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:53:58,504 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:53:58,504 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-25 05:53:58,504 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:53:58,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748962, now seen corresponding path program 1 times [2018-01-25 05:53:58,504 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:53:58,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:53:58,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:53:58,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:53:58,505 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:53:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:53:58,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:53:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:53:58,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:53:58,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:53:58,634 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:53:58,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:53:58,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:53:58,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:53:58,635 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 7 states. [2018-01-25 05:53:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:53:58,756 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-01-25 05:53:58,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:53:58,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-25 05:53:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:53:58,761 INFO L225 Difference]: With dead ends: 85 [2018-01-25 05:53:58,761 INFO L226 Difference]: Without dead ends: 58 [2018-01-25 05:53:58,762 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:53:58,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-25 05:53:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-01-25 05:53:58,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 05:53:58,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-25 05:53:58,770 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 20 [2018-01-25 05:53:58,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:53:58,771 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-25 05:53:58,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:53:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-25 05:53:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:53:58,772 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:53:58,772 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] [2018-01-25 05:53:58,772 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:53:58,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1905865099, now seen corresponding path program 1 times [2018-01-25 05:53:58,773 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:53:58,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:53:58,773 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:53:58,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:53:58,774 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:53:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:53:58,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:53:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:53:58,870 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:53:58,870 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:53:58,871 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 05:53:58,874 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [16], [42], [46], [48], [51], [57], [58], [59], [60], [61], [64], [90], [91], [92], [94] [2018-01-25 05:53:58,926 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:53:58,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:54:00,846 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:54:00,848 INFO L268 AbstractInterpreter]: Visited 22 different actions 31 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-01-25 05:54:00,896 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:54:00,897 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:00,897 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:54:00,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:00,907 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:54:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:00,951 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:54:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:00,997 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:54:01,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:01,078 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:54:01,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2018-01-25 05:54:01,079 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:01,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:54:01,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:54:01,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:54:01,080 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-01-25 05:54:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:01,252 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2018-01-25 05:54:01,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:54:01,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-25 05:54:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:01,254 INFO L225 Difference]: With dead ends: 115 [2018-01-25 05:54:01,255 INFO L226 Difference]: Without dead ends: 86 [2018-01-25 05:54:01,255 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:54:01,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-25 05:54:01,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2018-01-25 05:54:01,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-25 05:54:01,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-01-25 05:54:01,265 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 24 [2018-01-25 05:54:01,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:01,265 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-01-25 05:54:01,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:54:01,265 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-01-25 05:54:01,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:54:01,267 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:01,267 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:01,267 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:54:01,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1500155222, now seen corresponding path program 1 times [2018-01-25 05:54:01,268 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:01,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:01,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:01,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:01,269 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:01,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:01,542 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-25 05:54:01,542 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:01,543 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:54:01,543 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-25 05:54:01,543 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [16], [42], [46], [48], [51], [53], [57], [58], [59], [60], [61], [64], [90], [91], [92], [94] [2018-01-25 05:54:01,545 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:54:01,545 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:54:03,837 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:54:03,837 INFO L268 AbstractInterpreter]: Visited 23 different actions 58 times. Merged at 15 different actions 28 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-01-25 05:54:03,844 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:54:03,844 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:03,844 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:54:03,859 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:03,859 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:54:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:03,895 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:54:03,931 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 8 treesize of output 7 [2018-01-25 05:54:03,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:03,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:03,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-25 05:54:04,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-25 05:54:04,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:04,083 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-25 05:54:04,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-01-25 05:54:04,352 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-25 05:54:04,353 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:54:05,133 WARN L143 SmtUtils]: Spent 272ms on a formula simplification that was a NOOP. DAG size: 17 [2018-01-25 05:54:05,515 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-01-25 05:54:05,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-25 05:54:05,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:05,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:05,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:05,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-01-25 05:54:05,618 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-25 05:54:05,639 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:05,639 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 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 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:54:05,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:05,662 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:54:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:05,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:54:05,730 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 8 treesize of output 7 [2018-01-25 05:54:05,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:05,779 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-25 05:54:05,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:05,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:05,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-25 05:54:05,872 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:54:05,873 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 16 treesize of output 19 [2018-01-25 05:54:05,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:05,939 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:54:05,940 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:54:05,941 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 11 treesize of output 4 [2018-01-25 05:54:05,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:05,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 05:54:05,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-01-25 05:54:06,154 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-25 05:54:06,154 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:54:06,288 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 10 treesize of output 3 [2018-01-25 05:54:06,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:06,301 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 15 treesize of output 19 [2018-01-25 05:54:06,318 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 8 treesize of output 1 [2018-01-25 05:54:06,319 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:06,320 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:06,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:06,322 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-01-25 05:54:06,329 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-25 05:54:06,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:54:06,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 8, 8] total 24 [2018-01-25 05:54:06,331 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:54:06,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 05:54:06,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 05:54:06,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=478, Unknown=2, NotChecked=0, Total=600 [2018-01-25 05:54:06,333 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 13 states. [2018-01-25 05:54:06,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:06,681 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-01-25 05:54:06,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:54:06,682 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-01-25 05:54:06,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:06,683 INFO L225 Difference]: With dead ends: 130 [2018-01-25 05:54:06,683 INFO L226 Difference]: Without dead ends: 105 [2018-01-25 05:54:06,683 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 85 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=159, Invalid=595, Unknown=2, NotChecked=0, Total=756 [2018-01-25 05:54:06,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-25 05:54:06,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2018-01-25 05:54:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-25 05:54:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-01-25 05:54:06,691 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 27 [2018-01-25 05:54:06,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:06,692 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-01-25 05:54:06,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 05:54:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-01-25 05:54:06,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:54:06,692 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:06,692 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:06,693 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:54:06,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1897964650, now seen corresponding path program 1 times [2018-01-25 05:54:06,693 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:06,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:06,694 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:06,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:06,694 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:06,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:06,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 05:54:06,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:06,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:54:06,760 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:06,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:54:06,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:54:06,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:54:06,761 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 4 states. [2018-01-25 05:54:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:06,849 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-01-25 05:54:06,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:54:06,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-25 05:54:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:06,850 INFO L225 Difference]: With dead ends: 77 [2018-01-25 05:54:06,850 INFO L226 Difference]: Without dead ends: 75 [2018-01-25 05:54:06,851 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:54:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-25 05:54:06,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-25 05:54:06,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-25 05:54:06,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-01-25 05:54:06,864 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 29 [2018-01-25 05:54:06,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:06,864 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-01-25 05:54:06,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:54:06,864 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-01-25 05:54:06,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:54:06,865 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:06,865 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:06,866 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:54:06,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1897964651, now seen corresponding path program 1 times [2018-01-25 05:54:06,866 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:06,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:06,867 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:06,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:06,867 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:06,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 05:54:07,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:07,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:54:07,001 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:07,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:54:07,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:54:07,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:54:07,002 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 7 states. [2018-01-25 05:54:07,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:07,150 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-01-25 05:54:07,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:54:07,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-25 05:54:07,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:07,153 INFO L225 Difference]: With dead ends: 75 [2018-01-25 05:54:07,153 INFO L226 Difference]: Without dead ends: 71 [2018-01-25 05:54:07,153 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:54:07,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-25 05:54:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-25 05:54:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-25 05:54:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-01-25 05:54:07,163 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 29 [2018-01-25 05:54:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:07,163 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-01-25 05:54:07,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:54:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-01-25 05:54:07,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 05:54:07,165 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:07,165 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:07,165 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:54:07,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1546437503, now seen corresponding path program 2 times [2018-01-25 05:54:07,165 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:07,166 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:07,166 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:07,166 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:07,167 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:07,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:07,335 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:07,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:07,336 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:54:07,336 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:54:07,336 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:54:07,336 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:07,336 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:54:07,343 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:54:07,343 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:54:07,359 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:54:07,365 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:54:07,366 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:54:07,368 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:54:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:07,464 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:54:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:07,519 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:07,519 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 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 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:54:07,523 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:54:07,523 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:54:07,542 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:54:07,569 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:54:07,579 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:54:07,584 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:54:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:07,589 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:54:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:07,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:54:07,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 7, 7] total 15 [2018-01-25 05:54:07,601 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:54:07,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 05:54:07,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 05:54:07,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:54:07,602 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 12 states. [2018-01-25 05:54:07,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:07,789 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2018-01-25 05:54:07,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:54:07,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-01-25 05:54:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:07,790 INFO L225 Difference]: With dead ends: 147 [2018-01-25 05:54:07,790 INFO L226 Difference]: Without dead ends: 122 [2018-01-25 05:54:07,791 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 114 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-01-25 05:54:07,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-25 05:54:07,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2018-01-25 05:54:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-25 05:54:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-01-25 05:54:07,802 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 31 [2018-01-25 05:54:07,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:07,802 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-01-25 05:54:07,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 05:54:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-01-25 05:54:07,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 05:54:07,804 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:07,804 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:07,804 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:54:07,804 INFO L82 PathProgramCache]: Analyzing trace with hash -979522942, now seen corresponding path program 1 times [2018-01-25 05:54:07,804 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:07,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:07,805 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:54:07,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:07,806 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:07,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:08,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:08,134 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:08,134 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:54:08,135 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-25 05:54:08,135 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [12], [16], [20], [24], [27], [38], [42], [46], [48], [51], [57], [58], [59], [60], [61], [64], [66], [71], [72], [76], [90], [91], [92], [94], [95] [2018-01-25 05:54:08,136 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:54:08,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:54:10,930 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:54:10,930 INFO L268 AbstractInterpreter]: Visited 31 different actions 53 times. Merged at 12 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 28 variables. [2018-01-25 05:54:10,971 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:54:10,971 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:10,971 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:54:10,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:10,976 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:54:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:10,994 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:54:10,997 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-25 05:54:10,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:10,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:10,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-25 05:54:11,025 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:54:11,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:54:11,026 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 11 treesize of output 4 [2018-01-25 05:54:11,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:11,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:11,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-01-25 05:54:11,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-25 05:54:11,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-25 05:54:11,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:11,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:11,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:11,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-01-25 05:54:11,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-01-25 05:54:11,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-25 05:54:11,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:11,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:11,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:11,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:8 [2018-01-25 05:54:11,089 WARN L1029 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((foo_~i~4 Int)) (= (store |c_old(#memory_int)| c_~a.base (store (select |c_old(#memory_int)| c_~a.base) (+ c_~a.offset (* 4 foo_~i~4)) (- 1))) |c_#memory_int|))) is different from true [2018-01-25 05:54:11,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-25 05:54:11,105 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 12 treesize of output 11 [2018-01-25 05:54:11,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:11,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:11,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-25 05:54:11,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:25 [2018-01-25 05:54:11,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-01-25 05:54:11,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-25 05:54:11,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:11,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-25 05:54:11,148 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:11,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:11,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:11,151 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:36, output treesize:3 [2018-01-25 05:54:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-25 05:54:11,166 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:54:11,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 05:54:11,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-01-25 05:54:11,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:11,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:11,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-01-25 05:54:11,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-01-25 05:54:11,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:11,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:11,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:54:11,311 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:22, output treesize:13 [2018-01-25 05:54:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 05:54:11,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-25 05:54:11,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 11] total 25 [2018-01-25 05:54:11,373 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:11,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:54:11,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:54:11,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=485, Unknown=1, NotChecked=44, Total=600 [2018-01-25 05:54:11,374 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 10 states. [2018-01-25 05:54:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:11,640 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-01-25 05:54:11,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:54:11,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-01-25 05:54:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:11,642 INFO L225 Difference]: With dead ends: 113 [2018-01-25 05:54:11,642 INFO L226 Difference]: Without dead ends: 109 [2018-01-25 05:54:11,643 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=911, Unknown=1, NotChecked=62, Total=1122 [2018-01-25 05:54:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-25 05:54:11,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2018-01-25 05:54:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-25 05:54:11,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2018-01-25 05:54:11,655 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 32 [2018-01-25 05:54:11,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:11,655 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2018-01-25 05:54:11,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:54:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2018-01-25 05:54:11,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 05:54:11,657 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:11,657 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:11,657 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:54:11,657 INFO L82 PathProgramCache]: Analyzing trace with hash -979514998, now seen corresponding path program 1 times [2018-01-25 05:54:11,658 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:11,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:11,658 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:11,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:11,659 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 05:54:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 05:54:11,706 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-25 05:54:11,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:54:11 BoogieIcfgContainer [2018-01-25 05:54:11,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:54:11,753 INFO L168 Benchmark]: Toolchain (without parser) took 14888.41 ms. Allocated memory was 307.2 MB in the beginning and 860.9 MB in the end (delta: 553.6 MB). Free memory was 266.3 MB in the beginning and 626.0 MB in the end (delta: -359.7 MB). Peak memory consumption was 194.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:54:11,754 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 307.2 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:54:11,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.83 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 256.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:54:11,754 INFO L168 Benchmark]: Boogie Preprocessor took 30.74 ms. Allocated memory is still 307.2 MB. Free memory was 256.3 MB in the beginning and 254.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:54:11,755 INFO L168 Benchmark]: RCFGBuilder took 250.36 ms. Allocated memory is still 307.2 MB. Free memory was 254.3 MB in the beginning and 235.8 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. [2018-01-25 05:54:11,755 INFO L168 Benchmark]: TraceAbstraction took 14391.62 ms. Allocated memory was 307.2 MB in the beginning and 860.9 MB in the end (delta: 553.6 MB). Free memory was 235.8 MB in the beginning and 626.0 MB in the end (delta: -390.2 MB). Peak memory consumption was 163.5 MB. Max. memory is 5.3 GB. [2018-01-25 05:54:11,757 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 307.2 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 207.83 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 256.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.74 ms. Allocated memory is still 307.2 MB. Free memory was 256.3 MB in the beginning and 254.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 250.36 ms. Allocated memory is still 307.2 MB. Free memory was 254.3 MB in the beginning and 235.8 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 14391.62 ms. Allocated memory was 307.2 MB in the beginning and 860.9 MB in the end (delta: 553.6 MB). Free memory was 235.8 MB in the beginning and 626.0 MB in the end (delta: -390.2 MB). Peak memory consumption was 163.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 321 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 67 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 11.749230 RENAME_VARIABLES(MILLISECONDS) : 1.739562 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 5.770534 PROJECTAWAY(MILLISECONDS) : 0.150080 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.089504 DISJOIN(MILLISECONDS) : 0.675782 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.791898 ADD_EQUALITY(MILLISECONDS) : 0.048462 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016196 #CONJOIN_DISJUNCTIVE : 52 #RENAME_VARIABLES : 95 #UNFREEZE : 0 #CONJOIN : 112 #PROJECTAWAY : 80 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 89 #ADD_EQUALITY : 69 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 312 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 6.378447 RENAME_VARIABLES(MILLISECONDS) : 0.926978 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 3.160776 PROJECTAWAY(MILLISECONDS) : 0.096440 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.045144 DISJOIN(MILLISECONDS) : 0.352744 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.954803 ADD_EQUALITY(MILLISECONDS) : 0.018931 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014612 #CONJOIN_DISJUNCTIVE : 89 #RENAME_VARIABLES : 175 #UNFREEZE : 0 #CONJOIN : 158 #PROJECTAWAY : 124 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 24 #RENAME_VARIABLES_DISJUNCTIVE : 163 #ADD_EQUALITY : 70 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 30 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 492 LocStat_NO_SUPPORTING_DISEQUALITIES : 71 LocStat_NO_DISJUNCTIONS : -60 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 37 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 84 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 13.736832 RENAME_VARIABLES(MILLISECONDS) : 0.514883 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.691558 PROJECTAWAY(MILLISECONDS) : 19.071618 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.064555 DISJOIN(MILLISECONDS) : 0.501873 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.531861 ADD_EQUALITY(MILLISECONDS) : 0.024539 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009537 #CONJOIN_DISJUNCTIVE : 86 #RENAME_VARIABLES : 175 #UNFREEZE : 0 #CONJOIN : 192 #PROJECTAWAY : 138 #ADD_WEAK_EQUALITY : 10 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 168 #ADD_EQUALITY : 78 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L619] int *a, *b; [L620] int n; VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=0] [L632] n = 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=1] [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc(n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, malloc(n * sizeof(*a))={7:0}, n=1] [L636] a = malloc(n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc(n * sizeof(*a))={7:0}, n=1] [L637] EXPR, FCALL malloc(n * sizeof(*b)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L637] b = malloc(n * sizeof(*b)) [L638] EXPR b++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L638] FCALL *b++ = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L639] CALL foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, n=1] [L624] int i; [L625] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L626] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L625] COND FALSE !(i < n) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L627] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L627] COND FALSE, RET !(i < n - 1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L639] foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L640] FCALL b[-1] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b[-1]=0, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L640] COND FALSE !(b[-1]) [L643] FCALL free(a) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L643] FCALL free(b) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 56 locations, 17 error locations. UNSAFE Result, 14.3s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 434 SDtfs, 846 SDslu, 797 SDs, 0 SdLazy, 836 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 436 GetRequests, 299 SyntacticMatches, 20 SemanticMatches, 117 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.1s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 79 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 573 ConstructedInterpolants, 37 QuantifiedInterpolants, 107026 SizeOfPredicates, 32 NumberOfNonLiveVariables, 856 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 23 InterpolantComputations, 10 PerfectInterpolantSequences, 73/114 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-54-11-767.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-54-11-767.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-54-11-767.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-54-11-767.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-54-11-767.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_05-54-11-767.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_05-54-11-767.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-54-11-767.csv Received shutdown request...