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/ArraysOfVariableLength5_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:51:18,416 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:51:18,418 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:51:18,430 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:51:18,430 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:51:18,431 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:51:18,432 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:51:18,434 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:51:18,436 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:51:18,436 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:51:18,437 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:51:18,437 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:51:18,438 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:51:18,439 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:51:18,439 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:51:18,442 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:51:18,444 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:51:18,446 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:51:18,447 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:51:18,448 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:51:18,451 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:51:18,451 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:51:18,451 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:51:18,452 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:51:18,453 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:51:18,454 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:51:18,454 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:51:18,455 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:51:18,455 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:51:18,455 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:51:18,456 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:51:18,456 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:18,466 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:51:18,466 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:51:18,467 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:51:18,467 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:51:18,467 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:51:18,468 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:51:18,468 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:51:18,469 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:51:18,469 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:51:18,469 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:51:18,469 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:51:18,469 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:51:18,470 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:51:18,470 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:51:18,470 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:51:18,470 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:51:18,470 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:51:18,471 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:51:18,471 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:51:18,471 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:51:18,471 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:51:18,471 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:51:18,472 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:51:18,472 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:51:18,472 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:51:18,472 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:51:18,472 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:51:18,473 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:51:18,473 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:51:18,473 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:51:18,473 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:51:18,473 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:51:18,474 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:51:18,474 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:51:18,475 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:51:18,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:51:18,519 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:51:18,522 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:51:18,523 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:51:18,523 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:51:18,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2018-01-24 15:51:18,640 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:51:18,646 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:51:18,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:51:18,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:51:18,652 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:51:18,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:51:18" (1/1) ... [2018-01-24 15:51:18,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1e19c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:18, skipping insertion in model container [2018-01-24 15:51:18,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:51:18" (1/1) ... [2018-01-24 15:51:18,675 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:51:18,693 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:51:18,808 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:51:18,822 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:51:18,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:18 WrapperNode [2018-01-24 15:51:18,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:51:18,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:51:18,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:51:18,829 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:51:18,845 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:18" (1/1) ... [2018-01-24 15:51:18,845 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:18" (1/1) ... [2018-01-24 15:51:18,855 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:18" (1/1) ... [2018-01-24 15:51:18,855 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:18" (1/1) ... [2018-01-24 15:51:18,858 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:18" (1/1) ... [2018-01-24 15:51:18,862 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:18" (1/1) ... [2018-01-24 15:51:18,862 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:18" (1/1) ... [2018-01-24 15:51:18,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:51:18,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:51:18,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:51:18,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:51:18,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:18" (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:18,906 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:51:18,906 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:51:18,906 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 15:51:18,906 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:51:18,906 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:51:18,907 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:51:18,907 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:51:18,907 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:51:18,907 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:51:18,907 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 15:51:18,907 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:51:18,907 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:51:18,907 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:51:19,072 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:51:19,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:51:19 BoogieIcfgContainer [2018-01-24 15:51:19,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:51:19,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:51:19,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:51:19,076 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:51:19,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:51:18" (1/3) ... [2018-01-24 15:51:19,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374cfe67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:51:19, skipping insertion in model container [2018-01-24 15:51:19,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:18" (2/3) ... [2018-01-24 15:51:19,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374cfe67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:51:19, skipping insertion in model container [2018-01-24 15:51:19,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:51:19" (3/3) ... [2018-01-24 15:51:19,080 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c [2018-01-24 15:51:19,088 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:51:19,093 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-24 15:51:19,137 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:51:19,137 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:51:19,137 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:51:19,137 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:51:19,137 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:51:19,138 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:51:19,138 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:51:19,138 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:51:19,138 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:51:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 15:51:19,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 15:51:19,158 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:19,159 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:19,159 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:19,164 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-01-24 15:51:19,167 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:19,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:19,213 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:19,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:19,213 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:19,264 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:19,339 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:19,341 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:19,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:51:19,341 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:19,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:51:19,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:51:19,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:51:19,356 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-24 15:51:19,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:19,444 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-01-24 15:51:19,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:51:19,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-24 15:51:19,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:19,453 INFO L225 Difference]: With dead ends: 101 [2018-01-24 15:51:19,453 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 15:51:19,456 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 15:51:19,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-01-24 15:51:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 15:51:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-24 15:51:19,557 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-01-24 15:51:19,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:19,558 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-24 15:51:19,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:51:19,558 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-24 15:51:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 15:51:19,558 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:19,559 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:19,559 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:19,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-01-24 15:51:19,559 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:19,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:19,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:19,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:19,560 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:19,577 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:19,661 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:19,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:19,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:51:19,662 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:19,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:51:19,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:51:19,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:51:19,665 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-01-24 15:51:19,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:19,774 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-01-24 15:51:19,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:51:19,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 15:51:19,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:19,777 INFO L225 Difference]: With dead ends: 103 [2018-01-24 15:51:19,777 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 15:51:19,778 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:19,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 15:51:19,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-01-24 15:51:19,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 15:51:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-24 15:51:19,788 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 16 [2018-01-24 15:51:19,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:19,788 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-24 15:51:19,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:51:19,788 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-24 15:51:19,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 15:51:19,789 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:19,789 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:19,790 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:19,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-01-24 15:51:19,790 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:19,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:19,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:19,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:19,791 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:19,810 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:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:19,881 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:19,881 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:19,882 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 15:51:19,885 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [23], [24], [28], [29], [30], [34], [39], [40], [41], [43], [45], [79], [80], [81], [83], [84] [2018-01-24 15:51:19,927 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:51:19,928 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:51:20,903 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:51:20,904 INFO L268 AbstractInterpreter]: Visited 21 different actions 59 times. Merged at 7 different actions 19 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 17 variables. [2018-01-24 15:51:20,917 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:51:20,917 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:20,918 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:20,932 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:20,932 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:20,968 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:21,052 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:21,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:21,158 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:51:21,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2018-01-24 15:51:21,159 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:21,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:51:21,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:51:21,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:51:21,160 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-01-24 15:51:21,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:21,231 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-01-24 15:51:21,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:51:21,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-24 15:51:21,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:21,233 INFO L225 Difference]: With dead ends: 67 [2018-01-24 15:51:21,233 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 15:51:21,234 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:51:21,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 15:51:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-01-24 15:51:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 15:51:21,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-01-24 15:51:21,241 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 23 [2018-01-24 15:51:21,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:21,242 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-01-24 15:51:21,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:51:21,242 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-01-24 15:51:21,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 15:51:21,243 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:21,243 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:21,244 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:21,244 INFO L82 PathProgramCache]: Analyzing trace with hash 621927392, now seen corresponding path program 1 times [2018-01-24 15:51:21,244 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:21,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:21,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:21,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:21,246 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:21,261 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:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:21,354 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:21,354 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:21,354 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 15:51:21,354 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [12], [23], [24], [28], [29], [30], [34], [39], [41], [43], [45], [79], [80], [81], [83], [84] [2018-01-24 15:51:21,355 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:51:21,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:51:22,012 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:51:22,012 INFO L268 AbstractInterpreter]: Visited 22 different actions 63 times. Merged at 6 different actions 17 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2018-01-24 15:51:22,019 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:51:22,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:22,019 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:22,034 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:22,034 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:22,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 15:51:22,124 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 15:51:22,191 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:51:22,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [6] total 7 [2018-01-24 15:51:22,191 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:22,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:51:22,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:51:22,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:51:22,193 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 3 states. [2018-01-24 15:51:22,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:22,222 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-01-24 15:51:22,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:51:22,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-24 15:51:22,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:22,229 INFO L225 Difference]: With dead ends: 65 [2018-01-24 15:51:22,229 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 15:51:22,229 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:51:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 15:51:22,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-01-24 15:51:22,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 15:51:22,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-24 15:51:22,239 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 28 [2018-01-24 15:51:22,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:22,240 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-24 15:51:22,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:51:22,240 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-24 15:51:22,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:51:22,241 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:22,241 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:22,241 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:22,242 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880015, now seen corresponding path program 1 times [2018-01-24 15:51:22,242 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:22,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:22,243 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:22,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:22,243 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:22,256 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:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:22,436 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:22,436 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:22,437 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 15:51:22,437 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [16], [23], [24], [28], [29], [30], [34], [39], [41], [43], [45], [79], [80], [81], [83], [84] [2018-01-24 15:51:22,438 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:51:22,438 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:51:23,107 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:51:23,108 INFO L268 AbstractInterpreter]: Visited 23 different actions 67 times. Merged at 6 different actions 17 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2018-01-24 15:51:23,110 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:51:23,110 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:23,110 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:51:23,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:23,118 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:23,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:23,163 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:23,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:23,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:51:23,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:51:23,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:51:23,236 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:51:23,358 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:23,358 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:51:23,365 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:23,365 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:23,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:23,406 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:23,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:23,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:51:23,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:51:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:51:23,468 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:51:23,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:51:23,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5, 6, 5] total 15 [2018-01-24 15:51:23,486 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:51:23,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 15:51:23,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 15:51:23,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-01-24 15:51:23,487 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 12 states. [2018-01-24 15:51:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:24,005 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-01-24 15:51:24,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 15:51:24,005 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-01-24 15:51:24,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:24,007 INFO L225 Difference]: With dead ends: 127 [2018-01-24 15:51:24,007 INFO L226 Difference]: Without dead ends: 110 [2018-01-24 15:51:24,008 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-01-24 15:51:24,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-24 15:51:24,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 66. [2018-01-24 15:51:24,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-24 15:51:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-01-24 15:51:24,017 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 29 [2018-01-24 15:51:24,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:24,017 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-01-24 15:51:24,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 15:51:24,018 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-01-24 15:51:24,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:51:24,018 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:24,019 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:24,019 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:24,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880014, now seen corresponding path program 1 times [2018-01-24 15:51:24,019 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:24,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:24,020 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:24,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:24,020 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:24,029 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:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:51:24,092 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:24,092 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:24,092 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 15:51:24,092 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [23], [24], [28], [29], [30], [34], [39], [41], [43], [45], [79], [80], [81], [83], [84] [2018-01-24 15:51:24,093 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:51:24,093 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:51:24,768 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 15:51:24,769 INFO L268 AbstractInterpreter]: Visited 23 different actions 67 times. Merged at 6 different actions 17 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2018-01-24 15:51:24,794 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 15:51:24,977 INFO L232 lantSequenceWeakener]: Weakened 28 states. On average, predicates are now at 70.19% of their original sizes. [2018-01-24 15:51:24,977 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 15:51:25,137 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 15:51:25,137 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:51:25,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 15 [2018-01-24 15:51:25,138 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:25,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 15:51:25,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 15:51:25,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:51:25,139 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 12 states. [2018-01-24 15:51:25,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:25,783 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-01-24 15:51:25,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:51:25,784 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-01-24 15:51:25,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:25,785 INFO L225 Difference]: With dead ends: 72 [2018-01-24 15:51:25,785 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 15:51:25,786 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-01-24 15:51:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 15:51:25,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-01-24 15:51:25,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-24 15:51:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-01-24 15:51:25,794 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 29 [2018-01-24 15:51:25,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:25,795 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-01-24 15:51:25,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 15:51:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-01-24 15:51:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 15:51:25,796 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:25,796 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 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:25,796 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:25,797 INFO L82 PathProgramCache]: Analyzing trace with hash -533212584, now seen corresponding path program 1 times [2018-01-24 15:51:25,797 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:25,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:25,798 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:25,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:25,798 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:25,810 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:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:25,917 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:25,917 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:25,917 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-24 15:51:25,917 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [12], [13], [14], [17], [19], [23], [24], [28], [29], [30], [34], [39], [41], [43], [45], [79], [80], [81], [83], [84] [2018-01-24 15:51:25,919 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:51:25,919 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:51:26,445 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:51:26,446 INFO L268 AbstractInterpreter]: Visited 26 different actions 99 times. Merged at 16 different actions 46 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 21 variables. [2018-01-24 15:51:26,495 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:51:26,495 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:26,495 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:51:26,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:26,503 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:26,523 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:26,581 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:26,581 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:26,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:26,659 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 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 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:51:26,672 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:26,672 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:26,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:26,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:26,709 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:26,953 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:26,955 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:51:26,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7, 7, 7] total 15 [2018-01-24 15:51:26,955 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:51:26,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 15:51:26,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 15:51:26,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-01-24 15:51:26,956 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 15 states. [2018-01-24 15:51:27,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:27,467 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2018-01-24 15:51:27,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 15:51:27,468 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-24 15:51:27,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:27,469 INFO L225 Difference]: With dead ends: 140 [2018-01-24 15:51:27,469 INFO L226 Difference]: Without dead ends: 97 [2018-01-24 15:51:27,470 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 125 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-01-24 15:51:27,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-24 15:51:27,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2018-01-24 15:51:27,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 15:51:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-24 15:51:27,483 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 34 [2018-01-24 15:51:27,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:27,483 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-24 15:51:27,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 15:51:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-24 15:51:27,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 15:51:27,485 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:27,485 INFO L322 BasicCegarLoop]: trace histogram [3, 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:27,485 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:27,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2137316393, now seen corresponding path program 1 times [2018-01-24 15:51:27,486 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:27,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:27,487 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:27,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:27,487 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:27,500 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:27,537 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:51:27,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:27,538 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:27,538 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-01-24 15:51:27,538 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [23], [24], [28], [29], [30], [34], [37], [39], [41], [43], [45], [49], [53], [58], [60], [63], [65], [66], [67], [78], [79], [80], [81], [83], [84] [2018-01-24 15:51:27,539 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:51:27,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:51:28,421 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:51:28,422 INFO L268 AbstractInterpreter]: Visited 30 different actions 87 times. Merged at 15 different actions 36 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 18 variables. [2018-01-24 15:51:28,433 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:51:28,434 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:28,434 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:28,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:28,443 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:28,463 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 15:51:28,510 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 15:51:28,616 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:51:28,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [5] total 10 [2018-01-24 15:51:28,616 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:28,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:51:28,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:51:28,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:51:28,617 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 6 states. [2018-01-24 15:51:28,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:28,702 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2018-01-24 15:51:28,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:51:28,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-24 15:51:28,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:28,704 INFO L225 Difference]: With dead ends: 135 [2018-01-24 15:51:28,704 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 15:51:28,705 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-01-24 15:51:28,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 15:51:28,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2018-01-24 15:51:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 15:51:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-01-24 15:51:28,716 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 43 [2018-01-24 15:51:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:28,716 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-01-24 15:51:28,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:51:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-01-24 15:51:28,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-24 15:51:28,717 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:28,718 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1] [2018-01-24 15:51:28,718 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:28,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1584033375, now seen corresponding path program 1 times [2018-01-24 15:51:28,718 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:28,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:28,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:28,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:28,719 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:28,731 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:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:51:28,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:28,788 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:28,789 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-01-24 15:51:28,789 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [17], [19], [23], [24], [28], [29], [30], [34], [37], [39], [41], [43], [45], [49], [53], [58], [60], [63], [65], [66], [67], [78], [79], [80], [81], [83], [84] [2018-01-24 15:51:28,790 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:51:28,791 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:51:29,533 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:51:29,533 INFO L268 AbstractInterpreter]: Visited 35 different actions 119 times. Merged at 24 different actions 57 times. Never widened. Found 8 fixpoints after 4 different actions. Largest state had 21 variables. [2018-01-24 15:51:29,534 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:51:29,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:29,535 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:29,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:29,546 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:29,567 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:51:29,586 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:51:29,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:29,644 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:29,649 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:29,649 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:29,693 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:51:29,699 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:51:29,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:51:29,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-24 15:51:29,723 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:51:29,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:51:29,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:51:29,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:51:29,724 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 6 states. [2018-01-24 15:51:29,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:29,792 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-01-24 15:51:29,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:51:29,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-01-24 15:51:29,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:29,793 INFO L225 Difference]: With dead ends: 131 [2018-01-24 15:51:29,793 INFO L226 Difference]: Without dead ends: 110 [2018-01-24 15:51:29,794 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:51:29,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-24 15:51:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 88. [2018-01-24 15:51:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 15:51:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-01-24 15:51:29,805 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 49 [2018-01-24 15:51:29,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:29,806 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-01-24 15:51:29,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:51:29,806 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-01-24 15:51:29,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 15:51:29,807 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:29,807 INFO L322 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:29,807 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:29,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1798255855, now seen corresponding path program 2 times [2018-01-24 15:51:29,808 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:29,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:29,809 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:29,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:29,809 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:29,821 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:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 15:51:29,942 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:29,942 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:29,942 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:51:29,943 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:29,943 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:29,943 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:29,957 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:51:29,957 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:51:29,970 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:51:29,980 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:51:29,982 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:51:29,985 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:51:30,055 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:51:30,237 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:30,237 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:30,240 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:51:30,240 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:51:30,252 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:51:30,268 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:51:30,280 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:51:30,284 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:51:30,291 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:51:30,316 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:51:30,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 22 [2018-01-24 15:51:30,316 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:51:30,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 15:51:30,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 15:51:30,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-01-24 15:51:30,317 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 16 states. [2018-01-24 15:51:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:30,693 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2018-01-24 15:51:30,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 15:51:30,693 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-01-24 15:51:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:30,695 INFO L225 Difference]: With dead ends: 162 [2018-01-24 15:51:30,695 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 15:51:30,696 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=1147, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 15:51:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 15:51:30,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 107. [2018-01-24 15:51:30,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-24 15:51:30,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-01-24 15:51:30,709 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 52 [2018-01-24 15:51:30,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:30,709 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-01-24 15:51:30,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 15:51:30,709 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-01-24 15:51:30,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-24 15:51:30,710 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:30,710 INFO L322 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:30,710 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:30,711 INFO L82 PathProgramCache]: Analyzing trace with hash -88643296, now seen corresponding path program 1 times [2018-01-24 15:51:30,711 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:30,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:30,712 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:51:30,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:30,712 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:30,724 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:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 15:51:30,877 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:30,877 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:30,877 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-01-24 15:51:30,877 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [16], [17], [19], [23], [24], [28], [29], [30], [34], [39], [41], [43], [45], [79], [80], [81], [83], [84] [2018-01-24 15:51:30,879 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:51:30,879 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:51:31,375 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:51:31,375 INFO L268 AbstractInterpreter]: Visited 26 different actions 99 times. Merged at 16 different actions 46 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 21 variables. [2018-01-24 15:51:31,395 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:51:31,395 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:31,395 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:51:31,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:31,406 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:31,430 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:31,434 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:31,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:31,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:51:31,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:51:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 15:51:31,588 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:31,812 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 15:51:31,832 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:31,832 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 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 14 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:51:31,836 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:31,836 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:31,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:31,877 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:31,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:31,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:51:31,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:51:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 15:51:31,964 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 15:51:31,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:51:31,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6, 7, 6] total 18 [2018-01-24 15:51:31,990 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:51:31,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 15:51:31,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 15:51:31,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-01-24 15:51:31,991 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 14 states. [2018-01-24 15:51:32,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:32,444 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2018-01-24 15:51:32,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 15:51:32,445 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2018-01-24 15:51:32,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:32,446 INFO L225 Difference]: With dead ends: 141 [2018-01-24 15:51:32,446 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 15:51:32,447 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 194 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2018-01-24 15:51:32,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 15:51:32,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 102. [2018-01-24 15:51:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-24 15:51:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-01-24 15:51:32,458 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 53 [2018-01-24 15:51:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:32,459 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-01-24 15:51:32,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 15:51:32,459 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-01-24 15:51:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-24 15:51:32,460 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:32,461 INFO L322 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:32,461 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:32,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1320798415, now seen corresponding path program 2 times [2018-01-24 15:51:32,461 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:32,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:32,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:32,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:32,462 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:32,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:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-24 15:51:32,549 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:32,549 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:32,550 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:51:32,550 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:32,550 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:32,550 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:51:32,555 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:51:32,555 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:51:32,563 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:51:32,564 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:51:32,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:32,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:51:32,584 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:32,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:32,586 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:32,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 15:51:32,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:51:32,623 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:32,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:32,625 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:32,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 15:51:32,650 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:51:32,651 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:32,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:32,652 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:32,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 15:51:32,676 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:51:32,676 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:32,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:32,678 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:32,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 15:51:32,699 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~3.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_~#mask~3.base| 0)) (= 0 (select |c_old(#valid)| |main_~#mask~3.base|)))) is different from true [2018-01-24 15:51:32,716 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-01-24 15:51:32,717 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:32,735 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_~#mask~3.base_21| Int)) (or (= (store |c_#valid| |v_main_~#mask~3.base_21| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_~#mask~3.base_21|))))) is different from false [2018-01-24 15:51:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-01-24 15:51:32,763 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:51:32,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [7] total 13 [2018-01-24 15:51:32,764 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:32,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:51:32,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:51:32,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=81, Unknown=2, NotChecked=38, Total=156 [2018-01-24 15:51:32,764 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 6 states. [2018-01-24 15:51:32,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:32,827 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2018-01-24 15:51:32,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:51:32,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-01-24 15:51:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:32,827 INFO L225 Difference]: With dead ends: 103 [2018-01-24 15:51:32,828 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 15:51:32,828 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 158 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=120, Unknown=2, NotChecked=46, Total=210 [2018-01-24 15:51:32,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 15:51:32,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 15:51:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 15:51:32,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 15:51:32,829 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2018-01-24 15:51:32,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:32,829 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 15:51:32,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:51:32,829 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 15:51:32,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 15:51:32,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 15:51:33,171 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 55 DAG size of output 38 [2018-01-24 15:51:33,633 WARN L146 SmtUtils]: Spent 374ms on a formula simplification. DAG size of input: 100 DAG size of output 58 [2018-01-24 15:51:33,702 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-24 15:51:33,702 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 15:51:33,702 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-24 15:51:33,703 INFO L401 ceAbstractionStarter]: For program point fooFINAL(lines 12 19) no Hoare annotation was computed. [2018-01-24 15:51:33,703 INFO L401 ceAbstractionStarter]: For program point L15''''(lines 15 17) no Hoare annotation was computed. [2018-01-24 15:51:33,703 INFO L401 ceAbstractionStarter]: For program point fooEXIT(lines 12 19) no Hoare annotation was computed. [2018-01-24 15:51:33,703 INFO L404 ceAbstractionStarter]: At program point fooENTRY(lines 12 19) the Hoare annotation is: true [2018-01-24 15:51:33,703 INFO L401 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-24 15:51:33,703 INFO L397 ceAbstractionStarter]: At program point L15'''(lines 15 17) the Hoare annotation is: (let ((.cse0 (not (= 0 |foo_#in~b.offset|))) (.cse4 (not (= 32 (select |#length| |foo_#in~b.base|)))) (.cse10 (select |#valid| 0))) (let ((.cse2 (= foo_~i~1 0)) (.cse1 (not (= (select |#valid| |foo_#in~b.base|) 1))) (.cse3 (not (= .cse10 |foo_#in~b.offset|))) (.cse11 (or .cse0 .cse4))) (and (or .cse0 .cse1 (not (= 0 |foo_#in~size|)) (and (= foo_~size 0) .cse2) .cse3 .cse4) (let ((.cse5 (<= foo_~size 1))) (or .cse1 (and .cse5 .cse2) .cse0 (and .cse5 (= 1 foo_~i~1)) (< 1 |foo_#in~size|) .cse3 .cse4)) (let ((.cse6 (= (select |#length| foo_~b.base) 32)) (.cse7 (= (select |#valid| foo_~b.base) 1)) (.cse8 (<= foo_~size 31)) (.cse9 (= foo_~b.offset 0))) (or (and .cse6 .cse7 .cse8 .cse9 (<= 1 foo_~i~1)) (< 31 |foo_#in~size|) .cse1 .cse3 (and (<= |foo_#in~size| foo_~size) .cse6 (= .cse10 foo_~i~1) .cse7 .cse8 .cse9) .cse11)) (or (<= foo_~size 2) .cse1 (< 2 |foo_#in~size|) .cse3 .cse11)))) [2018-01-24 15:51:33,703 INFO L401 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-01-24 15:51:33,703 INFO L401 ceAbstractionStarter]: For program point L15(lines 15 17) no Hoare annotation was computed. [2018-01-24 15:51:33,703 INFO L401 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-24 15:51:33,703 INFO L401 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-01-24 15:51:33,703 INFO L401 ceAbstractionStarter]: For program point L15''(lines 15 17) no Hoare annotation was computed. [2018-01-24 15:51:33,704 INFO L401 ceAbstractionStarter]: For program point L16''(line 16) no Hoare annotation was computed. [2018-01-24 15:51:33,704 INFO L401 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 16) no Hoare annotation was computed. [2018-01-24 15:51:33,704 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 35) the Hoare annotation is: true [2018-01-24 15:51:33,704 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-24 15:51:33,704 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 35) the Hoare annotation is: (= 0 (select |#valid| 0)) [2018-01-24 15:51:33,704 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-24 15:51:33,704 INFO L401 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 27) no Hoare annotation was computed. [2018-01-24 15:51:33,704 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 21 35) no Hoare annotation was computed. [2018-01-24 15:51:33,704 INFO L401 ceAbstractionStarter]: For program point mainErr1AssertViolation(line 30) no Hoare annotation was computed. [2018-01-24 15:51:33,704 INFO L401 ceAbstractionStarter]: For program point L25(lines 25 28) no Hoare annotation was computed. [2018-01-24 15:51:33,705 INFO L401 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-01-24 15:51:33,705 INFO L401 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-24 15:51:33,705 INFO L397 ceAbstractionStarter]: At program point L25'''(lines 25 28) the Hoare annotation is: (let ((.cse0 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse1 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse2 (= 0 |main_~#mask~3.offset|))) (or (not (= 0 (select |old(#valid)| 0))) (and (= 32 (select |#length| |main_~#mask~3.base|)) (= |main_~#mask~3.offset| (select |#valid| 0)) .cse0 (= main_~i~3 0) .cse1 .cse2) (and (= main_~c~3.base |main_~#mask~3.base|) .cse0 .cse1 .cse2 (<= 1 main_~i~3) (not (= 0 |main_~#mask~3.base|)) (= (select |#length| main_~c~3.base) 32) (= main_~c~3.offset 0)))) [2018-01-24 15:51:33,705 INFO L401 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-01-24 15:51:33,705 INFO L401 ceAbstractionStarter]: For program point L24''''(line 24) no Hoare annotation was computed. [2018-01-24 15:51:33,705 INFO L397 ceAbstractionStarter]: At program point L27'(line 27) the Hoare annotation is: (let ((.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse0 (= main_~c~3.base |main_~#mask~3.base|)) (.cse4 (not (= 0 |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~c~3.offset (select |#valid| 0)) .cse4 (= 0 main_~i~3) (= 32 (select |#length| main_~c~3.base))) (and .cse1 (and .cse0 (and (<= 1 main_~i~3) (= 32 (select |#length| |main_~#mask~3.base|))) .cse4 .cse3) .cse2 (= 0 main_~c~3.offset) (<= main_~i~3 31)) (not (= 0 (select |old(#valid)| 0))))) [2018-01-24 15:51:33,705 INFO L401 ceAbstractionStarter]: For program point L24'''''(line 24) no Hoare annotation was computed. [2018-01-24 15:51:33,706 INFO L397 ceAbstractionStarter]: At program point L29'''(lines 29 33) the Hoare annotation is: (let ((.cse0 (= main_~c~3.base |main_~#mask~3.base|)) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|)) (.cse4 (not (= 0 |main_~#mask~3.base|))) (.cse5 (select |#length| main_~c~3.base))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~c~3.offset (select |#valid| 0)) .cse4 (= 0 main_~i~3) (= 32 .cse5)) (not (= 0 (select |old(#valid)| 0))) (and .cse0 .cse1 .cse2 .cse3 (<= 1 main_~i~3) .cse4 (= .cse5 32) (= main_~c~3.offset 0)))) [2018-01-24 15:51:33,706 INFO L401 ceAbstractionStarter]: For program point L25''''(lines 25 28) no Hoare annotation was computed. [2018-01-24 15:51:33,706 INFO L401 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-24 15:51:33,706 INFO L401 ceAbstractionStarter]: For program point L24''(line 24) no Hoare annotation was computed. [2018-01-24 15:51:33,706 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 21 35) no Hoare annotation was computed. [2018-01-24 15:51:33,706 INFO L401 ceAbstractionStarter]: For program point L25''(lines 25 28) no Hoare annotation was computed. [2018-01-24 15:51:33,706 INFO L401 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-01-24 15:51:33,706 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-01-24 15:51:33,706 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: (or (not (= 0 (select |old(#valid)| 0))) (= |#valid| |old(#valid)|)) [2018-01-24 15:51:33,707 INFO L401 ceAbstractionStarter]: For program point L24'''(line 24) no Hoare annotation was computed. [2018-01-24 15:51:33,707 INFO L401 ceAbstractionStarter]: For program point L29''''(lines 29 33) no Hoare annotation was computed. [2018-01-24 15:51:33,707 INFO L401 ceAbstractionStarter]: For program point L29''(lines 29 33) no Hoare annotation was computed. [2018-01-24 15:51:33,707 INFO L401 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-01-24 15:51:33,707 INFO L401 ceAbstractionStarter]: For program point L24'(line 24) no Hoare annotation was computed. [2018-01-24 15:51:33,707 INFO L401 ceAbstractionStarter]: For program point L30'(lines 30 32) no Hoare annotation was computed. [2018-01-24 15:51:33,714 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,715 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,719 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,719 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,728 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,728 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,729 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,729 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,730 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,730 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:51:33 BoogieIcfgContainer [2018-01-24 15:51:33,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:51:33,733 INFO L168 Benchmark]: Toolchain (without parser) took 15092.20 ms. Allocated memory was 302.5 MB in the beginning and 771.2 MB in the end (delta: 468.7 MB). Free memory was 261.4 MB in the beginning and 369.2 MB in the end (delta: -107.8 MB). Peak memory consumption was 360.9 MB. Max. memory is 5.3 GB. [2018-01-24 15:51:33,734 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 302.5 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:51:33,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 182.21 ms. Allocated memory is still 302.5 MB. Free memory was 260.4 MB in the beginning and 252.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:51:33,734 INFO L168 Benchmark]: Boogie Preprocessor took 34.74 ms. Allocated memory is still 302.5 MB. Free memory was 252.4 MB in the beginning and 250.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:51:33,735 INFO L168 Benchmark]: RCFGBuilder took 209.15 ms. Allocated memory is still 302.5 MB. Free memory was 250.4 MB in the beginning and 234.4 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:51:33,735 INFO L168 Benchmark]: TraceAbstraction took 14657.94 ms. Allocated memory was 302.5 MB in the beginning and 771.2 MB in the end (delta: 468.7 MB). Free memory was 234.4 MB in the beginning and 369.2 MB in the end (delta: -134.8 MB). Peak memory consumption was 333.9 MB. Max. memory is 5.3 GB. [2018-01-24 15:51:33,737 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.19 ms. Allocated memory is still 302.5 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 182.21 ms. Allocated memory is still 302.5 MB. Free memory was 260.4 MB in the beginning and 252.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.74 ms. Allocated memory is still 302.5 MB. Free memory was 252.4 MB in the beginning and 250.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 209.15 ms. Allocated memory is still 302.5 MB. Free memory was 250.4 MB in the beginning and 234.4 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 14657.94 ms. Allocated memory was 302.5 MB in the beginning and 771.2 MB in the end (delta: 468.7 MB). Free memory was 234.4 MB in the beginning and 369.2 MB in the end (delta: -134.8 MB). Peak memory consumption was 333.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 160 LocStat_NO_SUPPORTING_DISEQUALITIES : 30 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 27 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 34 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.410350 RENAME_VARIABLES(MILLISECONDS) : 0.259266 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.355698 PROJECTAWAY(MILLISECONDS) : 0.304585 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.150820 DISJOIN(MILLISECONDS) : 0.371991 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.293768 ADD_EQUALITY(MILLISECONDS) : 0.058219 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.041565 #CONJOIN_DISJUNCTIVE : 95 #RENAME_VARIABLES : 231 #UNFREEZE : 0 #CONJOIN : 175 #PROJECTAWAY : 158 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 27 #RENAME_VARIABLES_DISJUNCTIVE : 224 #ADD_EQUALITY : 34 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 176 LocStat_NO_SUPPORTING_DISEQUALITIES : 32 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 34 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.963743 RENAME_VARIABLES(MILLISECONDS) : 0.095297 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.927541 PROJECTAWAY(MILLISECONDS) : 0.217141 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.135260 DISJOIN(MILLISECONDS) : 0.241847 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.112935 ADD_EQUALITY(MILLISECONDS) : 0.052199 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.033859 #CONJOIN_DISJUNCTIVE : 96 #RENAME_VARIABLES : 230 #UNFREEZE : 0 #CONJOIN : 173 #PROJECTAWAY : 157 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 32 #RENAME_VARIABLES_DISJUNCTIVE : 226 #ADD_EQUALITY : 34 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 188 LocStat_NO_SUPPORTING_DISEQUALITIES : 34 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 34 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.198535 RENAME_VARIABLES(MILLISECONDS) : 0.153213 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.158861 PROJECTAWAY(MILLISECONDS) : 0.297497 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.088644 DISJOIN(MILLISECONDS) : 0.368241 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.177349 ADD_EQUALITY(MILLISECONDS) : 0.039054 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010804 #CONJOIN_DISJUNCTIVE : 100 #RENAME_VARIABLES : 238 #UNFREEZE : 0 #CONJOIN : 177 #PROJECTAWAY : 162 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 35 #RENAME_VARIABLES_DISJUNCTIVE : 234 #ADD_EQUALITY : 34 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 176 LocStat_NO_SUPPORTING_DISEQUALITIES : 32 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 32 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.274165 RENAME_VARIABLES(MILLISECONDS) : 0.141293 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.234416 PROJECTAWAY(MILLISECONDS) : 0.286820 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.083430 DISJOIN(MILLISECONDS) : 0.271619 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.164712 ADD_EQUALITY(MILLISECONDS) : 0.036755 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.025387 #CONJOIN_DISJUNCTIVE : 100 #RENAME_VARIABLES : 234 #UNFREEZE : 0 #CONJOIN : 173 #PROJECTAWAY : 153 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 28 #RENAME_VARIABLES_DISJUNCTIVE : 234 #ADD_EQUALITY : 32 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 222 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 38 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.651663 RENAME_VARIABLES(MILLISECONDS) : 0.222504 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.626818 PROJECTAWAY(MILLISECONDS) : 0.155696 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.083888 DISJOIN(MILLISECONDS) : 0.245690 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.247892 ADD_EQUALITY(MILLISECONDS) : 0.024626 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.026538 #CONJOIN_DISJUNCTIVE : 123 #RENAME_VARIABLES : 269 #UNFREEZE : 0 #CONJOIN : 190 #PROJECTAWAY : 190 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 29 #RENAME_VARIABLES_DISJUNCTIVE : 263 #ADD_EQUALITY : 38 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 29 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 226 LocStat_NO_SUPPORTING_DISEQUALITIES : 56 LocStat_NO_DISJUNCTIONS : -58 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 36 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 36 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 36 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.088159 RENAME_VARIABLES(MILLISECONDS) : 0.126778 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.057007 PROJECTAWAY(MILLISECONDS) : 0.819750 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.072170 DISJOIN(MILLISECONDS) : 0.229004 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.149794 ADD_EQUALITY(MILLISECONDS) : 0.033593 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010943 #CONJOIN_DISJUNCTIVE : 142 #RENAME_VARIABLES : 318 #UNFREEZE : 0 #CONJOIN : 215 #PROJECTAWAY : 202 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 31 #RENAME_VARIABLES_DISJUNCTIVE : 318 #ADD_EQUALITY : 36 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 33 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 268 LocStat_NO_SUPPORTING_DISEQUALITIES : 64 LocStat_NO_DISJUNCTIONS : -66 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 41 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 40 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.762345 RENAME_VARIABLES(MILLISECONDS) : 0.218250 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.732644 PROJECTAWAY(MILLISECONDS) : 0.150547 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.062977 DISJOIN(MILLISECONDS) : 0.201770 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.244856 ADD_EQUALITY(MILLISECONDS) : 0.023874 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008683 #CONJOIN_DISJUNCTIVE : 167 #RENAME_VARIABLES : 367 #UNFREEZE : 0 #CONJOIN : 246 #PROJECTAWAY : 242 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 35 #RENAME_VARIABLES_DISJUNCTIVE : 367 #ADD_EQUALITY : 40 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 217 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 38 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.599388 RENAME_VARIABLES(MILLISECONDS) : 0.195834 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.575081 PROJECTAWAY(MILLISECONDS) : 0.114595 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.070465 DISJOIN(MILLISECONDS) : 0.214176 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.218598 ADD_EQUALITY(MILLISECONDS) : 0.017649 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008019 #CONJOIN_DISJUNCTIVE : 131 #RENAME_VARIABLES : 301 #UNFREEZE : 0 #CONJOIN : 216 #PROJECTAWAY : 207 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 31 #RENAME_VARIABLES_DISJUNCTIVE : 295 #ADD_EQUALITY : 38 #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 - 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: 16]: 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: 27]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 30]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant [2018-01-24 15:51:33,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,751 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,751 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((c == mask && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) && c == \valid[0]) && !(0 == mask)) && 0 == i) && 32 == unknown-#length-unknown[c]) || !(0 == \old(\valid)[0])) || (((((((c == mask && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) && 1 <= i) && !(0 == mask)) && unknown-#length-unknown[c] == 32) && c == 0) - InvariantResult [Line: 15]: Loop Invariant [2018-01-24 15:51:33,754 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,754 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,754 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,755 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,755 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,755 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,758 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,758 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,758 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,758 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,759 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,759 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((!(0 == b) || !(\valid[b] == 1)) || !(0 == \old(size))) || (size == 0 && i == 0)) || !(\valid[0] == b)) || !(32 == unknown-#length-unknown[b])) && ((((((!(\valid[b] == 1) || (size <= 1 && i == 0)) || !(0 == b)) || (size <= 1 && 1 == i)) || 1 < \old(size)) || !(\valid[0] == b)) || !(32 == unknown-#length-unknown[b]))) && (((((((((unknown-#length-unknown[b] == 32 && \valid[b] == 1) && size <= 31) && b == 0) && 1 <= i) || 31 < \old(size)) || !(\valid[b] == 1)) || !(\valid[0] == b)) || (((((\old(size) <= size && unknown-#length-unknown[b] == 32) && \valid[0] == i) && \valid[b] == 1) && size <= 31) && b == 0)) || !(0 == b) || !(32 == unknown-#length-unknown[b]))) && ((((size <= 2 || !(\valid[b] == 1)) || 2 < \old(size)) || !(\valid[0] == b)) || !(0 == b) || !(32 == unknown-#length-unknown[b])) - InvariantResult [Line: 25]: Loop Invariant [2018-01-24 15:51:33,760 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,760 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,761 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:33,762 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (!(0 == \old(\valid)[0]) || (((((32 == unknown-#length-unknown[mask] && mask == \valid[0]) && \old(\valid)[mask := 1] == \valid) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask)) || (((((((c == mask && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) && 1 <= i) && !(0 == mask)) && unknown-#length-unknown[c] == 32) && c == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. SAFE Result, 14.5s OverallTime, 12 OverallIterations, 7 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 418 SDtfs, 935 SDslu, 1303 SDs, 0 SdLazy, 1073 SolverSat, 158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1355 GetRequests, 1157 SyntacticMatches, 41 SemanticMatches, 157 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.8s AbstIntTime, 8 AbstIntIterations, 1 AbstIntStrong, 0.854363790970934 AbsIntWeakeningRatio, 1.1785714285714286 AbsIntAvgWeakeningVarsNumRemoved, 5.357142857142857 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 202 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 23 PreInvPairs, 41 NumberOfFragments, 423 HoareAnnotationTreeSize, 23 FomulaSimplifications, 1004 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1813 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1065 NumberOfCodeBlocks, 999 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1638 ConstructedInterpolants, 94 QuantifiedInterpolants, 323474 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1631 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 40 InterpolantComputations, 10 PerfectInterpolantSequences, 860/1116 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/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-51-33-766.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-51-33-766.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-51-33-766.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-51-33-766.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-51-33-766.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_15-51-33-766.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_15-51-33-766.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_15-51-33-766.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_15-51-33-766.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-24_15-51-33-766.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-24_15-51-33-766.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-5-2018-01-24_15-51-33-766.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-5-2018-01-24_15-51-33-766.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-6-2018-01-24_15-51-33-766.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-6-2018-01-24_15-51-33-766.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-7-2018-01-24_15-51-33-766.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-7-2018-01-24_15-51-33-766.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-51-33-766.csv Received shutdown request...