java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:15:18,963 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:15:18,965 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:15:18,980 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:15:18,981 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:15:18,982 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:15:18,983 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:15:18,984 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:15:18,986 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:15:18,987 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:15:18,988 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:15:18,988 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:15:18,990 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:15:18,991 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:15:18,992 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:15:18,994 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:15:18,997 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:15:18,998 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:15:19,000 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:15:19,001 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:15:19,003 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:15:19,003 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:15:19,004 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:15:19,005 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:15:19,005 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:15:19,007 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:15:19,007 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:15:19,007 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:15:19,008 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:15:19,008 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:15:19,008 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:15:19,009 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 17:15:19,018 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:15:19,019 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:15:19,020 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:15:19,020 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:15:19,020 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:15:19,020 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:15:19,020 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:15:19,020 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:15:19,021 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:15:19,021 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:15:19,022 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:15:19,022 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:15:19,022 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:15:19,022 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:15:19,022 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:15:19,023 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:15:19,023 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:15:19,023 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:15:19,023 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:15:19,023 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:15:19,024 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:15:19,024 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:15:19,024 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:15:19,024 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:15:19,024 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:15:19,025 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:15:19,025 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:15:19,025 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:15:19,025 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:15:19,025 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:15:19,025 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:15:19,026 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:15:19,026 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:15:19,026 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:15:19,027 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:15:19,027 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:15:19,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:15:19,073 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:15:19,077 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:15:19,079 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:15:19,079 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:15:19,080 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 17:15:19,204 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:15:19,210 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:15:19,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:15:19,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:15:19,217 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:15:19,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:15:19" (1/1) ... [2018-01-24 17:15:19,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f1777f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:19, skipping insertion in model container [2018-01-24 17:15:19,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:15:19" (1/1) ... [2018-01-24 17:15:19,241 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:15:19,260 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:15:19,384 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:15:19,399 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:15:19,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:19 WrapperNode [2018-01-24 17:15:19,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:15:19,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:15:19,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:15:19,406 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:15:19,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:19" (1/1) ... [2018-01-24 17:15:19,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:19" (1/1) ... [2018-01-24 17:15:19,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:19" (1/1) ... [2018-01-24 17:15:19,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:19" (1/1) ... [2018-01-24 17:15:19,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:19" (1/1) ... [2018-01-24 17:15:19,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:19" (1/1) ... [2018-01-24 17:15:19,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:19" (1/1) ... [2018-01-24 17:15:19,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:15:19,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:15:19,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:15:19,433 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:15:19,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:19" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:15:19,485 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:15:19,485 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:15:19,485 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 17:15:19,485 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:15:19,485 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 17:15:19,486 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 17:15:19,486 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:15:19,486 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:15:19,486 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:15:19,486 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 17:15:19,486 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:15:19,486 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:15:19,486 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:15:19,645 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:15:19,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:15:19 BoogieIcfgContainer [2018-01-24 17:15:19,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:15:19,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:15:19,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:15:19,649 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:15:19,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:15:19" (1/3) ... [2018-01-24 17:15:19,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f34cce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:15:19, skipping insertion in model container [2018-01-24 17:15:19,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:15:19" (2/3) ... [2018-01-24 17:15:19,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f34cce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:15:19, skipping insertion in model container [2018-01-24 17:15:19,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:15:19" (3/3) ... [2018-01-24 17:15:19,653 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c [2018-01-24 17:15:19,662 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:15:19,669 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-24 17:15:19,709 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:15:19,709 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:15:19,710 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:15:19,710 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:15:19,710 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:15:19,710 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:15:19,710 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:15:19,710 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:15:19,711 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:15:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 17:15:19,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 17:15:19,738 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:19,739 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:15:19,739 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 17:15:19,744 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-01-24 17:15:19,747 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:19,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:19,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:19,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:19,787 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:19,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:15:19,904 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:15:19,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:15:19,905 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:15:19,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:15:19,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:15:19,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:15:19,926 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-24 17:15:20,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:20,008 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-01-24 17:15:20,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:15:20,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-24 17:15:20,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:20,017 INFO L225 Difference]: With dead ends: 101 [2018-01-24 17:15:20,017 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 17:15:20,020 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 17:15:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 17:15:20,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-01-24 17:15:20,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 17:15:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-24 17:15:20,117 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-01-24 17:15:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:20,118 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-24 17:15:20,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:15:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-24 17:15:20,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 17:15:20,119 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:20,119 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:15:20,119 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 17:15:20,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-01-24 17:15:20,119 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:20,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:20,120 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:20,121 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:20,121 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:20,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:15:20,209 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:15:20,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:15:20,210 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:15:20,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:15:20,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:15:20,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:15:20,212 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-01-24 17:15:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:20,460 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-01-24 17:15:20,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:15:20,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 17:15:20,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:20,462 INFO L225 Difference]: With dead ends: 103 [2018-01-24 17:15:20,462 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 17:15:20,464 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:15:20,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 17:15:20,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-01-24 17:15:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 17:15:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-24 17:15:20,473 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 16 [2018-01-24 17:15:20,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:20,473 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-24 17:15:20,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:15:20,474 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-24 17:15:20,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:15:20,475 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:20,475 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 17:15:20,475 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 17:15:20,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-01-24 17:15:20,476 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:20,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:20,477 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:20,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:20,477 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:20,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:20,546 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 17:15:20,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:20,547 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:15:20,548 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 17:15:20,549 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 17:15:20,605 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:15:20,605 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:15:20,844 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:15:20,845 INFO L268 AbstractInterpreter]: Visited 21 different actions 46 times. Merged at 7 different actions 13 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2018-01-24 17:15:20,857 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:15:20,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:20,857 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:15:20,871 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:20,872 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:15:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:20,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:20,924 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 17:15:20,924 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:20,963 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 17:15:20,983 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:15:20,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2018-01-24 17:15:20,984 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:15:20,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:15:20,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:15:20,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:15:20,985 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-01-24 17:15:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:21,049 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-01-24 17:15:21,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:15:21,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-24 17:15:21,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:21,051 INFO L225 Difference]: With dead ends: 67 [2018-01-24 17:15:21,051 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 17:15:21,051 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:15:21,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 17:15:21,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-01-24 17:15:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 17:15:21,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-01-24 17:15:21,057 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 23 [2018-01-24 17:15:21,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:21,057 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-01-24 17:15:21,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:15:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-01-24 17:15:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:15:21,058 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:21,058 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 17:15:21,058 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 17:15:21,058 INFO L82 PathProgramCache]: Analyzing trace with hash 621927392, now seen corresponding path program 1 times [2018-01-24 17:15:21,058 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:21,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:21,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:21,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:21,060 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:21,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:21,142 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 17:15:21,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:21,142 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:15:21,142 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 17:15:21,142 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 17:15:21,144 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:15:21,144 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:15:21,257 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:15:21,257 INFO L268 AbstractInterpreter]: Visited 22 different actions 49 times. Merged at 6 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2018-01-24 17:15:21,260 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:15:21,260 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:21,260 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:15:21,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:21,274 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:15:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:21,305 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:21,316 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 17:15:21,317 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:21,344 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 17:15:21,364 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:15:21,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [6] total 7 [2018-01-24 17:15:21,365 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:15:21,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:15:21,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:15:21,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:15:21,365 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 3 states. [2018-01-24 17:15:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:21,409 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-01-24 17:15:21,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:15:21,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-24 17:15:21,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:21,413 INFO L225 Difference]: With dead ends: 65 [2018-01-24 17:15:21,413 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 17:15:21,414 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:15:21,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 17:15:21,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-01-24 17:15:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 17:15:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-24 17:15:21,420 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 28 [2018-01-24 17:15:21,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:21,420 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-24 17:15:21,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:15:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-24 17:15:21,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 17:15:21,421 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:21,421 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 17:15:21,421 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 17:15:21,422 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880015, now seen corresponding path program 1 times [2018-01-24 17:15:21,422 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:21,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:21,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:21,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:21,423 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:21,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:21,623 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 17:15:21,624 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:21,624 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:15:21,624 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 17:15:21,624 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 17:15:21,626 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:15:21,627 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:15:21,735 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:15:21,735 INFO L268 AbstractInterpreter]: Visited 23 different actions 52 times. Merged at 6 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2018-01-24 17:15:21,755 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:15:21,755 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:21,756 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 17:15:21,763 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:21,763 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:15:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:21,783 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:21,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:15:21,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:15:21,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:15:21,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 17:15:21,884 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 17:15:21,884 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:21,993 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 17:15:22,013 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:22,013 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 17:15:22,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:22,019 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:15:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:22,056 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:22,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:15:22,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:15:22,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:15:22,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 17:15:22,147 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 17:15:22,148 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:22,165 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 17:15:22,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:15:22,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5, 6, 5] total 15 [2018-01-24 17:15:22,167 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:15:22,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 17:15:22,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 17:15:22,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-01-24 17:15:22,169 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 12 states. [2018-01-24 17:15:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:22,415 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-01-24 17:15:22,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 17:15:22,450 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-01-24 17:15:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:22,452 INFO L225 Difference]: With dead ends: 127 [2018-01-24 17:15:22,452 INFO L226 Difference]: Without dead ends: 110 [2018-01-24 17:15:22,453 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-01-24 17:15:22,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-24 17:15:22,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 66. [2018-01-24 17:15:22,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-24 17:15:22,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-01-24 17:15:22,463 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 29 [2018-01-24 17:15:22,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:22,464 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-01-24 17:15:22,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 17:15:22,464 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-01-24 17:15:22,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 17:15:22,465 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:22,465 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 17:15:22,465 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 17:15:22,466 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880014, now seen corresponding path program 1 times [2018-01-24 17:15:22,466 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:22,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:22,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:22,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:22,467 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:22,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:22,555 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 17:15:22,555 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:22,555 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:15:22,556 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 17:15:22,556 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 17:15:22,557 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:15:22,557 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:15:22,657 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 17:15:22,657 INFO L268 AbstractInterpreter]: Visited 23 different actions 52 times. Merged at 6 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2018-01-24 17:15:22,661 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 17:15:22,738 INFO L232 lantSequenceWeakener]: Weakened 28 states. On average, predicates are now at 69.8% of their original sizes. [2018-01-24 17:15:22,738 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 17:15:22,785 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 17:15:22,786 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:15:22,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 15 [2018-01-24 17:15:22,786 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:15:22,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 17:15:22,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 17:15:22,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-01-24 17:15:22,787 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 12 states. [2018-01-24 17:15:23,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:23,256 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-01-24 17:15:23,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:15:23,257 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-01-24 17:15:23,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:23,258 INFO L225 Difference]: With dead ends: 72 [2018-01-24 17:15:23,258 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 17:15:23,258 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-01-24 17:15:23,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 17:15:23,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-01-24 17:15:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-24 17:15:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-01-24 17:15:23,268 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 29 [2018-01-24 17:15:23,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:23,268 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-01-24 17:15:23,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 17:15:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-01-24 17:15:23,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 17:15:23,269 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:23,269 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 17:15:23,269 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 17:15:23,270 INFO L82 PathProgramCache]: Analyzing trace with hash -533212584, now seen corresponding path program 1 times [2018-01-24 17:15:23,270 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:23,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:23,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:23,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:23,271 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:23,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:23,366 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 17:15:23,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:23,366 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:15:23,366 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-24 17:15:23,367 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 17:15:23,368 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:15:23,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:15:23,530 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:15:23,530 INFO L268 AbstractInterpreter]: Visited 26 different actions 98 times. Merged at 16 different actions 45 times. Never widened. Found 7 fixpoints after 4 different actions. Largest state had 21 variables. [2018-01-24 17:15:23,551 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:15:23,552 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:23,552 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 17:15:23,559 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:23,559 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:15:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:23,581 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:23,662 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 17:15:23,662 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:23,710 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 17:15:23,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:23,729 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 17:15:23,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:23,732 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:15:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:23,757 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:23,764 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 17:15:23,765 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:23,800 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 17:15:23,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:15:23,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7, 7, 7] total 15 [2018-01-24 17:15:23,802 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:15:23,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 17:15:23,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 17:15:23,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-01-24 17:15:23,803 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 15 states. [2018-01-24 17:15:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:23,956 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2018-01-24 17:15:23,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 17:15:23,956 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-24 17:15:23,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:23,957 INFO L225 Difference]: With dead ends: 140 [2018-01-24 17:15:23,957 INFO L226 Difference]: Without dead ends: 97 [2018-01-24 17:15:23,958 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 125 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-01-24 17:15:23,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-24 17:15:23,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2018-01-24 17:15:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 17:15:23,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-24 17:15:23,968 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 34 [2018-01-24 17:15:23,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:23,969 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-24 17:15:23,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 17:15:23,969 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-24 17:15:23,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 17:15:23,970 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:23,970 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 17:15:23,971 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 17:15:23,971 INFO L82 PathProgramCache]: Analyzing trace with hash -2137316393, now seen corresponding path program 1 times [2018-01-24 17:15:23,971 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:23,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:23,972 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:23,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:23,972 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:23,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:24,014 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 17:15:24,015 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:24,015 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:15:24,015 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-01-24 17:15:24,015 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 17:15:24,016 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:15:24,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:15:24,117 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:15:24,117 INFO L268 AbstractInterpreter]: Visited 30 different actions 69 times. Merged at 16 different actions 26 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 18 variables. [2018-01-24 17:15:24,119 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:15:24,119 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:24,119 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:15:24,131 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:24,131 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:15:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:24,152 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:24,191 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 17:15:24,192 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:24,270 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 17:15:24,290 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:15:24,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [5] total 10 [2018-01-24 17:15:24,290 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:15:24,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:15:24,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:15:24,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:15:24,291 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 6 states. [2018-01-24 17:15:24,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:24,365 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2018-01-24 17:15:24,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:15:24,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-24 17:15:24,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:24,366 INFO L225 Difference]: With dead ends: 135 [2018-01-24 17:15:24,366 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 17:15:24,367 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 17:15:24,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 17:15:24,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2018-01-24 17:15:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 17:15:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-01-24 17:15:24,377 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 43 [2018-01-24 17:15:24,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:24,377 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-01-24 17:15:24,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:15:24,377 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-01-24 17:15:24,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-24 17:15:24,378 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:24,379 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 17:15:24,379 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 17:15:24,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1584033375, now seen corresponding path program 1 times [2018-01-24 17:15:24,379 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:24,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:24,380 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:24,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:24,380 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:24,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:24,425 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 17:15:24,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:24,426 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:15:24,426 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-01-24 17:15:24,426 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 17:15:24,428 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:15:24,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:15:24,601 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:15:24,602 INFO L268 AbstractInterpreter]: Visited 35 different actions 118 times. Merged at 25 different actions 57 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 21 variables. [2018-01-24 17:15:24,627 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:15:24,627 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:24,627 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:15:24,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:24,637 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:15:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:24,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:24,674 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 17:15:24,674 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:24,721 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 17:15:24,752 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:24,752 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:15:24,756 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:24,757 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:15:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:24,799 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:24,805 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 17:15:24,805 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:24,846 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 17:15:24,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:15:24,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-24 17:15:24,848 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:15:24,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:15:24,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:15:24,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:15:24,849 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 6 states. [2018-01-24 17:15:24,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:24,946 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-01-24 17:15:24,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:15:24,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-01-24 17:15:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:24,948 INFO L225 Difference]: With dead ends: 131 [2018-01-24 17:15:24,948 INFO L226 Difference]: Without dead ends: 110 [2018-01-24 17:15:24,948 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 17:15:24,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-24 17:15:24,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 88. [2018-01-24 17:15:24,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 17:15:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-01-24 17:15:24,959 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 49 [2018-01-24 17:15:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:24,959 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-01-24 17:15:24,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:15:24,960 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-01-24 17:15:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 17:15:24,961 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:24,961 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 17:15:24,961 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 17:15:24,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1798255855, now seen corresponding path program 2 times [2018-01-24 17:15:24,961 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:24,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:24,962 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:24,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:24,962 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:24,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:25,105 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 17:15:25,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:25,105 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:15:25,105 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:15:25,106 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:15:25,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:25,106 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:15:25,114 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:15:25,114 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:15:25,124 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:15:25,132 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:15:25,144 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:15:25,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:25,256 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 17:15:25,256 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:25,416 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 17:15:25,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:25,436 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:15:25,440 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:15:25,440 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:15:25,450 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:15:25,464 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:15:25,476 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:15:25,480 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:25,488 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 17:15:25,488 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:25,520 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 17:15:25,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:15:25,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 22 [2018-01-24 17:15:25,522 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:15:25,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 17:15:25,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 17:15:25,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-01-24 17:15:25,523 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 16 states. [2018-01-24 17:15:25,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:25,873 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2018-01-24 17:15:25,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 17:15:25,873 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-01-24 17:15:25,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:25,874 INFO L225 Difference]: With dead ends: 162 [2018-01-24 17:15:25,874 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 17:15:25,875 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=1147, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 17:15:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 17:15:25,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 107. [2018-01-24 17:15:25,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-24 17:15:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-01-24 17:15:25,885 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 52 [2018-01-24 17:15:25,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:25,885 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-01-24 17:15:25,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 17:15:25,886 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-01-24 17:15:25,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-24 17:15:25,886 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:25,887 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 17:15:25,887 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 17:15:25,887 INFO L82 PathProgramCache]: Analyzing trace with hash -88643296, now seen corresponding path program 1 times [2018-01-24 17:15:25,887 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:25,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:25,888 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 17:15:25,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:25,888 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:25,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:26,076 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 17:15:26,076 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:26,076 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:15:26,076 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-01-24 17:15:26,076 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 17:15:26,077 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:15:26,077 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:15:26,212 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:15:26,213 INFO L268 AbstractInterpreter]: Visited 26 different actions 98 times. Merged at 16 different actions 45 times. Never widened. Found 7 fixpoints after 4 different actions. Largest state had 21 variables. [2018-01-24 17:15:26,220 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:15:26,220 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:26,220 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 17:15:26,242 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:26,242 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:15:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:26,270 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:26,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:15:26,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:15:26,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:15:26,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 17:15:26,392 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 17:15:26,393 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:26,507 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 17:15:26,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:26,536 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 17:15:26,539 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:26,539 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:15:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:26,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:26,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:15:26,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:15:26,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:15:26,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 17:15:26,638 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 17:15:26,638 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:26,656 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 17:15:26,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:15:26,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6, 7, 6] total 18 [2018-01-24 17:15:26,657 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:15:26,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 17:15:26,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 17:15:26,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-01-24 17:15:26,659 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 14 states. [2018-01-24 17:15:26,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:26,852 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2018-01-24 17:15:26,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 17:15:26,853 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2018-01-24 17:15:26,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:26,854 INFO L225 Difference]: With dead ends: 141 [2018-01-24 17:15:26,854 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 17:15:26,854 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 194 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2018-01-24 17:15:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 17:15:26,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 102. [2018-01-24 17:15:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-24 17:15:26,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-01-24 17:15:26,867 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 53 [2018-01-24 17:15:26,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:26,867 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-01-24 17:15:26,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 17:15:26,867 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-01-24 17:15:26,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-24 17:15:26,869 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:15:26,869 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 17:15:26,869 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 17:15:26,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1320798415, now seen corresponding path program 2 times [2018-01-24 17:15:26,869 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:15:26,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:26,870 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:15:26,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:15:26,871 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:15:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:15:26,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:15:26,986 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 17:15:26,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:26,987 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:15:26,987 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:15:26,987 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:15:26,987 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:15:26,987 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 17:15:26,995 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:15:26,996 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:15:27,005 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:15:27,006 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:15:27,008 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:15:27,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:15:27,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-24 17:15:27,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:15:27,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:15:27,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 17:15:27,045 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:15:27,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-24 17:15:27,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:15:27,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:15:27,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 17:15:27,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:15:27,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-24 17:15:27,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:15:27,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:15:27,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 17:15:27,111 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:15:27,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-24 17:15:27,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:15:27,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:15:27,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 17:15:27,138 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 17:15:27,156 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 17:15:27,156 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:15:27,189 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 17:15:27,196 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 17:15:27,216 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:15:27,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [7] total 13 [2018-01-24 17:15:27,216 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:15:27,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:15:27,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:15:27,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=81, Unknown=2, NotChecked=38, Total=156 [2018-01-24 17:15:27,217 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 6 states. [2018-01-24 17:15:27,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:15:27,264 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2018-01-24 17:15:27,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:15:27,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-01-24 17:15:27,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:15:27,265 INFO L225 Difference]: With dead ends: 103 [2018-01-24 17:15:27,265 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 17:15:27,265 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 17:15:27,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 17:15:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 17:15:27,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 17:15:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 17:15:27,266 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2018-01-24 17:15:27,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:15:27,266 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 17:15:27,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:15:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 17:15:27,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 17:15:27,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 17:15:27,739 WARN L146 SmtUtils]: Spent 303ms on a formula simplification. DAG size of input: 53 DAG size of output 36 [2018-01-24 17:15:28,091 WARN L146 SmtUtils]: Spent 269ms on a formula simplification. DAG size of input: 96 DAG size of output 58 [2018-01-24 17:15:28,160 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-24 17:15:28,160 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 17:15:28,160 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-24 17:15:28,160 INFO L401 ceAbstractionStarter]: For program point fooFINAL(lines 12 19) no Hoare annotation was computed. [2018-01-24 17:15:28,160 INFO L401 ceAbstractionStarter]: For program point L15''''(lines 15 17) no Hoare annotation was computed. [2018-01-24 17:15:28,160 INFO L401 ceAbstractionStarter]: For program point fooEXIT(lines 12 19) no Hoare annotation was computed. [2018-01-24 17:15:28,160 INFO L404 ceAbstractionStarter]: At program point fooENTRY(lines 12 19) the Hoare annotation is: true [2018-01-24 17:15:28,161 INFO L401 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-24 17:15:28,161 INFO L397 ceAbstractionStarter]: At program point L15'''(lines 15 17) the Hoare annotation is: (let ((.cse9 (not (= 0 |foo_#in~b.offset|))) (.cse10 (not (= 32 (select |#length| |foo_#in~b.base|))))) (let ((.cse4 (or .cse9 .cse10)) (.cse2 (= foo_~i~1 0)) (.cse0 (not (= (select |#valid| |foo_#in~b.base|) 1))) (.cse3 (not (= 0 (select |#valid| 0))))) (and (let ((.cse1 (<= foo_~size 1))) (or .cse0 (and .cse1 .cse2) (and .cse1 (= 1 foo_~i~1)) (< 1 |foo_#in~size|) .cse3 .cse4)) (or (<= foo_~size 2) .cse0 (< 2 |foo_#in~size|) .cse3 .cse4) (let ((.cse5 (= (select |#length| foo_~b.base) 32)) (.cse6 (= (select |#valid| foo_~b.base) 1)) (.cse7 (<= foo_~size 31)) (.cse8 (= foo_~b.offset 0))) (or (< 31 |foo_#in~size|) (and .cse5 .cse6 .cse7 .cse8 (<= 1 foo_~i~1)) .cse0 .cse3 (and (<= |foo_#in~size| foo_~size) .cse5 (= 0 foo_~i~1) .cse6 .cse7 .cse8) .cse4)) (or .cse9 (and (= foo_~size 0) .cse2) .cse0 (not (= 0 |foo_#in~size|)) .cse3 .cse10)))) [2018-01-24 17:15:28,161 INFO L401 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-01-24 17:15:28,161 INFO L401 ceAbstractionStarter]: For program point L15(lines 15 17) no Hoare annotation was computed. [2018-01-24 17:15:28,161 INFO L401 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-24 17:15:28,161 INFO L401 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-01-24 17:15:28,161 INFO L401 ceAbstractionStarter]: For program point L15''(lines 15 17) no Hoare annotation was computed. [2018-01-24 17:15:28,161 INFO L401 ceAbstractionStarter]: For program point L16''(line 16) no Hoare annotation was computed. [2018-01-24 17:15:28,161 INFO L401 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 16) no Hoare annotation was computed. [2018-01-24 17:15:28,161 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 35) the Hoare annotation is: true [2018-01-24 17:15:28,161 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-24 17:15:28,161 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 35) the Hoare annotation is: (= 0 (select |#valid| 0)) [2018-01-24 17:15:28,161 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-24 17:15:28,161 INFO L401 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 27) no Hoare annotation was computed. [2018-01-24 17:15:28,162 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 21 35) no Hoare annotation was computed. [2018-01-24 17:15:28,162 INFO L401 ceAbstractionStarter]: For program point mainErr1AssertViolation(line 30) no Hoare annotation was computed. [2018-01-24 17:15:28,162 INFO L401 ceAbstractionStarter]: For program point L25(lines 25 28) no Hoare annotation was computed. [2018-01-24 17:15:28,162 INFO L401 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-01-24 17:15:28,162 INFO L401 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-24 17:15:28,162 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 |#valid| 0))) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and (= 32 (select |#length| |main_~#mask~3.base|)) .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3) (not (= 0 (select |old(#valid)| 0))) (and (= main_~c~3.base |main_~#mask~3.base|) (<= 1 main_~i~3) .cse0 .cse1 (= (select |#length| main_~c~3.base) 32) (= main_~c~3.offset 0) .cse2 .cse3))) [2018-01-24 17:15:28,162 INFO L401 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-01-24 17:15:28,162 INFO L401 ceAbstractionStarter]: For program point L24''''(line 24) no Hoare annotation was computed. [2018-01-24 17:15:28,162 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|)) (.cse5 (= 0 (select |#valid| 0))) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|)) (.cse4 (= 0 main_~c~3.offset))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 main_~i~3) (= 32 (select |#length| main_~c~3.base))) (and .cse1 (and .cse0 .cse5 (and (<= 1 main_~i~3) (= 32 (select |#length| |main_~#mask~3.base|)))) .cse2 .cse3 .cse4 (<= main_~i~3 31)) (not (= 0 (select |old(#valid)| 0))))) [2018-01-24 17:15:28,162 INFO L401 ceAbstractionStarter]: For program point L24'''''(line 24) no Hoare annotation was computed. [2018-01-24 17:15:28,162 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|)) (.cse4 (= 0 (select |#valid| 0))) (.cse5 (select |#length| main_~c~3.base)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 main_~c~3.offset) .cse4 (= 0 main_~i~3) (= 32 .cse5)) (not (= 0 (select |old(#valid)| 0))) (and .cse0 (<= 1 main_~i~3) .cse1 .cse4 (= .cse5 32) (= main_~c~3.offset 0) .cse2 .cse3))) [2018-01-24 17:15:28,162 INFO L401 ceAbstractionStarter]: For program point L25''''(lines 25 28) no Hoare annotation was computed. [2018-01-24 17:15:28,162 INFO L401 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-24 17:15:28,163 INFO L401 ceAbstractionStarter]: For program point L24''(line 24) no Hoare annotation was computed. [2018-01-24 17:15:28,163 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 21 35) no Hoare annotation was computed. [2018-01-24 17:15:28,163 INFO L401 ceAbstractionStarter]: For program point L25''(lines 25 28) no Hoare annotation was computed. [2018-01-24 17:15:28,163 INFO L401 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-01-24 17:15:28,163 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-01-24 17:15:28,163 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 17:15:28,163 INFO L401 ceAbstractionStarter]: For program point L24'''(line 24) no Hoare annotation was computed. [2018-01-24 17:15:28,163 INFO L401 ceAbstractionStarter]: For program point L29''''(lines 29 33) no Hoare annotation was computed. [2018-01-24 17:15:28,163 INFO L401 ceAbstractionStarter]: For program point L29''(lines 29 33) no Hoare annotation was computed. [2018-01-24 17:15:28,163 INFO L401 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-01-24 17:15:28,163 INFO L401 ceAbstractionStarter]: For program point L24'(line 24) no Hoare annotation was computed. [2018-01-24 17:15:28,163 INFO L401 ceAbstractionStarter]: For program point L30'(lines 30 32) no Hoare annotation was computed. [2018-01-24 17:15:28,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,176 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,176 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,176 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,177 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,177 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,177 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:15:28 BoogieIcfgContainer [2018-01-24 17:15:28,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 17:15:28,187 INFO L168 Benchmark]: Toolchain (without parser) took 8982.12 ms. Allocated memory was 292.6 MB in the beginning and 577.8 MB in the end (delta: 285.2 MB). Free memory was 253.6 MB in the beginning and 396.2 MB in the end (delta: -142.6 MB). Peak memory consumption was 252.1 MB. Max. memory is 5.3 GB. [2018-01-24 17:15:28,188 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 292.6 MB. Free memory is still 258.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:15:28,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.54 ms. Allocated memory is still 292.6 MB. Free memory was 252.6 MB in the beginning and 244.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:15:28,188 INFO L168 Benchmark]: Boogie Preprocessor took 27.29 ms. Allocated memory is still 292.6 MB. Free memory was 244.6 MB in the beginning and 242.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:15:28,189 INFO L168 Benchmark]: RCFGBuilder took 213.06 ms. Allocated memory is still 292.6 MB. Free memory was 242.6 MB in the beginning and 227.0 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. [2018-01-24 17:15:28,189 INFO L168 Benchmark]: TraceAbstraction took 8539.10 ms. Allocated memory was 292.6 MB in the beginning and 577.8 MB in the end (delta: 285.2 MB). Free memory was 227.0 MB in the beginning and 396.2 MB in the end (delta: -169.2 MB). Peak memory consumption was 225.6 MB. Max. memory is 5.3 GB. [2018-01-24 17:15:28,191 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 292.6 MB. Free memory is still 258.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 194.54 ms. Allocated memory is still 292.6 MB. Free memory was 252.6 MB in the beginning and 244.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.29 ms. Allocated memory is still 292.6 MB. Free memory was 244.6 MB in the beginning and 242.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 213.06 ms. Allocated memory is still 292.6 MB. Free memory was 242.6 MB in the beginning and 227.0 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8539.10 ms. Allocated memory was 292.6 MB in the beginning and 577.8 MB in the end (delta: 285.2 MB). Free memory was 227.0 MB in the beginning and 396.2 MB in the end (delta: -169.2 MB). Peak memory consumption was 225.6 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 : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 131 LocStat_NO_SUPPORTING_DISEQUALITIES : 30 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 27 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 34 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.360293 RENAME_VARIABLES(MILLISECONDS) : 0.190279 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.307935 PROJECTAWAY(MILLISECONDS) : 0.294351 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002040 DISJOIN(MILLISECONDS) : 0.412231 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.224134 ADD_EQUALITY(MILLISECONDS) : 0.040744 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.073585 #CONJOIN_DISJUNCTIVE : 65 #RENAME_VARIABLES : 141 #UNFREEZE : 0 #CONJOIN : 112 #PROJECTAWAY : 110 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 19 #RENAME_VARIABLES_DISJUNCTIVE : 137 #ADD_EQUALITY : 34 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 142 LocStat_NO_SUPPORTING_DISEQUALITIES : 32 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 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.240869 RENAME_VARIABLES(MILLISECONDS) : 0.159646 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.198483 PROJECTAWAY(MILLISECONDS) : 0.222219 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001221 DISJOIN(MILLISECONDS) : 0.254848 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.182617 ADD_EQUALITY(MILLISECONDS) : 0.020268 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.103114 #CONJOIN_DISJUNCTIVE : 67 #RENAME_VARIABLES : 144 #UNFREEZE : 0 #CONJOIN : 113 #PROJECTAWAY : 112 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 21 #RENAME_VARIABLES_DISJUNCTIVE : 141 #ADD_EQUALITY : 34 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 151 LocStat_NO_SUPPORTING_DISEQUALITIES : 34 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 34 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.316966 RENAME_VARIABLES(MILLISECONDS) : 0.120531 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.273526 PROJECTAWAY(MILLISECONDS) : 0.190871 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001668 DISJOIN(MILLISECONDS) : 0.327401 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.147781 ADD_EQUALITY(MILLISECONDS) : 0.022871 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016885 #CONJOIN_DISJUNCTIVE : 70 #RENAME_VARIABLES : 150 #UNFREEZE : 0 #CONJOIN : 116 #PROJECTAWAY : 116 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 23 #RENAME_VARIABLES_DISJUNCTIVE : 147 #ADD_EQUALITY : 34 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 142 LocStat_NO_SUPPORTING_DISEQUALITIES : 32 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 32 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.412304 RENAME_VARIABLES(MILLISECONDS) : 0.132346 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.256507 PROJECTAWAY(MILLISECONDS) : 0.171004 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001625 DISJOIN(MILLISECONDS) : 0.204086 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.161125 ADD_EQUALITY(MILLISECONDS) : 0.029635 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.072318 #CONJOIN_DISJUNCTIVE : 70 #RENAME_VARIABLES : 147 #UNFREEZE : 0 #CONJOIN : 113 #PROJECTAWAY : 109 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 18 #RENAME_VARIABLES_DISJUNCTIVE : 147 #ADD_EQUALITY : 32 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 178 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 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.252883 RENAME_VARIABLES(MILLISECONDS) : 0.216447 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.227558 PROJECTAWAY(MILLISECONDS) : 0.203836 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002621 DISJOIN(MILLISECONDS) : 0.255345 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.239707 ADD_EQUALITY(MILLISECONDS) : 0.126318 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014291 #CONJOIN_DISJUNCTIVE : 121 #RENAME_VARIABLES : 265 #UNFREEZE : 0 #CONJOIN : 188 #PROJECTAWAY : 188 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 29 #RENAME_VARIABLES_DISJUNCTIVE : 259 #ADD_EQUALITY : 38 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 29 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 182 LocStat_NO_SUPPORTING_DISEQUALITIES : 52 LocStat_NO_DISJUNCTIONS : -58 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 36 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 36 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 36 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.209180 RENAME_VARIABLES(MILLISECONDS) : 0.078622 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.185224 PROJECTAWAY(MILLISECONDS) : 0.125757 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001835 DISJOIN(MILLISECONDS) : 0.209620 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.098429 ADD_EQUALITY(MILLISECONDS) : 0.021935 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011901 #CONJOIN_DISJUNCTIVE : 103 #RENAME_VARIABLES : 213 #UNFREEZE : 0 #CONJOIN : 146 #PROJECTAWAY : 151 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 24 #RENAME_VARIABLES_DISJUNCTIVE : 213 #ADD_EQUALITY : 36 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 33 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 226 LocStat_NO_SUPPORTING_DISEQUALITIES : 60 LocStat_NO_DISJUNCTIONS : -66 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 41 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 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.284705 RENAME_VARIABLES(MILLISECONDS) : 0.188866 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.259354 PROJECTAWAY(MILLISECONDS) : 0.143273 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001831 DISJOIN(MILLISECONDS) : 0.225579 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.213501 ADD_EQUALITY(MILLISECONDS) : 0.043090 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009119 #CONJOIN_DISJUNCTIVE : 157 #RENAME_VARIABLES : 331 #UNFREEZE : 0 #CONJOIN : 218 #PROJECTAWAY : 225 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 34 #RENAME_VARIABLES_DISJUNCTIVE : 331 #ADD_EQUALITY : 40 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 178 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 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.249128 RENAME_VARIABLES(MILLISECONDS) : 0.200429 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.223823 PROJECTAWAY(MILLISECONDS) : 0.136520 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001903 DISJOIN(MILLISECONDS) : 0.232278 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.232387 ADD_EQUALITY(MILLISECONDS) : 0.021020 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010776 #CONJOIN_DISJUNCTIVE : 121 #RENAME_VARIABLES : 265 #UNFREEZE : 0 #CONJOIN : 188 #PROJECTAWAY : 188 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 29 #RENAME_VARIABLES_DISJUNCTIVE : 259 #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 17:15:28,203 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,204 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,205 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,205 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((c == mask && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) && 0 == c) && 0 == \valid[0]) && 0 == i) && 32 == unknown-#length-unknown[c]) || !(0 == \old(\valid)[0])) || (((((((c == mask && 1 <= i) && \old(\valid)[mask := 1] == \valid) && 0 == \valid[0]) && unknown-#length-unknown[c] == 32) && c == 0) && 0 == \old(\valid)[mask]) && 0 == mask) - InvariantResult [Line: 15]: Loop Invariant [2018-01-24 17:15:28,207 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,208 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,208 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,208 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,208 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,208 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,211 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,211 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,211 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,211 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,212 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,212 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((!(\valid[b] == 1) || (size <= 1 && i == 0)) || (size <= 1 && 1 == i)) || 1 < \old(size)) || !(0 == \valid[0])) || !(0 == b) || !(32 == unknown-#length-unknown[b])) && ((((size <= 2 || !(\valid[b] == 1)) || 2 < \old(size)) || !(0 == \valid[0])) || !(0 == b) || !(32 == unknown-#length-unknown[b]))) && (((((31 < \old(size) || ((((unknown-#length-unknown[b] == 32 && \valid[b] == 1) && size <= 31) && b == 0) && 1 <= i)) || !(\valid[b] == 1)) || !(0 == \valid[0])) || (((((\old(size) <= size && unknown-#length-unknown[b] == 32) && 0 == i) && \valid[b] == 1) && size <= 31) && b == 0)) || !(0 == b) || !(32 == unknown-#length-unknown[b]))) && (((((!(0 == b) || (size == 0 && i == 0)) || !(\valid[b] == 1)) || !(0 == \old(size))) || !(0 == \valid[0])) || !(32 == unknown-#length-unknown[b])) - InvariantResult [Line: 25]: Loop Invariant [2018-01-24 17:15:28,213 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,213 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,214 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 17:15:28,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && 0 == \valid[0]) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) || !(0 == \old(\valid)[0])) || (((((((c == mask && 1 <= i) && \old(\valid)[mask := 1] == \valid) && 0 == \valid[0]) && unknown-#length-unknown[c] == 32) && c == 0) && 0 == \old(\valid)[mask]) && 0 == mask) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. SAFE Result, 8.4s OverallTime, 12 OverallIterations, 7 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 418 SDtfs, 988 SDslu, 1217 SDs, 0 SdLazy, 1128 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1358 GetRequests, 1162 SyntacticMatches, 36 SemanticMatches, 160 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 2.0s 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, 1.2s AbstIntTime, 8 AbstIntIterations, 1 AbstIntStrong, 0.8507923623995053 AbsIntWeakeningRatio, 1.1785714285714286 AbsIntAvgWeakeningVarsNumRemoved, 5.5 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, 964 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1571 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s 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_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-15-28-220.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_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-15-28-220.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_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-15-28-220.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_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_17-15-28-220.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_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_17-15-28-220.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_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_17-15-28-220.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_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_17-15-28-220.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_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_17-15-28-220.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_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_17-15-28-220.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_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-24_17-15-28-220.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_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-24_17-15-28-220.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_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-5-2018-01-24_17-15-28-220.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_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-5-2018-01-24_17-15-28-220.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_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-6-2018-01-24_17-15-28-220.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_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-6-2018-01-24_17-15-28-220.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_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-7-2018-01-24_17-15-28-220.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_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-7-2018-01-24_17-15-28-220.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_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_17-15-28-220.csv Received shutdown request...