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.epf -i ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:45:11,426 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:45:11,427 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:45:11,442 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:45:11,443 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:45:11,444 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:45:11,445 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:45:11,446 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:45:11,448 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:45:11,449 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:45:11,450 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:45:11,450 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:45:11,451 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:45:11,452 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:45:11,453 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:45:11,455 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:45:11,458 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:45:11,460 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:45:11,461 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:45:11,462 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:45:11,465 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:45:11,465 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:45:11,465 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:45:11,466 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:45:11,467 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:45:11,468 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:45:11,469 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:45:11,469 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:45:11,469 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:45:11,470 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:45:11,470 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:45:11,470 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.epf [2018-01-24 15:45:11,479 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:45:11,479 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:45:11,480 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:45:11,480 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:45:11,480 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:45:11,480 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:45:11,480 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:45:11,481 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:45:11,481 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:45:11,481 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:45:11,481 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:45:11,481 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:45:11,481 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:45:11,482 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:45:11,482 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:45:11,482 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:45:11,482 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:45:11,482 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:45:11,482 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:45:11,482 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:45:11,482 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:45:11,482 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:45:11,483 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:45:11,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:45:11,483 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:45:11,483 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:45:11,484 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:45:11,484 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:45:11,484 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:45:11,484 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:45:11,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:45:11,484 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:45:11,484 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:45:11,485 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:45:11,485 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:45:11,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:45:11,531 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:45:11,535 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:45:11,536 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:45:11,537 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:45:11,537 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-24 15:45:11,682 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:45:11,688 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:45:11,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:45:11,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:45:11,693 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:45:11,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:45:11" (1/1) ... [2018-01-24 15:45:11,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4d08b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:45:11, skipping insertion in model container [2018-01-24 15:45:11,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:45:11" (1/1) ... [2018-01-24 15:45:11,709 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:45:11,746 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:45:11,860 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:45:11,877 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:45:11,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:45:11 WrapperNode [2018-01-24 15:45:11,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:45:11,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:45:11,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:45:11,886 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:45:11,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:45:11" (1/1) ... [2018-01-24 15:45:11,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:45:11" (1/1) ... [2018-01-24 15:45:11,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:45:11" (1/1) ... [2018-01-24 15:45:11,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:45:11" (1/1) ... [2018-01-24 15:45:11,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:45:11" (1/1) ... [2018-01-24 15:45:11,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:45:11" (1/1) ... [2018-01-24 15:45:11,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:45:11" (1/1) ... [2018-01-24 15:45:11,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:45:11,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:45:11,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:45:11,918 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:45:11,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:45:11" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:45:11,972 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:45:11,972 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:45:11,972 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 15:45:11,972 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:45:11,972 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:45:11,973 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:45:11,973 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:45:11,973 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:45:11,973 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:45:11,973 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 15:45:11,973 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 15:45:11,974 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:45:11,974 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 15:45:11,974 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:45:11,974 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:45:11,974 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:45:12,218 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:45:12,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:45:12 BoogieIcfgContainer [2018-01-24 15:45:12,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:45:12,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:45:12,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:45:12,221 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:45:12,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:45:11" (1/3) ... [2018-01-24 15:45:12,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4aa61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:45:12, skipping insertion in model container [2018-01-24 15:45:12,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:45:11" (2/3) ... [2018-01-24 15:45:12,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4aa61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:45:12, skipping insertion in model container [2018-01-24 15:45:12,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:45:12" (3/3) ... [2018-01-24 15:45:12,224 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_1_false-valid-free.i [2018-01-24 15:45:12,230 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:45:12,236 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-24 15:45:12,282 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:45:12,282 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:45:12,283 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:45:12,283 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:45:12,283 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:45:12,283 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:45:12,283 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:45:12,283 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:45:12,284 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:45:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-24 15:45:12,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 15:45:12,311 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:45:12,312 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:45:12,313 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 15:45:12,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1352732268, now seen corresponding path program 1 times [2018-01-24 15:45:12,320 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:45:12,363 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:12,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:45:12,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:12,364 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:45:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:45:12,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:45:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:45:12,451 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:45:12,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:45:12,451 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:45:12,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 15:45:12,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 15:45:12,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 15:45:12,465 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-01-24 15:45:12,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:45:12,489 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-01-24 15:45:12,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 15:45:12,490 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-24 15:45:12,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:45:12,498 INFO L225 Difference]: With dead ends: 103 [2018-01-24 15:45:12,498 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 15:45:12,502 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-24 15:45:12,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 15:45:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 15:45:12,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 15:45:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-01-24 15:45:12,617 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 12 [2018-01-24 15:45:12,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:45:12,618 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-01-24 15:45:12,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 15:45:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-01-24 15:45:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:45:12,619 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:45:12,619 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:45:12,619 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 15:45:12,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920166, now seen corresponding path program 1 times [2018-01-24 15:45:12,620 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:45:12,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:12,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:45:12,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:12,622 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:45:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:45:12,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:45:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:45:12,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:45:12,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:45:12,716 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:45:12,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:45:12,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:45:12,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:45:12,719 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 4 states. [2018-01-24 15:45:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:45:12,848 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-01-24 15:45:12,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:45:12,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 15:45:12,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:45:12,850 INFO L225 Difference]: With dead ends: 53 [2018-01-24 15:45:12,850 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 15:45:12,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-24 15:45:12,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 15:45:12,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 15:45:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 15:45:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-24 15:45:12,859 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 14 [2018-01-24 15:45:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:45:12,859 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-24 15:45:12,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:45:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-24 15:45:12,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:45:12,860 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:45:12,860 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:45:12,860 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 15:45:12,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920165, now seen corresponding path program 1 times [2018-01-24 15:45:12,861 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:45:12,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:12,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:45:12,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:12,862 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:45:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:45:12,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:45:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:45:12,968 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:45:12,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:45:12,968 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:45:12,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:45:12,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:45:12,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:45:12,969 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-01-24 15:45:13,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:45:13,060 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-01-24 15:45:13,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:45:13,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 15:45:13,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:45:13,061 INFO L225 Difference]: With dead ends: 52 [2018-01-24 15:45:13,061 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 15:45:13,062 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-24 15:45:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 15:45:13,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 15:45:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 15:45:13,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-01-24 15:45:13,067 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 14 [2018-01-24 15:45:13,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:45:13,067 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-01-24 15:45:13,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:45:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-01-24 15:45:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 15:45:13,067 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:45:13,068 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:45:13,068 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 15:45:13,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748963, now seen corresponding path program 1 times [2018-01-24 15:45:13,068 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:45:13,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:13,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:45:13,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:13,069 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:45:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:45:13,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:45:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:45:13,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:45:13,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:45:13,149 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:45:13,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:45:13,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:45:13,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:45:13,150 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 6 states. [2018-01-24 15:45:13,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:45:13,287 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-01-24 15:45:13,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:45:13,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-24 15:45:13,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:45:13,288 INFO L225 Difference]: With dead ends: 51 [2018-01-24 15:45:13,288 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 15:45:13,289 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-24 15:45:13,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 15:45:13,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 15:45:13,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 15:45:13,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-01-24 15:45:13,295 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 20 [2018-01-24 15:45:13,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:45:13,296 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-01-24 15:45:13,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:45:13,296 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-01-24 15:45:13,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 15:45:13,296 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:45:13,296 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:45:13,296 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 15:45:13,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748962, now seen corresponding path program 1 times [2018-01-24 15:45:13,297 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:45:13,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:13,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:45:13,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:13,298 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:45:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:45:13,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:45:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:45:13,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:45:13,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:45:13,428 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:45:13,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:45:13,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:45:13,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:45:13,429 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 7 states. [2018-01-24 15:45:13,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:45:13,554 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-01-24 15:45:13,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:45:13,555 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-24 15:45:13,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:45:13,558 INFO L225 Difference]: With dead ends: 85 [2018-01-24 15:45:13,559 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 15:45:13,559 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-24 15:45:13,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 15:45:13,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-01-24 15:45:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 15:45:13,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-24 15:45:13,567 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 20 [2018-01-24 15:45:13,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:45:13,568 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-24 15:45:13,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:45:13,568 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-24 15:45:13,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:45:13,569 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:45:13,569 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-24 15:45:13,569 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 15:45:13,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1905865099, now seen corresponding path program 1 times [2018-01-24 15:45:13,569 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:45:13,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:13,570 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:45:13,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:13,570 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:45:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:45:13,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:45:13,663 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-24 15:45:13,663 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:45:13,664 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:45:13,665 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 15:45:13,667 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-24 15:45:13,717 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:45:13,718 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:45:15,501 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:45:15,502 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-24 15:45:15,519 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:45:15,519 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:45:15,519 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:45:15,535 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:45:15,535 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:45:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:45:15,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:45:15,738 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-24 15:45:15,738 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:45:15,837 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-24 15:45:15,858 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:45:15,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2018-01-24 15:45:15,859 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:45:15,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:45:15,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:45:15,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-24 15:45:15,860 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-01-24 15:45:16,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:45:16,070 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2018-01-24 15:45:16,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:45:16,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-24 15:45:16,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:45:16,074 INFO L225 Difference]: With dead ends: 115 [2018-01-24 15:45:16,074 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 15:45:16,074 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-24 15:45:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 15:45:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2018-01-24 15:45:16,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 15:45:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-01-24 15:45:16,083 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 24 [2018-01-24 15:45:16,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:45:16,084 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-01-24 15:45:16,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:45:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-01-24 15:45:16,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 15:45:16,085 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:45:16,086 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-24 15:45:16,086 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 15:45:16,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1500155222, now seen corresponding path program 1 times [2018-01-24 15:45:16,086 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:45:16,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:16,087 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:45:16,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:16,088 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:45:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:45:16,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:45:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:45:16,433 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:45:16,433 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:45:16,433 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-24 15:45:16,433 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-24 15:45:16,435 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:45:16,435 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:45:19,094 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:45:19,095 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-24 15:45:19,099 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:45:19,099 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:45:19,099 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-24 15:45:19,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:45:19,118 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:45:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:45:19,152 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:45:19,183 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-24 15:45:19,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:45:19,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:45:19,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-24 15:45:19,321 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-24 15:45:19,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:45:19,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 15:45:19,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-01-24 15:45:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:45:19,615 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:45:20,546 WARN L143 SmtUtils]: Spent 318ms on a formula simplification that was a NOOP. DAG size: 17 [2018-01-24 15:45:20,850 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-24 15:45:20,861 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-24 15:45:20,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:45:20,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:45:20,863 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-24 15:45:20,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-01-24 15:45:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:45:20,892 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:45:20,892 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-24 15:45:20,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:45:20,896 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:45:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:45:20,956 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:45:20,966 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-24 15:45:20,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:45:21,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:45:21,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:45:21,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:45:21,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-24 15:45:21,097 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:45:21,098 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-24 15:45:21,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:45:21,127 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:45:21,128 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:45:21,129 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-24 15:45:21,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:45:21,152 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-24 15:45:21,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-01-24 15:45:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:45:21,274 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:45:21,445 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-24 15:45:21,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:45:21,449 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-24 15:45:21,461 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-24 15:45:21,462 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:45:21,463 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:45:21,465 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-24 15:45:21,466 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-01-24 15:45:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:45:21,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:45:21,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 8, 8] total 24 [2018-01-24 15:45:21,481 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:45:21,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 15:45:21,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 15:45:21,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=478, Unknown=2, NotChecked=0, Total=600 [2018-01-24 15:45:21,483 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 13 states. [2018-01-24 15:45:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:45:21,804 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-01-24 15:45:21,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:45:21,805 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-01-24 15:45:21,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:45:21,806 INFO L225 Difference]: With dead ends: 130 [2018-01-24 15:45:21,806 INFO L226 Difference]: Without dead ends: 105 [2018-01-24 15:45:21,807 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-24 15:45:21,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-24 15:45:21,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2018-01-24 15:45:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 15:45:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-01-24 15:45:21,817 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 27 [2018-01-24 15:45:21,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:45:21,818 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-01-24 15:45:21,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 15:45:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-01-24 15:45:21,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:45:21,819 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:45:21,819 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-24 15:45:21,819 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 15:45:21,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1897964650, now seen corresponding path program 1 times [2018-01-24 15:45:21,820 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:45:21,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:21,821 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:45:21,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:21,821 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:45:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:45:21,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:45:21,852 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-24 15:45:21,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:45:21,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:45:21,853 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:45:21,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:45:21,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:45:21,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:45:21,854 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 4 states. [2018-01-24 15:45:21,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:45:21,965 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-01-24 15:45:21,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:45:21,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-24 15:45:21,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:45:21,966 INFO L225 Difference]: With dead ends: 77 [2018-01-24 15:45:21,966 INFO L226 Difference]: Without dead ends: 75 [2018-01-24 15:45:21,966 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-24 15:45:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-24 15:45:21,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-24 15:45:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 15:45:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-01-24 15:45:21,973 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 29 [2018-01-24 15:45:21,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:45:21,973 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-01-24 15:45:21,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:45:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-01-24 15:45:21,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:45:21,975 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:45:21,975 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-24 15:45:21,975 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 15:45:21,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1897964651, now seen corresponding path program 1 times [2018-01-24 15:45:21,975 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:45:21,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:21,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:45:21,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:21,977 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:45:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:45:21,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:45:22,109 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-24 15:45:22,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:45:22,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:45:22,110 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:45:22,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:45:22,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:45:22,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:45:22,111 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 7 states. [2018-01-24 15:45:22,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:45:22,192 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-01-24 15:45:22,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:45:22,194 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-24 15:45:22,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:45:22,195 INFO L225 Difference]: With dead ends: 75 [2018-01-24 15:45:22,195 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 15:45:22,195 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-24 15:45:22,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 15:45:22,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-24 15:45:22,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 15:45:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-01-24 15:45:22,204 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 29 [2018-01-24 15:45:22,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:45:22,205 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-01-24 15:45:22,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:45:22,205 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-01-24 15:45:22,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 15:45:22,206 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:45:22,206 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-24 15:45:22,206 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 15:45:22,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1546437503, now seen corresponding path program 2 times [2018-01-24 15:45:22,207 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:45:22,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:22,208 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:45:22,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:22,208 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:45:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:45:22,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:45:22,298 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-24 15:45:22,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:45:22,298 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:45:22,298 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:45:22,299 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:45:22,299 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:45:22,299 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:45:22,308 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:45:22,308 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:45:22,327 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:45:22,333 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:45:22,335 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:45:22,338 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:45:22,388 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-24 15:45:22,389 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:45:22,445 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-24 15:45:22,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:45:22,479 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-24 15:45:22,484 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:45:22,485 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:45:22,508 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:45:22,537 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:45:22,548 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:45:22,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:45:22,558 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-24 15:45:22,559 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:45:22,583 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-24 15:45:22,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:45:22,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 7, 7] total 15 [2018-01-24 15:45:22,585 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:45:22,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 15:45:22,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 15:45:22,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-01-24 15:45:22,586 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 12 states. [2018-01-24 15:45:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:45:22,774 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2018-01-24 15:45:22,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 15:45:22,775 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-01-24 15:45:22,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:45:22,776 INFO L225 Difference]: With dead ends: 147 [2018-01-24 15:45:22,776 INFO L226 Difference]: Without dead ends: 122 [2018-01-24 15:45:22,776 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 114 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-01-24 15:45:22,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-24 15:45:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2018-01-24 15:45:22,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-24 15:45:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-01-24 15:45:22,788 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 31 [2018-01-24 15:45:22,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:45:22,788 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-01-24 15:45:22,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 15:45:22,788 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-01-24 15:45:22,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 15:45:22,789 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:45:22,790 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-24 15:45:22,790 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 15:45:22,790 INFO L82 PathProgramCache]: Analyzing trace with hash -979522942, now seen corresponding path program 1 times [2018-01-24 15:45:22,790 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:45:22,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:22,791 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:45:22,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:22,791 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:45:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:45:22,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:45:23,045 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-24 15:45:23,045 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:45:23,045 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:45:23,045 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-24 15:45:23,045 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-24 15:45:23,047 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:45:23,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:45:25,360 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:45:25,360 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-24 15:45:25,364 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:45:25,364 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:45:25,364 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-24 15:45:25,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:45:25,370 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:45:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:45:25,401 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:45:25,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:45:25,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:45:25,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:45:25,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 15:45:25,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:45:25,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:45:25,569 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-24 15:45:25,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:45:25,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:45:25,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-01-24 15:45:25,592 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-24 15:45:25,593 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-24 15:45:25,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:45:25,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:45:25,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:45:25,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-01-24 15:45:25,611 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-24 15:45:25,612 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-24 15:45:25,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:45:25,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:45:25,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:45:25,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:8 [2018-01-24 15:45:25,630 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-24 15:45:25,640 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-24 15:45:25,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 15:45:25,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:45:25,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:45:25,650 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-24 15:45:25,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:25 [2018-01-24 15:45:25,675 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-24 15:45:25,681 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-24 15:45:25,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:45:25,686 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-24 15:45:25,686 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:45:25,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:45:25,693 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-24 15:45:25,693 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:36, output treesize:3 [2018-01-24 15:45:25,708 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-24 15:45:25,708 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:45:25,843 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-24 15:45:25,845 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-24 15:45:25,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:45:25,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:45:25,847 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-24 15:45:25,848 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-24 15:45:25,849 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:45:25,850 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:45:25,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 15:45:25,853 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:22, output treesize:13 [2018-01-24 15:45:25,929 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-24 15:45:25,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-24 15:45:25,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 11] total 25 [2018-01-24 15:45:25,950 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:45:25,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:45:25,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:45:25,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=485, Unknown=1, NotChecked=44, Total=600 [2018-01-24 15:45:25,951 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 10 states. [2018-01-24 15:45:26,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:45:26,206 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-01-24 15:45:26,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 15:45:26,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-01-24 15:45:26,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:45:26,207 INFO L225 Difference]: With dead ends: 113 [2018-01-24 15:45:26,207 INFO L226 Difference]: Without dead ends: 109 [2018-01-24 15:45:26,208 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-24 15:45:26,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-24 15:45:26,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2018-01-24 15:45:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 15:45:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2018-01-24 15:45:26,220 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 32 [2018-01-24 15:45:26,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:45:26,220 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2018-01-24 15:45:26,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:45:26,221 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2018-01-24 15:45:26,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 15:45:26,222 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:45:26,222 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-24 15:45:26,222 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 15:45:26,222 INFO L82 PathProgramCache]: Analyzing trace with hash -979514998, now seen corresponding path program 1 times [2018-01-24 15:45:26,223 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:45:26,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:26,223 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:45:26,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:45:26,224 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:45:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 15:45:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 15:45:26,271 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 15:45:26,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:45:26 BoogieIcfgContainer [2018-01-24 15:45:26,312 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:45:26,313 INFO L168 Benchmark]: Toolchain (without parser) took 14629.69 ms. Allocated memory was 305.7 MB in the beginning and 922.2 MB in the end (delta: 616.6 MB). Free memory was 265.6 MB in the beginning and 453.9 MB in the end (delta: -188.4 MB). Peak memory consumption was 428.2 MB. Max. memory is 5.3 GB. [2018-01-24 15:45:26,313 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 305.7 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:45:26,313 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.31 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 254.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:45:26,313 INFO L168 Benchmark]: Boogie Preprocessor took 31.75 ms. Allocated memory is still 305.7 MB. Free memory was 254.5 MB in the beginning and 252.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-24 15:45:26,314 INFO L168 Benchmark]: RCFGBuilder took 300.69 ms. Allocated memory is still 305.7 MB. Free memory was 252.4 MB in the beginning and 234.4 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:45:26,314 INFO L168 Benchmark]: TraceAbstraction took 14092.72 ms. Allocated memory was 305.7 MB in the beginning and 922.2 MB in the end (delta: 616.6 MB). Free memory was 233.4 MB in the beginning and 453.9 MB in the end (delta: -220.5 MB). Peak memory consumption was 396.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:45:26,315 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 305.7 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 197.31 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 254.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.75 ms. Allocated memory is still 305.7 MB. Free memory was 254.5 MB in the beginning and 252.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 300.69 ms. Allocated memory is still 305.7 MB. Free memory was 252.4 MB in the beginning and 234.4 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 14092.72 ms. Allocated memory was 305.7 MB in the beginning and 922.2 MB in the end (delta: 616.6 MB). Free memory was 233.4 MB in the beginning and 453.9 MB in the end (delta: -220.5 MB). Peak memory consumption was 396.0 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) : 7.539525 RENAME_VARIABLES(MILLISECONDS) : 1.315715 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 3.574315 PROJECTAWAY(MILLISECONDS) : 0.095929 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.100350 DISJOIN(MILLISECONDS) : 0.499761 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.353853 ADD_EQUALITY(MILLISECONDS) : 0.059182 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015584 #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) : 5.862069 RENAME_VARIABLES(MILLISECONDS) : 0.867369 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.881931 PROJECTAWAY(MILLISECONDS) : 0.084861 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.055475 DISJOIN(MILLISECONDS) : 0.345089 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.887901 ADD_EQUALITY(MILLISECONDS) : 0.024061 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013881 #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) : 6.812579 RENAME_VARIABLES(MILLISECONDS) : 0.428203 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.755921 PROJECTAWAY(MILLISECONDS) : 20.694497 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.048150 DISJOIN(MILLISECONDS) : 0.662396 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.444420 ADD_EQUALITY(MILLISECONDS) : 0.019892 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012007 #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.0s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 1.7s 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, 6.8s 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.4s 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.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-45-26-325.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-45-26-325.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-45-26-325.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-45-26-325.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-45-26-325.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_15-45-26-325.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_15-45-26-325.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-45-26-325.csv Received shutdown request...