java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:51:38,442 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:51:38,444 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:51:38,457 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:51:38,457 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:51:38,458 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:51:38,459 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:51:38,461 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:51:38,463 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:51:38,463 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:51:38,464 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:51:38,464 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:51:38,465 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:51:38,465 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:51:38,466 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:51:38,469 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:51:38,471 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:51:38,473 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:51:38,474 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:51:38,476 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:51:38,478 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:51:38,478 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:51:38,479 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:51:38,480 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:51:38,480 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:51:38,482 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:51:38,482 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:51:38,483 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:51:38,483 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:51:38,483 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:51:38,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:51:38,484 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 15:51:38,494 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:51:38,495 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:51:38,496 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:51:38,496 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:51:38,496 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:51:38,496 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:51:38,496 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:51:38,497 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:51:38,497 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:51:38,498 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:51:38,498 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:51:38,498 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:51:38,498 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:51:38,498 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:51:38,499 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:51:38,499 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:51:38,499 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:51:38,499 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:51:38,500 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:51:38,500 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:51:38,500 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:51:38,500 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:51:38,500 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:51:38,501 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:51:38,501 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:51:38,501 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:51:38,501 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:51:38,501 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:51:38,502 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:51:38,502 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:51:38,502 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:51:38,502 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:51:38,502 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:51:38,503 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:51:38,504 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:51:38,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:51:38,554 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:51:38,559 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:51:38,561 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:51:38,561 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:51:38,562 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 15:51:38,676 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:51:38,682 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:51:38,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:51:38,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:51:38,691 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:51:38,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:51:38" (1/1) ... [2018-01-24 15:51:38,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68c4f948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:38, skipping insertion in model container [2018-01-24 15:51:38,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:51:38" (1/1) ... [2018-01-24 15:51:38,710 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:51:38,730 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:51:38,847 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:51:38,864 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:51:38,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:38 WrapperNode [2018-01-24 15:51:38,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:51:38,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:51:38,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:51:38,871 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:51:38,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:38" (1/1) ... [2018-01-24 15:51:38,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:38" (1/1) ... [2018-01-24 15:51:38,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:38" (1/1) ... [2018-01-24 15:51:38,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:38" (1/1) ... [2018-01-24 15:51:38,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:38" (1/1) ... [2018-01-24 15:51:38,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:38" (1/1) ... [2018-01-24 15:51:38,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:38" (1/1) ... [2018-01-24 15:51:38,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:51:38,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:51:38,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:51:38,907 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:51:38,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:38" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:51:38,953 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:51:38,953 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:51:38,953 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 15:51:38,953 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:51:38,953 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:51:38,954 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:51:38,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:51:38,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:51:38,954 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:51:38,954 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 15:51:38,954 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:51:38,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:51:38,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:51:39,167 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:51:39,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:51:39 BoogieIcfgContainer [2018-01-24 15:51:39,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:51:39,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:51:39,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:51:39,170 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:51:39,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:51:38" (1/3) ... [2018-01-24 15:51:39,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60839bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:51:39, skipping insertion in model container [2018-01-24 15:51:39,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:38" (2/3) ... [2018-01-24 15:51:39,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60839bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:51:39, skipping insertion in model container [2018-01-24 15:51:39,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:51:39" (3/3) ... [2018-01-24 15:51:39,174 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-01-24 15:51:39,183 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:51:39,191 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-01-24 15:51:39,230 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:51:39,231 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:51:39,231 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:51:39,231 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:51:39,231 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:51:39,231 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:51:39,231 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:51:39,232 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:51:39,232 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:51:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-24 15:51:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 15:51:39,262 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:39,263 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:39,264 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:39,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1202729229, now seen corresponding path program 1 times [2018-01-24 15:51:39,272 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:39,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:39,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:39,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:39,332 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:39,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:39,424 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:39,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:51:39,425 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:39,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 15:51:39,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 15:51:39,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 15:51:39,446 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-01-24 15:51:39,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:39,468 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-01-24 15:51:39,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 15:51:39,469 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-01-24 15:51:39,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:39,477 INFO L225 Difference]: With dead ends: 90 [2018-01-24 15:51:39,477 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 15:51:39,480 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 15:51:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 15:51:39,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 15:51:39,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 15:51:39,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-24 15:51:39,512 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 13 [2018-01-24 15:51:39,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:39,512 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-24 15:51:39,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 15:51:39,513 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-24 15:51:39,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:51:39,513 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:39,513 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:39,513 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:39,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1812590093, now seen corresponding path program 1 times [2018-01-24 15:51:39,514 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:39,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:39,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:39,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:39,515 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:39,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:39,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:39,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:51:39,655 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:39,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:51:39,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:51:39,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:51:39,658 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 3 states. [2018-01-24 15:51:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:39,752 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-01-24 15:51:39,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:51:39,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-24 15:51:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:39,756 INFO L225 Difference]: With dead ends: 83 [2018-01-24 15:51:39,756 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 15:51:39,758 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 15:51:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 15:51:39,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2018-01-24 15:51:39,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 15:51:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-24 15:51:39,771 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 14 [2018-01-24 15:51:39,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:39,772 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-24 15:51:39,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:51:39,772 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-24 15:51:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 15:51:39,773 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:39,773 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:39,773 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:39,773 INFO L82 PathProgramCache]: Analyzing trace with hash -267768884, now seen corresponding path program 1 times [2018-01-24 15:51:39,774 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:39,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:39,775 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:39,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:39,776 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:39,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:39,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:39,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:51:39,869 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:39,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:51:39,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:51:39,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:51:39,870 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 5 states. [2018-01-24 15:51:40,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:40,028 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2018-01-24 15:51:40,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:51:40,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 15:51:40,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:40,030 INFO L225 Difference]: With dead ends: 113 [2018-01-24 15:51:40,030 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 15:51:40,031 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 15:51:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 15:51:40,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2018-01-24 15:51:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 15:51:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-01-24 15:51:40,041 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 15 [2018-01-24 15:51:40,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:40,041 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-01-24 15:51:40,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:51:40,041 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-01-24 15:51:40,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:51:40,042 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:40,042 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 15:51:40,042 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:40,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181562, now seen corresponding path program 1 times [2018-01-24 15:51:40,043 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:40,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:40,045 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:40,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:40,045 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:40,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:40,100 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:40,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:51:40,100 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:40,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:51:40,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:51:40,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:51:40,101 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 3 states. [2018-01-24 15:51:40,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:40,130 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-01-24 15:51:40,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:51:40,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-01-24 15:51:40,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:40,134 INFO L225 Difference]: With dead ends: 57 [2018-01-24 15:51:40,134 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 15:51:40,135 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 15:51:40,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 15:51:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-24 15:51:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 15:51:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-24 15:51:40,143 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 19 [2018-01-24 15:51:40,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:40,144 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-24 15:51:40,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:51:40,144 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-24 15:51:40,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:51:40,145 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:40,145 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 15:51:40,145 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:40,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181563, now seen corresponding path program 1 times [2018-01-24 15:51:40,145 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:40,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:40,146 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:40,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:40,147 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:40,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:40,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:40,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:51:40,290 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:40,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:51:40,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:51:40,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:51:40,291 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2018-01-24 15:51:40,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:40,448 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-24 15:51:40,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:51:40,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-24 15:51:40,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:40,450 INFO L225 Difference]: With dead ends: 67 [2018-01-24 15:51:40,450 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 15:51:40,450 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 15:51:40,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 15:51:40,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-01-24 15:51:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 15:51:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-01-24 15:51:40,458 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 19 [2018-01-24 15:51:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:40,459 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-01-24 15:51:40,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:51:40,459 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-01-24 15:51:40,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 15:51:40,460 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:40,460 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 15:51:40,460 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:40,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2060273317, now seen corresponding path program 1 times [2018-01-24 15:51:40,461 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:40,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:40,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:40,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:40,462 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:40,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:40,567 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 15:51:40,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:40,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:51:40,567 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:40,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:51:40,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:51:40,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:51:40,568 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-01-24 15:51:40,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:40,653 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-01-24 15:51:40,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:51:40,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-24 15:51:40,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:40,655 INFO L225 Difference]: With dead ends: 70 [2018-01-24 15:51:40,655 INFO L226 Difference]: Without dead ends: 69 [2018-01-24 15:51:40,655 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:51:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-24 15:51:40,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-01-24 15:51:40,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 15:51:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-24 15:51:40,665 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 28 [2018-01-24 15:51:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:40,665 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-24 15:51:40,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:51:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-24 15:51:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:51:40,667 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:40,667 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 15:51:40,667 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:40,667 INFO L82 PathProgramCache]: Analyzing trace with hash 556036660, now seen corresponding path program 1 times [2018-01-24 15:51:40,668 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:40,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:40,669 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:40,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:40,669 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:40,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:40,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:40,853 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:40,853 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:40,854 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 15:51:40,856 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 15:51:40,915 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:51:40,916 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:51:41,269 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:51:41,271 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 15:51:41,280 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:51:41,280 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:41,280 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:51:41,294 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:41,295 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:41,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:41,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:51:41,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:41,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:51:41,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:51:41,427 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 15:51:41,427 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:41,520 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 15:51:41,557 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:51:41,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [7] total 12 [2018-01-24 15:51:41,557 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:41,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:51:41,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:51:41,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:51:41,558 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 6 states. [2018-01-24 15:51:41,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:41,639 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-01-24 15:51:41,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:51:41,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-24 15:51:41,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:41,641 INFO L225 Difference]: With dead ends: 69 [2018-01-24 15:51:41,641 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 15:51:41,641 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 15:51:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 15:51:41,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2018-01-24 15:51:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 15:51:41,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-01-24 15:51:41,649 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 29 [2018-01-24 15:51:41,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:41,650 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-01-24 15:51:41,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:51:41,650 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-01-24 15:51:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:51:41,651 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:41,652 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 15:51:41,652 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:41,652 INFO L82 PathProgramCache]: Analyzing trace with hash 556036659, now seen corresponding path program 1 times [2018-01-24 15:51:41,652 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:41,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:41,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:41,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:41,654 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:41,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:41,714 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 15:51:41,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:41,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:51:41,715 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:41,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:51:41,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:51:41,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:51:41,716 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 5 states. [2018-01-24 15:51:41,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:41,766 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-01-24 15:51:41,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:51:41,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 15:51:41,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:41,767 INFO L225 Difference]: With dead ends: 62 [2018-01-24 15:51:41,767 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 15:51:41,767 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 15:51:41,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 15:51:41,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-24 15:51:41,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 15:51:41,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-24 15:51:41,773 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 29 [2018-01-24 15:51:41,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:41,774 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-24 15:51:41,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:51:41,774 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-24 15:51:41,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 15:51:41,775 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:41,775 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 15:51:41,775 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:41,775 INFO L82 PathProgramCache]: Analyzing trace with hash -848422454, now seen corresponding path program 1 times [2018-01-24 15:51:41,775 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:41,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:41,776 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:41,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:41,776 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:41,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:42,010 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 18 DAG size of output 14 [2018-01-24 15:51:42,096 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 15:51:42,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:42,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:51:42,097 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:42,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:51:42,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:51:42,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:51:42,098 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 6 states. [2018-01-24 15:51:42,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:42,184 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-01-24 15:51:42,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:51:42,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-24 15:51:42,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:42,186 INFO L225 Difference]: With dead ends: 68 [2018-01-24 15:51:42,186 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 15:51:42,186 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 15:51:42,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 15:51:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-01-24 15:51:42,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 15:51:42,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-24 15:51:42,194 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 32 [2018-01-24 15:51:42,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:42,195 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-24 15:51:42,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:51:42,195 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-24 15:51:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 15:51:42,196 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:42,196 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:42,197 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:42,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1529051221, now seen corresponding path program 1 times [2018-01-24 15:51:42,197 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:42,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:42,198 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:42,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:42,199 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:42,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:42,261 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:42,261 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:42,262 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-24 15:51:42,262 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 15:51:42,263 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:51:42,263 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:51:42,766 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:51:42,766 INFO L268 AbstractInterpreter]: Visited 31 different actions 54 times. Merged at 16 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-01-24 15:51:42,774 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:51:42,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:42,775 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:51:42,787 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:42,787 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:42,806 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:42,831 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:42,899 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:42,899 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:51:42,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:42,903 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:42,929 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:42,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:42,932 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:42,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:51:42,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4] total 7 [2018-01-24 15:51:42,940 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:51:42,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:51:42,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:51:42,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:51:42,941 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2018-01-24 15:51:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:42,989 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-01-24 15:51:42,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:51:42,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-24 15:51:42,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:42,990 INFO L225 Difference]: With dead ends: 101 [2018-01-24 15:51:42,990 INFO L226 Difference]: Without dead ends: 85 [2018-01-24 15:51:42,991 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 15:51:42,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-24 15:51:42,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2018-01-24 15:51:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 15:51:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-24 15:51:42,998 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 32 [2018-01-24 15:51:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:42,999 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-24 15:51:42,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:51:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-24 15:51:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 15:51:42,999 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:43,000 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 15:51:43,000 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:43,000 INFO L82 PathProgramCache]: Analyzing trace with hash -736270445, now seen corresponding path program 1 times [2018-01-24 15:51:43,000 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:43,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:43,001 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:43,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:43,001 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:43,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:43,133 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 15:51:43,134 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:43,134 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:43,134 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-24 15:51:43,134 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 15:51:43,136 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:51:43,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:51:43,440 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:51:43,440 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 15:51:43,479 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:51:43,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:43,479 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) [2018-01-24 15:51:43,495 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:43,495 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:51:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:43,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:44,039 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 15:51:44,039 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:44,130 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 15:51:44,151 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:44,152 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:51:44,155 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:44,156 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:44,196 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:44,206 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 15:51:44,206 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:44,268 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 15:51:44,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:51:44,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 7, 7] total 14 [2018-01-24 15:51:44,269 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:51:44,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 15:51:44,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 15:51:44,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-01-24 15:51:44,270 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 14 states. [2018-01-24 15:51:44,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:44,472 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2018-01-24 15:51:44,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 15:51:44,472 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-01-24 15:51:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:44,473 INFO L225 Difference]: With dead ends: 144 [2018-01-24 15:51:44,473 INFO L226 Difference]: Without dead ends: 100 [2018-01-24 15:51:44,474 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 125 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-01-24 15:51:44,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-24 15:51:44,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2018-01-24 15:51:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 15:51:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-01-24 15:51:44,482 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 34 [2018-01-24 15:51:44,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:44,482 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-01-24 15:51:44,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 15:51:44,482 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-01-24 15:51:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 15:51:44,484 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:44,484 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 15:51:44,484 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:44,484 INFO L82 PathProgramCache]: Analyzing trace with hash 733800956, now seen corresponding path program 2 times [2018-01-24 15:51:44,484 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:44,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:44,485 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:44,486 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:44,486 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:44,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:44,555 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 15:51:44,555 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:44,555 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:44,555 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:51:44,556 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:51:44,556 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:44,556 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:51:44,572 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:51:44,572 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:51:44,581 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:51:44,587 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:51:44,589 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:44,717 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:51:44,718 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 15:51:44,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:44,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 15:51:44,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 15:51:44,773 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:51:44,773 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 15:51:44,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:44,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 15:51:44,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 15:51:44,795 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 15:51:44,800 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 15:51:44,800 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:44,818 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 15:51:44,824 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 15:51:44,851 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:51:44,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 11 [2018-01-24 15:51:44,851 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:44,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:51:44,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:51:44,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=54, Unknown=2, NotChecked=30, Total=110 [2018-01-24 15:51:44,852 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 6 states. [2018-01-24 15:51:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:44,914 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-01-24 15:51:44,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:51:44,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-01-24 15:51:44,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:44,915 INFO L225 Difference]: With dead ends: 81 [2018-01-24 15:51:44,915 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 15:51:44,915 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=85, Unknown=2, NotChecked=38, Total=156 [2018-01-24 15:51:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 15:51:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-24 15:51:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 15:51:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-01-24 15:51:44,921 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 45 [2018-01-24 15:51:44,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:44,921 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-01-24 15:51:44,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:51:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-01-24 15:51:44,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 15:51:44,922 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:44,923 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 15:51:44,923 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:44,923 INFO L82 PathProgramCache]: Analyzing trace with hash 611219876, now seen corresponding path program 2 times [2018-01-24 15:51:44,923 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:44,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:44,924 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:51:44,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:44,924 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:44,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:45,041 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 15:51:45,041 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:45,041 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:45,041 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:51:45,042 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:51:45,042 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:45,042 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 15:51:45,047 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:51:45,047 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:51:45,059 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:51:45,070 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:51:45,073 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:51:45,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:45,138 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 15:51:45,138 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:45,232 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 15:51:45,267 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:51:45,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [12] total 16 [2018-01-24 15:51:45,267 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:45,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:51:45,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:51:45,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-01-24 15:51:45,268 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 6 states. [2018-01-24 15:51:45,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:45,339 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-01-24 15:51:45,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:51:45,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-01-24 15:51:45,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:45,340 INFO L225 Difference]: With dead ends: 90 [2018-01-24 15:51:45,340 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 15:51:45,340 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 15:51:45,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 15:51:45,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-01-24 15:51:45,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 15:51:45,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-01-24 15:51:45,349 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 47 [2018-01-24 15:51:45,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:45,349 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-01-24 15:51:45,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:51:45,349 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-01-24 15:51:45,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-24 15:51:45,350 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:45,350 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 15:51:45,351 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:45,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1268780948, now seen corresponding path program 3 times [2018-01-24 15:51:45,351 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:45,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:45,352 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:51:45,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:45,352 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:45,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:45,487 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 15:51:45,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:45,487 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:45,488 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:51:45,488 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:51:45,488 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:45,488 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 15:51:45,497 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 15:51:45,497 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 15:51:45,507 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:51:45,524 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:51:45,526 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:51:45,528 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:45,544 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 15:51:45,544 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:45,610 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 15:51:45,631 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:45,631 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 15:51:45,635 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 15:51:45,635 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 15:51:45,646 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:51:45,659 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:51:45,669 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:51:45,673 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:45,679 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 15:51:45,679 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:45,698 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 15:51:45,702 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:51:45,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 5, 5] total 12 [2018-01-24 15:51:45,703 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:51:45,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 15:51:45,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 15:51:45,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:51:45,703 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 9 states. [2018-01-24 15:51:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:45,799 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-01-24 15:51:45,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:51:45,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-01-24 15:51:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:45,800 INFO L225 Difference]: With dead ends: 61 [2018-01-24 15:51:45,800 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 15:51:45,801 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-01-24 15:51:45,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 15:51:45,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-01-24 15:51:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 15:51:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-01-24 15:51:45,808 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 53 [2018-01-24 15:51:45,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:45,808 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-01-24 15:51:45,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 15:51:45,809 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-01-24 15:51:45,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-24 15:51:45,810 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:45,810 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 15:51:45,810 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:51:45,810 INFO L82 PathProgramCache]: Analyzing trace with hash -677503677, now seen corresponding path program 1 times [2018-01-24 15:51:45,811 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:45,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:45,812 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:51:45,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:45,812 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:45,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:46,013 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 15:51:46,014 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:46,014 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:46,014 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-01-24 15:51:46,014 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 15:51:46,015 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:51:46,015 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:51:46,237 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:51:46,238 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 15:51:46,245 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:51:46,246 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:46,246 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 15:51:46,256 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:46,256 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:46,284 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:46,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:51:46,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:46,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:51:46,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:51:46,389 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 15:51:46,389 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:46,510 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 15:51:46,530 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:46,531 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 15:51:46,533 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:46,534 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:46,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:46,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:51:46,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:46,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:51:46,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:51:46,620 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 15:51:46,620 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:46,633 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 15:51:46,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:51:46,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5, 6, 5] total 16 [2018-01-24 15:51:46,655 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:51:46,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 15:51:46,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 15:51:46,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-01-24 15:51:46,656 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 13 states. [2018-01-24 15:51:46,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:46,848 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-01-24 15:51:46,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:51:46,848 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-01-24 15:51:46,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:46,849 INFO L225 Difference]: With dead ends: 74 [2018-01-24 15:51:46,849 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 15:51:46,850 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 198 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-01-24 15:51:46,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 15:51:46,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 15:51:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 15:51:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 15:51:46,850 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-01-24 15:51:46,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:46,851 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 15:51:46,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 15:51:46,851 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 15:51:46,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 15:51:46,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 15:51:46,878 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 15:51:47,305 WARN L146 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 70 DAG size of output 53 [2018-01-24 15:51:47,341 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 31) no Hoare annotation was computed. [2018-01-24 15:51:47,342 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 31) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 15:51:47,342 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 31) no Hoare annotation was computed. [2018-01-24 15:51:47,342 INFO L401 ceAbstractionStarter]: For program point fooFINAL(lines 12 18) no Hoare annotation was computed. [2018-01-24 15:51:47,342 INFO L397 ceAbstractionStarter]: At program point L14'''(lines 14 16) the Hoare annotation is: (let ((.cse0 (not (= 0 |foo_#in~b.offset|))) (.cse1 (not (= (select |#valid| |foo_#in~b.base|) 1))) (.cse2 (not (= 400 (select |#length| |foo_#in~b.base|)))) (.cse9 (< |foo_#in~n| |foo_#in~size|)) (.cse8 (= foo_~i~1 0))) (and (let ((.cse3 (<= foo_~size 99)) (.cse4 (= 1 (select |#valid| foo_~b.base))) (.cse5 (= (select |#length| foo_~b.base) 400)) (.cse6 (= foo_~b.offset 0)) (.cse7 (<= foo_~size foo_~n))) (or .cse0 (< 99 |foo_#in~size|) .cse1 .cse2 (and .cse3 (<= |foo_#in~size| foo_~size) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse3 .cse4 .cse5 .cse6 (<= 1 foo_~i~1) .cse7) .cse9)) (or .cse0 .cse1 (not (= 0 |foo_#in~size|)) .cse2 .cse9 (and (= foo_~size 0) .cse8)) (let ((.cse10 (<= foo_~size 1))) (or .cse0 (and .cse10 (= 1 foo_~i~1)) .cse1 .cse2 (< 1 |foo_#in~size|) .cse9 (and .cse10 .cse8))))) [2018-01-24 15:51:47,342 INFO L401 ceAbstractionStarter]: For program point fooEXIT(lines 12 18) no Hoare annotation was computed. [2018-01-24 15:51:47,342 INFO L401 ceAbstractionStarter]: For program point L14''(lines 14 16) no Hoare annotation was computed. [2018-01-24 15:51:47,342 INFO L401 ceAbstractionStarter]: For program point L14''''(lines 14 16) no Hoare annotation was computed. [2018-01-24 15:51:47,342 INFO L404 ceAbstractionStarter]: At program point fooENTRY(lines 12 18) the Hoare annotation is: true [2018-01-24 15:51:47,342 INFO L401 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 15:51:47,342 INFO L401 ceAbstractionStarter]: For program point L14(lines 14 16) no Hoare annotation was computed. [2018-01-24 15:51:47,342 INFO L401 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-01-24 15:51:47,343 INFO L401 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 15:51:47,343 INFO L401 ceAbstractionStarter]: For program point L15'(line 15) no Hoare annotation was computed. [2018-01-24 15:51:47,343 INFO L401 ceAbstractionStarter]: For program point L15''(line 15) no Hoare annotation was computed. [2018-01-24 15:51:47,343 INFO L401 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 15) no Hoare annotation was computed. [2018-01-24 15:51:47,343 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 31) the Hoare annotation is: true [2018-01-24 15:51:47,343 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 31) no Hoare annotation was computed. [2018-01-24 15:51:47,343 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 31) the Hoare annotation is: true [2018-01-24 15:51:47,343 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 31) no Hoare annotation was computed. [2018-01-24 15:51:47,343 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 15:51:47,343 INFO L401 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-01-24 15:51:47,343 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 15:51:47,343 INFO L401 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2018-01-24 15:51:47,343 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 15:51:47,343 INFO L401 ceAbstractionStarter]: For program point L25(lines 25 29) no Hoare annotation was computed. [2018-01-24 15:51:47,344 INFO L401 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-24 15:51:47,344 INFO L401 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-01-24 15:51:47,344 INFO L401 ceAbstractionStarter]: For program point L23'''(line 23) no Hoare annotation was computed. [2018-01-24 15:51:47,344 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 15:51:47,344 INFO L401 ceAbstractionStarter]: For program point L23'(line 23) no Hoare annotation was computed. [2018-01-24 15:51:47,344 INFO L401 ceAbstractionStarter]: For program point L21'''''(line 21) no Hoare annotation was computed. [2018-01-24 15:51:47,344 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 20 31) no Hoare annotation was computed. [2018-01-24 15:51:47,344 INFO L401 ceAbstractionStarter]: For program point L22''(lines 22 24) no Hoare annotation was computed. [2018-01-24 15:51:47,344 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 20 31) no Hoare annotation was computed. [2018-01-24 15:51:47,344 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 20 31) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 15:51:47,344 INFO L401 ceAbstractionStarter]: For program point L22''''(lines 22 24) no Hoare annotation was computed. [2018-01-24 15:51:47,344 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 15:51:47,344 INFO L401 ceAbstractionStarter]: For program point L26'(line 26) no Hoare annotation was computed. [2018-01-24 15:51:47,345 INFO L401 ceAbstractionStarter]: For program point L21''''(line 21) no Hoare annotation was computed. [2018-01-24 15:51:47,345 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 15:51:47,345 INFO L401 ceAbstractionStarter]: For program point L21'''(line 21) no Hoare annotation was computed. [2018-01-24 15:51:47,345 INFO L401 ceAbstractionStarter]: For program point L21'(line 21) no Hoare annotation was computed. [2018-01-24 15:51:47,345 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 15:51:47,345 INFO L401 ceAbstractionStarter]: For program point L25''''(lines 25 29) no Hoare annotation was computed. [2018-01-24 15:51:47,345 INFO L401 ceAbstractionStarter]: For program point L25''(lines 25 29) no Hoare annotation was computed. [2018-01-24 15:51:47,345 INFO L401 ceAbstractionStarter]: For program point L23''(line 23) no Hoare annotation was computed. [2018-01-24 15:51:47,345 INFO L401 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 20 31) no Hoare annotation was computed. [2018-01-24 15:51:47,345 INFO L401 ceAbstractionStarter]: For program point L21''(line 21) no Hoare annotation was computed. [2018-01-24 15:51:47,350 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,352 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,356 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,356 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,357 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,357 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,357 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,361 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,361 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,361 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,363 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:51:47 BoogieIcfgContainer [2018-01-24 15:51:47,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:51:47,367 INFO L168 Benchmark]: Toolchain (without parser) took 8690.60 ms. Allocated memory was 305.1 MB in the beginning and 600.3 MB in the end (delta: 295.2 MB). Free memory was 266.2 MB in the beginning and 460.6 MB in the end (delta: -194.4 MB). Peak memory consumption was 100.8 MB. Max. memory is 5.3 GB. [2018-01-24 15:51:47,368 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 305.1 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:51:47,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.88 ms. Allocated memory is still 305.1 MB. Free memory was 266.2 MB in the beginning and 257.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 15:51:47,368 INFO L168 Benchmark]: Boogie Preprocessor took 35.42 ms. Allocated memory is still 305.1 MB. Free memory was 257.1 MB in the beginning and 256.1 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. [2018-01-24 15:51:47,368 INFO L168 Benchmark]: RCFGBuilder took 260.50 ms. Allocated memory is still 305.1 MB. Free memory was 256.1 MB in the beginning and 239.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 15:51:47,369 INFO L168 Benchmark]: TraceAbstraction took 8198.39 ms. Allocated memory was 305.1 MB in the beginning and 600.3 MB in the end (delta: 295.2 MB). Free memory was 239.4 MB in the beginning and 460.6 MB in the end (delta: -221.2 MB). Peak memory consumption was 74.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:51:47,371 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.18 ms. Allocated memory is still 305.1 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 187.88 ms. Allocated memory is still 305.1 MB. Free memory was 266.2 MB in the beginning and 257.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 35.42 ms. Allocated memory is still 305.1 MB. Free memory was 257.1 MB in the beginning and 256.1 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. * RCFGBuilder took 260.50 ms. Allocated memory is still 305.1 MB. Free memory was 256.1 MB in the beginning and 239.4 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8198.39 ms. Allocated memory was 305.1 MB in the beginning and 600.3 MB in the end (delta: 295.2 MB). Free memory was 239.4 MB in the beginning and 460.6 MB in the end (delta: -221.2 MB). Peak memory consumption was 74.0 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 : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 188 LocStat_NO_SUPPORTING_DISEQUALITIES : 36 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 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.561792 RENAME_VARIABLES(MILLISECONDS) : 0.346873 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.515100 PROJECTAWAY(MILLISECONDS) : 0.180036 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.072976 DISJOIN(MILLISECONDS) : 0.164783 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.380346 ADD_EQUALITY(MILLISECONDS) : 0.077412 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.040073 #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 : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 210 LocStat_NO_SUPPORTING_DISEQUALITIES : 52 LocStat_NO_DISJUNCTIONS : -60 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 37 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 41 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.577750 RENAME_VARIABLES(MILLISECONDS) : 0.273090 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.521976 PROJECTAWAY(MILLISECONDS) : 0.205596 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.095753 DISJOIN(MILLISECONDS) : 0.219762 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.306426 ADD_EQUALITY(MILLISECONDS) : 0.047269 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.018822 #CONJOIN_DISJUNCTIVE : 79 #RENAME_VARIABLES : 162 #UNFREEZE : 0 #CONJOIN : 127 #PROJECTAWAY : 122 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 16 #RENAME_VARIABLES_DISJUNCTIVE : 162 #ADD_EQUALITY : 42 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 210 LocStat_NO_SUPPORTING_DISEQUALITIES : 40 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 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.466892 RENAME_VARIABLES(MILLISECONDS) : 0.228926 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.423800 PROJECTAWAY(MILLISECONDS) : 0.165162 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.074193 DISJOIN(MILLISECONDS) : 0.282805 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.258662 ADD_EQUALITY(MILLISECONDS) : 0.034393 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012844 #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 : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 219 LocStat_NO_SUPPORTING_DISEQUALITIES : 40 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 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.384217 RENAME_VARIABLES(MILLISECONDS) : 0.194039 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.353147 PROJECTAWAY(MILLISECONDS) : 0.149797 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.078972 DISJOIN(MILLISECONDS) : 0.292760 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.220619 ADD_EQUALITY(MILLISECONDS) : 0.061386 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010484 #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 15:51:47,380 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,381 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 15:51:47,384 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,384 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,384 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,384 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,385 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,387 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,387 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,388 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,388 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,388 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((!(0 == b) || 99 < \old(size)) || !(\valid[b] == 1)) || !(400 == unknown-#length-unknown[b])) || ((((((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)) || \old(n) < \old(size)) && (((((!(0 == b) || !(\valid[b] == 1)) || !(0 == \old(size))) || !(400 == unknown-#length-unknown[b])) || \old(n) < \old(size)) || (size == 0 && i == 0))) && ((((((!(0 == b) || (size <= 1 && 1 == i)) || !(\valid[b] == 1)) || !(400 == unknown-#length-unknown[b])) || 1 < \old(size)) || \old(n) < \old(size)) || (size <= 1 && i == 0)) - InvariantResult [Line: 25]: Loop Invariant [2018-01-24 15:51:47,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:47,390 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, 8.1s OverallTime, 15 OverallIterations, 5 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s 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, 2.6s 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, 1.5s 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.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s 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.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-51-47-395.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-51-47-395.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-51-47-395.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-51-47-395.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-51-47-395.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_15-51-47-395.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_15-51-47-395.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_15-51-47-395.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_15-51-47-395.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-51-47-395.csv Received shutdown request...