java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:15:37,506 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:15:37,508 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:15:37,523 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:15:37,523 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:15:37,524 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:15:37,525 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:15:37,526 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:15:37,528 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:15:37,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:15:37,530 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:15:37,530 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:15:37,531 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:15:37,532 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:15:37,533 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:15:37,536 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:15:37,538 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:15:37,540 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:15:37,541 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:15:37,543 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:15:37,545 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:15:37,545 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:15:37,545 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:15:37,546 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:15:37,547 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:15:37,549 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:15:37,549 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:15:37,549 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:15:37,550 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:15:37,550 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:15:37,550 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:15:37,551 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 17:15:37,560 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:15:37,560 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:15:37,560 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:15:37,561 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:15:37,561 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:15:37,561 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:15:37,561 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:15:37,561 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:15:37,561 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:15:37,562 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:15:37,562 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:15:37,562 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:15:37,562 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:15:37,562 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:15:37,562 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:15:37,562 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:15:37,563 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:15:37,563 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:15:37,563 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:15:37,563 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:15:37,563 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:15:37,563 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:15:37,563 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:15:37,564 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:15:37,564 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:15:37,564 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:15:37,564 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:15:37,564 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:15:37,565 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:15:37,565 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:15:37,565 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:15:37,565 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:15:37,565 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:15:37,565 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:15:37,566 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:15:37,566 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:15:37,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:15:37,609 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:15:37,612 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:15:37,613 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:15:37,613 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:15:37,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-01-24 17:15:37,703 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:15:37,709 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:15:37,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:15:37,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:15:37,739 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:15:37,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:15:37" (1/1) ... [2018-01-24 17:15:37,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a33d6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:37, skipping insertion in model container [2018-01-24 17:15:37,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:15:37" (1/1) ... [2018-01-24 17:15:37,757 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:15:37,771 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:15:37,885 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:15:37,902 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:15:37,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:37 WrapperNode [2018-01-24 17:15:37,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:15:37,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:15:37,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:15:37,910 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:15:37,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:37" (1/1) ... [2018-01-24 17:15:37,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:37" (1/1) ... [2018-01-24 17:15:37,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:37" (1/1) ... [2018-01-24 17:15:37,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:37" (1/1) ... [2018-01-24 17:15:37,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:37" (1/1) ... [2018-01-24 17:15:37,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:37" (1/1) ... [2018-01-24 17:15:37,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:37" (1/1) ... [2018-01-24 17:15:37,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:15:37,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:15:37,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:15:37,945 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:15:37,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:37" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:15:37,997 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:15:37,997 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:15:37,998 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 17:15:37,998 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:15:37,998 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 17:15:37,998 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 17:15:37,998 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:15:37,998 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:15:37,999 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:15:37,999 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 17:15:37,999 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:15:37,999 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:15:37,999 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:15:38,228 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:15:38,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:15:38 BoogieIcfgContainer [2018-01-24 17:15:38,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:15:38,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:15:38,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:15:38,231 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:15:38,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:15:37" (1/3) ... [2018-01-24 17:15:38,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f377de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:15:38, skipping insertion in model container [2018-01-24 17:15:38,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:37" (2/3) ... [2018-01-24 17:15:38,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f377de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:15:38, skipping insertion in model container [2018-01-24 17:15:38,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:15:38" (3/3) ... [2018-01-24 17:15:38,235 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-01-24 17:15:38,241 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:15:38,247 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-01-24 17:15:38,281 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:15:38,281 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:15:38,281 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:15:38,281 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:15:38,281 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:15:38,281 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:15:38,281 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:15:38,281 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:15:38,282 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:15:38,300 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-24 17:15:38,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 17:15:38,305 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:38,306 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:15:38,307 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 17:15:38,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1202729229, now seen corresponding path program 1 times [2018-01-24 17:15:38,313 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:38,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:38,353 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:38,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:38,353 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:38,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:15:38,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:15:38,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:15:38,432 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:15:38,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 17:15:38,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 17:15:38,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 17:15:38,448 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-01-24 17:15:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:38,473 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-01-24 17:15:38,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 17:15:38,474 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-01-24 17:15:38,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:38,482 INFO L225 Difference]: With dead ends: 90 [2018-01-24 17:15:38,482 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 17:15:38,486 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 17:15:38,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 17:15:38,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 17:15:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 17:15:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-24 17:15:38,518 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 13 [2018-01-24 17:15:38,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:38,519 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-24 17:15:38,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 17:15:38,519 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-24 17:15:38,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 17:15:38,519 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:38,520 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:15:38,520 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 17:15:38,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1812590093, now seen corresponding path program 1 times [2018-01-24 17:15:38,520 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:38,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:38,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:38,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:38,522 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:38,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:15:38,580 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:15:38,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:15:38,581 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:15:38,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:15:38,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:15:38,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:15:38,583 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 3 states. [2018-01-24 17:15:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:38,741 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-01-24 17:15:38,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:15:38,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-24 17:15:38,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:38,744 INFO L225 Difference]: With dead ends: 83 [2018-01-24 17:15:38,745 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 17:15:38,745 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:15:38,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 17:15:38,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2018-01-24 17:15:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 17:15:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-24 17:15:38,756 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 14 [2018-01-24 17:15:38,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:38,757 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-24 17:15:38,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:15:38,757 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-24 17:15:38,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 17:15:38,758 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:38,758 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:15:38,758 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 17:15:38,758 INFO L82 PathProgramCache]: Analyzing trace with hash -267768884, now seen corresponding path program 1 times [2018-01-24 17:15:38,759 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:38,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:38,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:38,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:38,760 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:38,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:15:38,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:15:38,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:15:38,867 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:15:38,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:15:38,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:15:38,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:15:38,868 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 5 states. [2018-01-24 17:15:38,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:38,993 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2018-01-24 17:15:38,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:15:38,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 17:15:38,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:38,996 INFO L225 Difference]: With dead ends: 113 [2018-01-24 17:15:38,996 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 17:15:38,997 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:15:38,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 17:15:39,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2018-01-24 17:15:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 17:15:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-01-24 17:15:39,004 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 15 [2018-01-24 17:15:39,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:39,004 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-01-24 17:15:39,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:15:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-01-24 17:15:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 17:15:39,005 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:39,005 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:15:39,005 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 17:15:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181562, now seen corresponding path program 1 times [2018-01-24 17:15:39,006 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:39,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:39,007 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:39,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:39,007 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:39,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:15:39,047 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:15:39,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:15:39,048 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:15:39,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:15:39,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:15:39,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:15:39,049 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 3 states. [2018-01-24 17:15:39,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:39,076 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-01-24 17:15:39,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:15:39,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-01-24 17:15:39,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:39,079 INFO L225 Difference]: With dead ends: 57 [2018-01-24 17:15:39,079 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 17:15:39,080 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:15:39,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 17:15:39,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-24 17:15:39,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 17:15:39,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-24 17:15:39,088 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 19 [2018-01-24 17:15:39,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:39,088 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-24 17:15:39,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:15:39,088 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-24 17:15:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 17:15:39,089 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:39,089 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:15:39,089 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 17:15:39,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181563, now seen corresponding path program 1 times [2018-01-24 17:15:39,090 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:39,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:39,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:39,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:39,091 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:39,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:15:39,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:15:39,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:15:39,188 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:15:39,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:15:39,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:15:39,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:15:39,189 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2018-01-24 17:15:39,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:39,281 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-24 17:15:39,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:15:39,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-24 17:15:39,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:39,282 INFO L225 Difference]: With dead ends: 67 [2018-01-24 17:15:39,282 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 17:15:39,283 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:15:39,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 17:15:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-01-24 17:15:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 17:15:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-01-24 17:15:39,296 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 19 [2018-01-24 17:15:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:39,296 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-01-24 17:15:39,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:15:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-01-24 17:15:39,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:15:39,297 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:39,297 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:15:39,297 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 17:15:39,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2060273317, now seen corresponding path program 1 times [2018-01-24 17:15:39,297 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:39,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:39,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:39,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:39,298 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:39,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 17:15:39,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:15:39,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:15:39,363 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:15:39,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:15:39,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:15:39,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:15:39,364 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-01-24 17:15:39,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:39,421 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-01-24 17:15:39,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:15:39,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-24 17:15:39,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:39,422 INFO L225 Difference]: With dead ends: 70 [2018-01-24 17:15:39,423 INFO L226 Difference]: Without dead ends: 69 [2018-01-24 17:15:39,423 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 17:15:39,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-24 17:15:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-01-24 17:15:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 17:15:39,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-24 17:15:39,432 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 28 [2018-01-24 17:15:39,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:39,433 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-24 17:15:39,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:15:39,433 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-24 17:15:39,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 17:15:39,434 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:39,435 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:15:39,435 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 17:15:39,435 INFO L82 PathProgramCache]: Analyzing trace with hash 556036660, now seen corresponding path program 1 times [2018-01-24 17:15:39,435 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:39,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:39,437 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:39,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:39,437 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:39,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:15:39,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:39,626 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:15:39,626 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 17:15:39,628 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [16], [23], [24], [28], [29], [30], [34], [39], [41], [42], [45], [47], [82], [83], [84], [86], [87] [2018-01-24 17:15:39,673 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:15:39,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:15:39,846 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:15:39,847 INFO L268 AbstractInterpreter]: Visited 24 different actions 40 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-01-24 17:15:39,862 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:15:39,862 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:39,862 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:15:39,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:39,874 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:15:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:39,903 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:39,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:15:39,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:15:39,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:15:39,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 17:15:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 17:15:40,000 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 17:15:40,101 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:15:40,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [7] total 12 [2018-01-24 17:15:40,101 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:15:40,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:15:40,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:15:40,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:15:40,102 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 6 states. [2018-01-24 17:15:40,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:40,174 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-01-24 17:15:40,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:15:40,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-24 17:15:40,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:40,175 INFO L225 Difference]: With dead ends: 69 [2018-01-24 17:15:40,175 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 17:15:40,176 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-01-24 17:15:40,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 17:15:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2018-01-24 17:15:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 17:15:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-01-24 17:15:40,183 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 29 [2018-01-24 17:15:40,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:40,183 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-01-24 17:15:40,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:15:40,184 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-01-24 17:15:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 17:15:40,184 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:40,184 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:15:40,185 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 17:15:40,185 INFO L82 PathProgramCache]: Analyzing trace with hash 556036659, now seen corresponding path program 1 times [2018-01-24 17:15:40,185 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:40,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:40,186 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:40,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:40,186 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:40,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:15:40,238 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:15:40,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:15:40,238 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:15:40,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:15:40,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:15:40,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:15:40,239 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 5 states. [2018-01-24 17:15:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:40,410 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-01-24 17:15:40,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:15:40,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 17:15:40,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:40,412 INFO L225 Difference]: With dead ends: 62 [2018-01-24 17:15:40,412 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 17:15:40,412 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:15:40,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 17:15:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-24 17:15:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 17:15:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-24 17:15:40,420 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 29 [2018-01-24 17:15:40,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:40,421 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-24 17:15:40,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:15:40,421 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-24 17:15:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 17:15:40,422 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:40,422 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:15:40,422 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 17:15:40,422 INFO L82 PathProgramCache]: Analyzing trace with hash -848422454, now seen corresponding path program 1 times [2018-01-24 17:15:40,423 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:40,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:40,424 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:40,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:40,424 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:40,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:15:40,737 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:15:40,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:15:40,737 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:15:40,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:15:40,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:15:40,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:15:40,738 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 6 states. [2018-01-24 17:15:40,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:40,802 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-01-24 17:15:40,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:15:40,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-24 17:15:40,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:40,804 INFO L225 Difference]: With dead ends: 68 [2018-01-24 17:15:40,804 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 17:15:40,804 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:15:40,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 17:15:40,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-01-24 17:15:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 17:15:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-24 17:15:40,811 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 32 [2018-01-24 17:15:40,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:40,811 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-24 17:15:40,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:15:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-24 17:15:40,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 17:15:40,813 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:40,813 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 17:15:40,813 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 17:15:40,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1529051221, now seen corresponding path program 1 times [2018-01-24 17:15:40,813 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:40,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:40,814 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:40,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:40,814 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:40,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:40,849 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 17:15:40,849 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:40,849 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:15:40,849 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-24 17:15:40,849 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [23], [24], [28], [29], [30], [34], [37], [39], [41], [42], [45], [47], [51], [55], [60], [61], [66], [68], [69], [70], [81], [82], [83], [84], [86], [87] [2018-01-24 17:15:40,851 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:15:40,851 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:15:40,966 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:15:40,966 INFO L268 AbstractInterpreter]: Visited 31 different actions 54 times. Merged at 17 different actions 17 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-01-24 17:15:40,981 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:15:40,982 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:40,982 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 17:15:40,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:40,994 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:15:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:41,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:41,026 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 17:15:41,026 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:41,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 17:15:41,078 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:41,079 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 17:15:41,087 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:41,087 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:15:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:41,115 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:41,120 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 17:15:41,121 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:41,135 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 17:15:41,136 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:15:41,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4] total 7 [2018-01-24 17:15:41,137 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:15:41,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:15:41,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:15:41,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:15:41,138 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2018-01-24 17:15:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:41,201 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-01-24 17:15:41,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:15:41,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-24 17:15:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:41,202 INFO L225 Difference]: With dead ends: 101 [2018-01-24 17:15:41,202 INFO L226 Difference]: Without dead ends: 85 [2018-01-24 17:15:41,203 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:15:41,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-24 17:15:41,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2018-01-24 17:15:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 17:15:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-24 17:15:41,210 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 32 [2018-01-24 17:15:41,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:41,210 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-24 17:15:41,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:15:41,210 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-24 17:15:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 17:15:41,211 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:41,211 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:15:41,211 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 17:15:41,212 INFO L82 PathProgramCache]: Analyzing trace with hash -736270445, now seen corresponding path program 1 times [2018-01-24 17:15:41,212 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:41,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:41,213 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:41,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:41,213 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:41,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:41,341 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:15:41,341 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:41,341 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:15:41,341 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-24 17:15:41,342 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [12], [13], [14], [17], [19], [23], [24], [28], [29], [30], [34], [39], [41], [42], [45], [47], [82], [83], [84], [86], [87] [2018-01-24 17:15:41,343 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:15:41,343 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:15:41,473 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:15:41,473 INFO L268 AbstractInterpreter]: Visited 27 different actions 76 times. Merged at 17 different actions 35 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 23 variables. [2018-01-24 17:15:41,474 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:15:41,475 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:41,475 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 17:15:41,494 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:41,494 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:15:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:41,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:15:41,700 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:41,740 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:15:41,761 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:41,761 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 17:15:41,765 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:41,766 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:15:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:41,803 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:15:41,810 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:15:41,863 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:15:41,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 7, 7] total 14 [2018-01-24 17:15:41,864 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:15:41,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 17:15:41,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 17:15:41,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-01-24 17:15:41,865 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 14 states. [2018-01-24 17:15:42,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:42,034 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2018-01-24 17:15:42,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 17:15:42,034 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-01-24 17:15:42,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:42,036 INFO L225 Difference]: With dead ends: 144 [2018-01-24 17:15:42,036 INFO L226 Difference]: Without dead ends: 100 [2018-01-24 17:15:42,036 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 125 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-01-24 17:15:42,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-24 17:15:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2018-01-24 17:15:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 17:15:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-01-24 17:15:42,045 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 34 [2018-01-24 17:15:42,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:42,046 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-01-24 17:15:42,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 17:15:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-01-24 17:15:42,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 17:15:42,047 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:42,048 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:15:42,048 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 17:15:42,048 INFO L82 PathProgramCache]: Analyzing trace with hash 733800956, now seen corresponding path program 2 times [2018-01-24 17:15:42,048 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:42,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:42,049 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:42,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:42,049 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:42,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:42,101 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:15:42,101 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:42,102 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:15:42,102 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:15:42,102 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:15:42,102 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:42,102 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 17:15:42,113 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:15:42,113 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:15:42,125 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:15:42,126 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:15:42,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:42,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:15:42,156 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 12 treesize of output 5 [2018-01-24 17:15:42,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:15:42,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:15:42,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 17:15:42,186 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:15:42,187 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 12 treesize of output 5 [2018-01-24 17:15:42,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:15:42,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:15:42,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 17:15:42,213 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_~#b~3.base| Int)) (and (= (store |c_old(#valid)| |main_~#b~3.base| 0) |c_#valid|) (= 0 (select |c_old(#valid)| |main_~#b~3.base|)))) is different from true [2018-01-24 17:15:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-24 17:15:42,218 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:42,232 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_~#b~3.base_20| Int)) (or (not (= 0 (select |c_#valid| |v_main_~#b~3.base_20|))) (= (store |c_#valid| |v_main_~#b~3.base_20| 0) |c_old(#valid)|))) is different from false [2018-01-24 17:15:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-24 17:15:42,259 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:15:42,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 11 [2018-01-24 17:15:42,259 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:15:42,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:15:42,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:15:42,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=54, Unknown=2, NotChecked=30, Total=110 [2018-01-24 17:15:42,260 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 6 states. [2018-01-24 17:15:42,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:42,318 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-01-24 17:15:42,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:15:42,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-01-24 17:15:42,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:42,323 INFO L225 Difference]: With dead ends: 81 [2018-01-24 17:15:42,323 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 17:15:42,324 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=85, Unknown=2, NotChecked=38, Total=156 [2018-01-24 17:15:42,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 17:15:42,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-24 17:15:42,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 17:15:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-01-24 17:15:42,331 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 45 [2018-01-24 17:15:42,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:42,331 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-01-24 17:15:42,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:15:42,331 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-01-24 17:15:42,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 17:15:42,332 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:42,332 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:15:42,332 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 17:15:42,333 INFO L82 PathProgramCache]: Analyzing trace with hash 611219876, now seen corresponding path program 2 times [2018-01-24 17:15:42,333 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:42,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:42,334 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 17:15:42,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:42,334 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:42,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 17:15:42,456 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:42,456 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:15:42,456 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:15:42,456 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:15:42,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:42,457 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:15:42,467 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:15:42,467 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:15:42,476 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:15:42,485 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:15:42,487 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:15:42,489 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 17:15:42,528 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 17:15:42,627 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:15:42,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [12] total 16 [2018-01-24 17:15:42,628 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:15:42,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:15:42,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:15:42,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-01-24 17:15:42,629 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 6 states. [2018-01-24 17:15:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:42,699 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-01-24 17:15:42,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:15:42,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-01-24 17:15:42,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:42,700 INFO L225 Difference]: With dead ends: 90 [2018-01-24 17:15:42,700 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 17:15:42,701 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-01-24 17:15:42,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 17:15:42,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-01-24 17:15:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 17:15:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-01-24 17:15:42,745 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 47 [2018-01-24 17:15:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:42,745 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-01-24 17:15:42,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:15:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-01-24 17:15:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-24 17:15:42,745 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:42,746 INFO L322 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:15:42,746 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 17:15:42,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1268780948, now seen corresponding path program 3 times [2018-01-24 17:15:42,746 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:42,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:42,747 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 17:15:42,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:42,747 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:42,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 17:15:42,879 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:42,879 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:15:42,879 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:15:42,879 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:15:42,879 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:42,879 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:15:42,888 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 17:15:42,888 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 17:15:42,898 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 17:15:42,904 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 17:15:42,906 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:15:42,909 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 17:15:42,925 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 17:15:43,045 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:43,045 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 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 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:15:43,049 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 17:15:43,049 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 17:15:43,063 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 17:15:43,080 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 17:15:43,094 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:15:43,099 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:43,107 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 17:15:43,107 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:43,129 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 17:15:43,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:15:43,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 5, 5] total 12 [2018-01-24 17:15:43,131 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:15:43,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:15:43,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:15:43,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:15:43,132 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 9 states. [2018-01-24 17:15:43,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:43,242 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-01-24 17:15:43,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:15:43,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-01-24 17:15:43,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:43,243 INFO L225 Difference]: With dead ends: 61 [2018-01-24 17:15:43,243 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 17:15:43,244 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-01-24 17:15:43,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 17:15:43,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-01-24 17:15:43,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 17:15:43,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-01-24 17:15:43,251 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 53 [2018-01-24 17:15:43,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:43,252 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-01-24 17:15:43,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:15:43,252 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-01-24 17:15:43,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-24 17:15:43,253 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:43,253 INFO L322 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:15:43,253 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 17:15:43,253 INFO L82 PathProgramCache]: Analyzing trace with hash -677503677, now seen corresponding path program 1 times [2018-01-24 17:15:43,254 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:43,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:43,255 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 17:15:43,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:43,255 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:43,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-24 17:15:43,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:43,457 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:15:43,457 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-01-24 17:15:43,458 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [16], [17], [19], [23], [24], [28], [29], [30], [34], [39], [41], [42], [45], [47], [82], [83], [84], [86], [87] [2018-01-24 17:15:43,459 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:15:43,459 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:15:43,593 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:15:43,593 INFO L268 AbstractInterpreter]: Visited 27 different actions 76 times. Merged at 17 different actions 35 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 23 variables. [2018-01-24 17:15:43,595 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:15:43,595 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:43,595 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:15:43,608 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:43,608 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:15:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:43,630 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:43,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:15:43,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:15:43,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:15:43,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 17:15:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 17:15:43,790 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 17:15:43,869 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:43,869 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 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 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:15:43,872 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:43,872 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:15:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:43,905 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:43,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:15:43,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:15:43,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:15:43,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 17:15:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 17:15:43,939 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 17:15:43,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:15:43,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5, 6, 5] total 16 [2018-01-24 17:15:43,953 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:15:43,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 17:15:43,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 17:15:43,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-01-24 17:15:43,953 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 13 states. [2018-01-24 17:15:44,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:44,099 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-01-24 17:15:44,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:15:44,100 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-01-24 17:15:44,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:44,101 INFO L225 Difference]: With dead ends: 74 [2018-01-24 17:15:44,101 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 17:15:44,102 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 198 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-01-24 17:15:44,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 17:15:44,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 17:15:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 17:15:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 17:15:44,102 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-01-24 17:15:44,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:44,103 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 17:15:44,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 17:15:44,103 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 17:15:44,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 17:15:44,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 17:15:44,131 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 17:15:44,337 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 34 DAG size of output 23 [2018-01-24 17:15:44,647 WARN L146 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 70 DAG size of output 53 [2018-01-24 17:15:44,681 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 31) no Hoare annotation was computed. [2018-01-24 17:15:44,681 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 31) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 17:15:44,681 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 31) no Hoare annotation was computed. [2018-01-24 17:15:44,681 INFO L401 ceAbstractionStarter]: For program point fooFINAL(lines 12 18) no Hoare annotation was computed. [2018-01-24 17:15:44,681 INFO L397 ceAbstractionStarter]: At program point L14'''(lines 14 16) the Hoare annotation is: (let ((.cse0 (not (= 0 |foo_#in~b.offset|))) (.cse3 (= foo_~i~1 0)) (.cse2 (not (= (select |#valid| |foo_#in~b.base|) 1))) (.cse4 (not (= 400 (select |#length| |foo_#in~b.base|)))) (.cse5 (< |foo_#in~n| |foo_#in~size|))) (and (let ((.cse1 (<= foo_~size 1))) (or .cse0 (and .cse1 (= 1 foo_~i~1)) .cse2 (and .cse1 .cse3) .cse4 (< 1 |foo_#in~size|) .cse5)) (or (and (= foo_~size 0) .cse3) .cse0 .cse2 (not (= 0 |foo_#in~size|)) .cse4 .cse5) (let ((.cse6 (<= foo_~size 99)) (.cse7 (= 1 (select |#valid| foo_~b.base))) (.cse8 (= (select |#length| foo_~b.base) 400)) (.cse9 (= foo_~b.offset 0)) (.cse10 (<= foo_~size foo_~n))) (or .cse0 (< 99 |foo_#in~size|) (and .cse6 (<= |foo_#in~size| foo_~size) .cse7 .cse8 .cse9 .cse10 .cse3) (and .cse6 .cse7 .cse8 .cse9 (<= 1 foo_~i~1) .cse10) .cse2 .cse4 .cse5)))) [2018-01-24 17:15:44,681 INFO L401 ceAbstractionStarter]: For program point fooEXIT(lines 12 18) no Hoare annotation was computed. [2018-01-24 17:15:44,681 INFO L401 ceAbstractionStarter]: For program point L14''(lines 14 16) no Hoare annotation was computed. [2018-01-24 17:15:44,681 INFO L401 ceAbstractionStarter]: For program point L14''''(lines 14 16) no Hoare annotation was computed. [2018-01-24 17:15:44,681 INFO L404 ceAbstractionStarter]: At program point fooENTRY(lines 12 18) the Hoare annotation is: true [2018-01-24 17:15:44,682 INFO L401 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 17:15:44,682 INFO L401 ceAbstractionStarter]: For program point L14(lines 14 16) no Hoare annotation was computed. [2018-01-24 17:15:44,682 INFO L401 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-01-24 17:15:44,682 INFO L401 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 17:15:44,682 INFO L401 ceAbstractionStarter]: For program point L15'(line 15) no Hoare annotation was computed. [2018-01-24 17:15:44,682 INFO L401 ceAbstractionStarter]: For program point L15''(line 15) no Hoare annotation was computed. [2018-01-24 17:15:44,682 INFO L401 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 15) no Hoare annotation was computed. [2018-01-24 17:15:44,682 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 31) the Hoare annotation is: true [2018-01-24 17:15:44,682 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 31) no Hoare annotation was computed. [2018-01-24 17:15:44,682 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 31) the Hoare annotation is: true [2018-01-24 17:15:44,682 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 31) no Hoare annotation was computed. [2018-01-24 17:15:44,682 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 17:15:44,682 INFO L401 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-01-24 17:15:44,682 INFO L397 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1)) (= 0 |main_~#b~3.offset|) (= (select |#length| |main_~#b~3.base|) 400) (= 0 (select |old(#valid)| |main_~#b~3.base|)) (<= main_~i~3 99) (<= 0 (+ (* 4 main_~i~3) |main_~#b~3.offset|))) [2018-01-24 17:15:44,683 INFO L401 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2018-01-24 17:15:44,683 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 17:15:44,683 INFO L401 ceAbstractionStarter]: For program point L25(lines 25 29) no Hoare annotation was computed. [2018-01-24 17:15:44,683 INFO L401 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-24 17:15:44,683 INFO L401 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-01-24 17:15:44,683 INFO L401 ceAbstractionStarter]: For program point L23'''(line 23) no Hoare annotation was computed. [2018-01-24 17:15:44,683 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 17:15:44,683 INFO L401 ceAbstractionStarter]: For program point L23'(line 23) no Hoare annotation was computed. [2018-01-24 17:15:44,683 INFO L401 ceAbstractionStarter]: For program point L21'''''(line 21) no Hoare annotation was computed. [2018-01-24 17:15:44,683 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 20 31) no Hoare annotation was computed. [2018-01-24 17:15:44,683 INFO L401 ceAbstractionStarter]: For program point L22''(lines 22 24) no Hoare annotation was computed. [2018-01-24 17:15:44,683 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 20 31) no Hoare annotation was computed. [2018-01-24 17:15:44,684 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 20 31) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 17:15:44,684 INFO L401 ceAbstractionStarter]: For program point L22''''(lines 22 24) no Hoare annotation was computed. [2018-01-24 17:15:44,684 INFO L397 ceAbstractionStarter]: At program point L22'''(lines 22 24) the Hoare annotation is: (and (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1)) (= 0 |main_~#b~3.offset|) (= (select |#length| |main_~#b~3.base|) 400) (= 0 (select |old(#valid)| |main_~#b~3.base|)) (<= 0 (+ (* 4 main_~i~3) |main_~#b~3.offset|))) [2018-01-24 17:15:44,684 INFO L401 ceAbstractionStarter]: For program point L26'(line 26) no Hoare annotation was computed. [2018-01-24 17:15:44,684 INFO L401 ceAbstractionStarter]: For program point L21''''(line 21) no Hoare annotation was computed. [2018-01-24 17:15:44,684 INFO L397 ceAbstractionStarter]: At program point L25'''(lines 25 29) the Hoare annotation is: (and (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1)) (= 0 |main_~#b~3.offset|) (= (select |#length| |main_~#b~3.base|) 400) (= 0 (select |old(#valid)| |main_~#b~3.base|)) (<= 0 (+ (* 4 main_~i~3) |main_~#b~3.offset|))) [2018-01-24 17:15:44,684 INFO L401 ceAbstractionStarter]: For program point L21'''(line 21) no Hoare annotation was computed. [2018-01-24 17:15:44,684 INFO L401 ceAbstractionStarter]: For program point L21'(line 21) no Hoare annotation was computed. [2018-01-24 17:15:44,684 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 17:15:44,684 INFO L401 ceAbstractionStarter]: For program point L25''''(lines 25 29) no Hoare annotation was computed. [2018-01-24 17:15:44,684 INFO L401 ceAbstractionStarter]: For program point L25''(lines 25 29) no Hoare annotation was computed. [2018-01-24 17:15:44,684 INFO L401 ceAbstractionStarter]: For program point L23''(line 23) no Hoare annotation was computed. [2018-01-24 17:15:44,685 INFO L401 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 20 31) no Hoare annotation was computed. [2018-01-24 17:15:44,685 INFO L401 ceAbstractionStarter]: For program point L21''(line 21) no Hoare annotation was computed. [2018-01-24 17:15:44,690 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,696 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,696 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,697 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,697 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,697 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,701 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,701 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,701 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,702 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,702 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,703 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,704 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:15:44 BoogieIcfgContainer [2018-01-24 17:15:44,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 17:15:44,707 INFO L168 Benchmark]: Toolchain (without parser) took 7003.10 ms. Allocated memory was 304.1 MB in the beginning and 550.5 MB in the end (delta: 246.4 MB). Free memory was 265.2 MB in the beginning and 432.5 MB in the end (delta: -167.3 MB). Peak memory consumption was 194.3 MB. Max. memory is 5.3 GB. [2018-01-24 17:15:44,708 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:15:44,708 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.14 ms. Allocated memory is still 304.1 MB. Free memory was 265.2 MB in the beginning and 256.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 5.3 GB. [2018-01-24 17:15:44,709 INFO L168 Benchmark]: Boogie Preprocessor took 34.29 ms. Allocated memory is still 304.1 MB. Free memory was 256.1 MB in the beginning and 255.1 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. [2018-01-24 17:15:44,709 INFO L168 Benchmark]: RCFGBuilder took 283.61 ms. Allocated memory is still 304.1 MB. Free memory was 255.1 MB in the beginning and 238.4 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. [2018-01-24 17:15:44,709 INFO L168 Benchmark]: TraceAbstraction took 6476.77 ms. Allocated memory was 304.1 MB in the beginning and 550.5 MB in the end (delta: 246.4 MB). Free memory was 238.4 MB in the beginning and 432.5 MB in the end (delta: -194.1 MB). Peak memory consumption was 167.6 MB. Max. memory is 5.3 GB. [2018-01-24 17:15:44,711 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.11 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 176.14 ms. Allocated memory is still 304.1 MB. Free memory was 265.2 MB in the beginning and 256.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.29 ms. Allocated memory is still 304.1 MB. Free memory was 256.1 MB in the beginning and 255.1 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. * RCFGBuilder took 283.61 ms. Allocated memory is still 304.1 MB. Free memory was 255.1 MB in the beginning and 238.4 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6476.77 ms. Allocated memory was 304.1 MB in the beginning and 550.5 MB in the end (delta: 246.4 MB). Free memory was 238.4 MB in the beginning and 432.5 MB in the end (delta: -194.1 MB). Peak memory consumption was 167.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 171 LocStat_NO_SUPPORTING_DISEQUALITIES : 36 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 37 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.371675 RENAME_VARIABLES(MILLISECONDS) : 0.442284 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.324591 PROJECTAWAY(MILLISECONDS) : 0.202447 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001396 DISJOIN(MILLISECONDS) : 0.413267 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.501176 ADD_EQUALITY(MILLISECONDS) : 0.067441 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.067843 #CONJOIN_DISJUNCTIVE : 50 #RENAME_VARIABLES : 99 #UNFREEZE : 0 #CONJOIN : 88 #PROJECTAWAY : 86 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 11 #RENAME_VARIABLES_DISJUNCTIVE : 97 #ADD_EQUALITY : 38 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 30 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 197 LocStat_NO_SUPPORTING_DISEQUALITIES : 52 LocStat_NO_DISJUNCTIONS : -60 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 37 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 41 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.359810 RENAME_VARIABLES(MILLISECONDS) : 0.288302 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.314446 PROJECTAWAY(MILLISECONDS) : 0.267779 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001096 DISJOIN(MILLISECONDS) : 0.242623 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.327406 ADD_EQUALITY(MILLISECONDS) : 0.047529 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.022066 #CONJOIN_DISJUNCTIVE : 65 #RENAME_VARIABLES : 125 #UNFREEZE : 0 #CONJOIN : 103 #PROJECTAWAY : 104 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 125 #ADD_EQUALITY : 42 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 191 LocStat_NO_SUPPORTING_DISEQUALITIES : 40 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 41 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.277598 RENAME_VARIABLES(MILLISECONDS) : 0.303341 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.233707 PROJECTAWAY(MILLISECONDS) : 0.170397 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001447 DISJOIN(MILLISECONDS) : 0.196403 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.334071 ADD_EQUALITY(MILLISECONDS) : 0.026781 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013513 #CONJOIN_DISJUNCTIVE : 91 #RENAME_VARIABLES : 187 #UNFREEZE : 0 #CONJOIN : 141 #PROJECTAWAY : 139 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 183 #ADD_EQUALITY : 42 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 200 LocStat_NO_SUPPORTING_DISEQUALITIES : 40 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 41 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.217021 RENAME_VARIABLES(MILLISECONDS) : 0.212339 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.186855 PROJECTAWAY(MILLISECONDS) : 0.140725 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001118 DISJOIN(MILLISECONDS) : 0.358514 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.237318 ADD_EQUALITY(MILLISECONDS) : 0.028677 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.034738 #CONJOIN_DISJUNCTIVE : 91 #RENAME_VARIABLES : 187 #UNFREEZE : 0 #CONJOIN : 141 #PROJECTAWAY : 139 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 183 #ADD_EQUALITY : 42 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant [2018-01-24 17:15:44,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((\valid == \old(\valid)[b := 1] && 0 == b) && unknown-#length-unknown[b] == 400) && 0 == \old(\valid)[b]) && 0 <= 4 * i + b - InvariantResult [Line: 14]: Loop Invariant [2018-01-24 17:15:44,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,728 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,728 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,728 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((!(0 == b) || (size <= 1 && 1 == i)) || !(\valid[b] == 1)) || (size <= 1 && i == 0)) || !(400 == unknown-#length-unknown[b])) || 1 < \old(size)) || \old(n) < \old(size)) && ((((((size == 0 && i == 0) || !(0 == b)) || !(\valid[b] == 1)) || !(0 == \old(size))) || !(400 == unknown-#length-unknown[b])) || \old(n) < \old(size))) && ((((((!(0 == b) || 99 < \old(size)) || ((((((size <= 99 && \old(size) <= size) && 1 == \valid[b]) && unknown-#length-unknown[b] == 400) && b == 0) && size <= n) && i == 0)) || (((((size <= 99 && 1 == \valid[b]) && unknown-#length-unknown[b] == 400) && b == 0) && 1 <= i) && size <= n)) || !(\valid[b] == 1)) || !(400 == unknown-#length-unknown[b])) || \old(n) < \old(size)) - InvariantResult [Line: 25]: Loop Invariant [2018-01-24 17:15:44,729 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:44,730 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((\valid == \old(\valid)[b := 1] && 0 == b) && unknown-#length-unknown[b] == 400) && 0 == \old(\valid)[b]) && 0 <= 4 * i + b - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 8 error locations. SAFE Result, 6.4s OverallTime, 15 OverallIterations, 5 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 515 SDtfs, 689 SDslu, 881 SDs, 0 SdLazy, 702 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1025 GetRequests, 885 SyntacticMatches, 28 SemanticMatches, 112 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 106 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 21 PreInvPairs, 36 NumberOfFragments, 239 HoareAnnotationTreeSize, 21 FomulaSimplifications, 299 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 804 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 930 NumberOfCodeBlocks, 866 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1360 ConstructedInterpolants, 58 QuantifiedInterpolants, 251604 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1279 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 37 InterpolantComputations, 14 PerfectInterpolantSequences, 637/713 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-15-44-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-15-44-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-15-44-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_17-15-44-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_17-15-44-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_17-15-44-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_17-15-44-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_17-15-44-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_17-15-44-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_17-15-44-734.csv Received shutdown request...