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_preciseopt.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:22:53,177 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:22:53,178 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:22:53,194 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:22:53,195 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:22:53,196 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:22:53,197 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:22:53,198 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:22:53,200 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:22:53,201 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:22:53,201 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:22:53,201 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:22:53,202 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:22:53,203 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:22:53,204 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:22:53,207 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:22:53,209 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:22:53,211 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:22:53,213 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:22:53,214 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:22:53,217 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:22:53,217 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:22:53,217 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:22:53,218 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:22:53,219 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:22:53,220 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:22:53,221 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:22:53,221 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:22:53,222 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:22:53,222 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:22:53,222 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:22:53,223 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_preciseopt.epf [2018-01-25 03:22:53,233 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:22:53,233 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:22:53,234 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:22:53,234 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:22:53,235 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:22:53,235 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:22:53,235 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:22:53,235 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:22:53,236 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:22:53,236 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:22:53,236 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:22:53,237 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:22:53,237 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:22:53,237 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:22:53,237 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:22:53,237 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:22:53,238 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:22:53,238 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:22:53,238 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:22:53,238 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:22:53,238 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:22:53,239 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:22:53,239 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:22:53,239 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:22:53,239 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:22:53,239 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:22:53,240 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:22:53,240 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:22:53,240 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:22:53,240 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:22:53,240 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:22:53,240 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:22:53,241 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:22:53,241 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:22:53,241 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:22:53,242 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:22:53,242 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:22:53,278 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:22:53,291 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:22:53,295 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:22:53,297 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:22:53,297 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:22:53,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-01-25 03:22:53,480 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:22:53,489 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:22:53,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:22:53,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:22:53,498 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:22:53,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:22:53" (1/1) ... [2018-01-25 03:22:53,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669a2021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:22:53, skipping insertion in model container [2018-01-25 03:22:53,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:22:53" (1/1) ... [2018-01-25 03:22:53,525 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:22:53,547 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:22:53,662 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:22:53,678 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:22:53,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:22:53 WrapperNode [2018-01-25 03:22:53,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:22:53,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:22:53,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:22:53,685 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:22:53,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:22:53" (1/1) ... [2018-01-25 03:22:53,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:22:53" (1/1) ... [2018-01-25 03:22:53,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:22:53" (1/1) ... [2018-01-25 03:22:53,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:22:53" (1/1) ... [2018-01-25 03:22:53,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:22:53" (1/1) ... [2018-01-25 03:22:53,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:22:53" (1/1) ... [2018-01-25 03:22:53,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:22:53" (1/1) ... [2018-01-25 03:22:53,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:22:53,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:22:53,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:22:53,719 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:22:53,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:22:53" (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-25 03:22:53,768 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:22:53,769 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:22:53,769 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-25 03:22:53,769 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:22:53,769 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:22:53,770 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:22:53,770 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:22:53,770 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:22:53,770 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:22:53,770 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-25 03:22:53,770 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:22:53,770 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:22:53,771 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:22:53,956 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:22:53,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:22:53 BoogieIcfgContainer [2018-01-25 03:22:53,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:22:53,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:22:53,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:22:53,960 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:22:53,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:22:53" (1/3) ... [2018-01-25 03:22:53,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13679a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:22:53, skipping insertion in model container [2018-01-25 03:22:53,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:22:53" (2/3) ... [2018-01-25 03:22:53,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13679a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:22:53, skipping insertion in model container [2018-01-25 03:22:53,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:22:53" (3/3) ... [2018-01-25 03:22:53,964 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-01-25 03:22:53,974 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:22:53,983 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-25 03:22:54,027 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:22:54,027 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:22:54,028 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:22:54,028 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:22:54,028 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:22:54,028 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:22:54,028 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:22:54,028 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:22:54,029 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:22:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-25 03:22:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 03:22:54,069 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:54,070 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:54,071 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:54,076 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-01-25 03:22:54,079 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:54,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:54,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:54,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:54,140 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:54,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:54,336 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-25 03:22:54,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:22:54,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:22:54,339 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:22:54,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:22:54,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:22:54,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:22:54,354 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-25 03:22:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:54,449 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-01-25 03:22:54,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:22:54,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-25 03:22:54,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:54,459 INFO L225 Difference]: With dead ends: 101 [2018-01-25 03:22:54,460 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 03:22:54,509 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-25 03:22:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 03:22:54,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-01-25 03:22:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 03:22:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-25 03:22:54,625 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-01-25 03:22:54,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:54,626 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-25 03:22:54,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:22:54,626 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-25 03:22:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 03:22:54,627 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:54,627 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:54,627 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:54,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-01-25 03:22:54,627 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:54,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:54,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:54,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:54,628 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:54,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:54,742 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-25 03:22:54,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:22:54,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:22:54,742 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:22:54,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:22:54,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:22:54,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:22:54,746 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-01-25 03:22:54,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:54,910 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-01-25 03:22:54,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:22:54,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-25 03:22:54,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:54,912 INFO L225 Difference]: With dead ends: 95 [2018-01-25 03:22:54,912 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 03:22:54,914 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:22:54,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 03:22:54,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-01-25 03:22:54,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 03:22:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-25 03:22:54,929 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 16 [2018-01-25 03:22:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:54,929 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-25 03:22:54,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:22:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-25 03:22:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 03:22:54,930 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:54,931 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:54,931 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:54,933 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-01-25 03:22:54,933 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:54,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:54,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:54,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:54,935 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:54,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:55,136 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-25 03:22:55,137 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:22:55,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:22:55,137 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:22:55,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:22:55,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:22:55,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:22:55,138 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-01-25 03:22:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:55,224 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-01-25 03:22:55,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:22:55,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 03:22:55,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:55,226 INFO L225 Difference]: With dead ends: 57 [2018-01-25 03:22:55,226 INFO L226 Difference]: Without dead ends: 56 [2018-01-25 03:22:55,227 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:22:55,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-25 03:22:55,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-01-25 03:22:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 03:22:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-01-25 03:22:55,236 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2018-01-25 03:22:55,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:55,236 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-01-25 03:22:55,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:22:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-01-25 03:22:55,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 03:22:55,237 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:55,237 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:55,237 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:55,237 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-01-25 03:22:55,238 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:55,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:55,239 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:55,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:55,239 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:55,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:55,306 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-25 03:22:55,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:22:55,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:22:55,307 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:22:55,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:22:55,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:22:55,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:22:55,308 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 5 states. [2018-01-25 03:22:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:55,387 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-01-25 03:22:55,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:22:55,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 03:22:55,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:55,389 INFO L225 Difference]: With dead ends: 53 [2018-01-25 03:22:55,389 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 03:22:55,389 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:22:55,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 03:22:55,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 03:22:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 03:22:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-25 03:22:55,395 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 17 [2018-01-25 03:22:55,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:55,396 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-25 03:22:55,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:22:55,396 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-25 03:22:55,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:22:55,397 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:55,397 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] [2018-01-25 03:22:55,397 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:55,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-01-25 03:22:55,397 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:55,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:55,398 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:55,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:55,398 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:55,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:55,566 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-25 03:22:55,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:55,567 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:22:55,568 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-01-25 03:22:55,569 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [13], [14], [17], [19], [28], [29], [30], [34], [39], [41], [79], [80], [81], [83] [2018-01-25 03:22:55,613 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:22:55,613 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:22:56,337 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:22:56,338 INFO L268 AbstractInterpreter]: Visited 20 different actions 27 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-01-25 03:22:56,380 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:22:56,380 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:56,380 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-25 03:22:56,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:56,397 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:22:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:56,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:56,567 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-25 03:22:56,567 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:56,605 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-25 03:22:56,627 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:56,627 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 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 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:22:56,632 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:56,632 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:22:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:56,657 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:56,660 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-25 03:22:56,660 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:56,681 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-25 03:22:56,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:22:56,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3, 3, 3] total 11 [2018-01-25 03:22:56,686 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:22:56,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:22:56,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:22:56,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:22:56,688 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 10 states. [2018-01-25 03:22:57,014 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 15 DAG size of output 14 [2018-01-25 03:22:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:57,199 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-01-25 03:22:57,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:22:57,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-25 03:22:57,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:57,200 INFO L225 Difference]: With dead ends: 103 [2018-01-25 03:22:57,200 INFO L226 Difference]: Without dead ends: 62 [2018-01-25 03:22:57,201 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-01-25 03:22:57,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-25 03:22:57,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-01-25 03:22:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 03:22:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-25 03:22:57,211 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 22 [2018-01-25 03:22:57,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:57,212 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-25 03:22:57,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:22:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-25 03:22:57,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 03:22:57,213 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:57,213 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:57,213 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:57,213 INFO L82 PathProgramCache]: Analyzing trace with hash 180123030, now seen corresponding path program 1 times [2018-01-25 03:22:57,214 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:57,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:57,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:57,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:57,215 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:57,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:22:57,588 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:57,588 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:22:57,589 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 03:22:57,589 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [13], [14], [16], [17], [19], [28], [29], [30], [34], [39], [41], [79], [80], [81], [83] [2018-01-25 03:22:57,590 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:22:57,590 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:22:58,088 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:22:58,088 INFO L268 AbstractInterpreter]: Visited 20 different actions 27 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-01-25 03:22:58,119 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:22:58,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:58,120 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-25 03:22:58,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:58,128 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:22:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:58,164 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:58,208 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-25 03:22:58,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:22:58,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:22:58,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 03:22:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:22:58,525 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:58,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:22:58,629 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:58,629 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-25 03:22:58,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:58,633 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:22:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:58,656 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:58,659 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-25 03:22:58,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:22:58,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:22:58,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 03:22:58,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:22:58,668 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:58,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:22:58,691 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:22:58,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 5, 5] total 14 [2018-01-25 03:22:58,691 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:22:58,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 03:22:58,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 03:22:58,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-01-25 03:22:58,692 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 11 states. [2018-01-25 03:22:59,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:59,103 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-25 03:22:59,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:22:59,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-01-25 03:22:59,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:59,104 INFO L225 Difference]: With dead ends: 61 [2018-01-25 03:22:59,104 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 03:22:59,105 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-01-25 03:22:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 03:22:59,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-25 03:22:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 03:22:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-01-25 03:22:59,112 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 23 [2018-01-25 03:22:59,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:59,113 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-01-25 03:22:59,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 03:22:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-01-25 03:22:59,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 03:22:59,114 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:59,114 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:59,114 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:59,115 INFO L82 PathProgramCache]: Analyzing trace with hash 687601263, now seen corresponding path program 1 times [2018-01-25 03:22:59,115 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:59,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:59,116 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:59,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:59,116 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:59,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:59,388 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 12 DAG size of output 10 [2018-01-25 03:22:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:22:59,589 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:59,589 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:22:59,590 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-25 03:22:59,590 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [17], [19], [23], [24], [28], [29], [30], [34], [39], [40], [41], [43], [45], [79], [80], [81], [83], [84] [2018-01-25 03:22:59,592 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:22:59,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:23:01,735 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:23:01,735 INFO L268 AbstractInterpreter]: Visited 26 different actions 96 times. Merged at 16 different actions 45 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 21 variables. [2018-01-25 03:23:01,755 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:23:01,756 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:01,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-25 03:23:01,765 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:01,765 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:23:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:01,797 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:23:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:23:01,894 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:23:02,036 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:23:02,058 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:02,058 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-25 03:23:02,062 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:02,062 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:23:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:02,098 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:23:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-25 03:23:02,174 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:23:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-25 03:23:02,282 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-01-25 03:23:02,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7, 7, 7] total 22 [2018-01-25 03:23:02,282 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:23:02,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:23:02,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:23:02,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-01-25 03:23:02,283 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 5 states. [2018-01-25 03:23:02,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:23:02,411 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-01-25 03:23:02,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:23:02,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-25 03:23:02,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:23:02,413 INFO L225 Difference]: With dead ends: 72 [2018-01-25 03:23:02,414 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 03:23:02,414 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-01-25 03:23:02,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 03:23:02,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2018-01-25 03:23:02,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 03:23:02,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-25 03:23:02,429 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 41 [2018-01-25 03:23:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:23:02,436 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-25 03:23:02,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:23:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-25 03:23:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-25 03:23:02,438 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:23:02,438 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:23:02,438 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:23:02,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1072164206, now seen corresponding path program 1 times [2018-01-25 03:23:02,439 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:23:02,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:02,440 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:02,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:02,440 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:23:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:02,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:23:02,806 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 13 DAG size of output 12 [2018-01-25 03:23:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:23:02,883 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:02,883 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:23:02,883 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-01-25 03:23:02,883 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-25 03:23:02,884 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:23:02,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:23:04,373 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:23:04,373 INFO L268 AbstractInterpreter]: Visited 35 different actions 123 times. Merged at 25 different actions 62 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 21 variables. [2018-01-25 03:23:04,424 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:23:04,424 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:04,424 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-25 03:23:04,450 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:04,451 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:23:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:04,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:23:04,786 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:23:04,786 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:23:04,909 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:23:04,941 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:04,941 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 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 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:23:04,946 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:04,946 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:23:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:04,977 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:23:05,008 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-25 03:23:05,009 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:23:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-25 03:23:05,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:23:05,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 4, 4] total 21 [2018-01-25 03:23:05,077 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:23:05,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 03:23:05,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 03:23:05,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-01-25 03:23:05,077 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 12 states. [2018-01-25 03:23:05,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:23:05,221 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2018-01-25 03:23:05,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:23:05,221 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-01-25 03:23:05,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:23:05,223 INFO L225 Difference]: With dead ends: 115 [2018-01-25 03:23:05,223 INFO L226 Difference]: Without dead ends: 66 [2018-01-25 03:23:05,223 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2018-01-25 03:23:05,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-25 03:23:05,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-01-25 03:23:05,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-25 03:23:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-01-25 03:23:05,232 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 49 [2018-01-25 03:23:05,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:23:05,233 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-01-25 03:23:05,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 03:23:05,233 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-01-25 03:23:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-25 03:23:05,234 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:23:05,234 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:23:05,234 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:23:05,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1829333686, now seen corresponding path program 2 times [2018-01-25 03:23:05,235 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:23:05,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:05,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:05,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:05,241 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:23:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:05,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:23:05,606 WARN L146 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 13 DAG size of output 12 [2018-01-25 03:23:05,729 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:23:05,730 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:05,730 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:23:05,730 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 03:23:05,730 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:23:05,730 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:05,730 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:23:05,740 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 03:23:05,740 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 03:23:05,749 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:23:05,751 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:23:05,752 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:23:05,772 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:23:05,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-25 03:23:05,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:23:05,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 03:23:05,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-25 03:23:05,827 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-25 03:23:05,835 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-01-25 03:23:05,835 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:23:05,901 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_~#mask~3.base_18| Int)) (or (= (store |c_#valid| |v_main_~#mask~3.base_18| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_~#mask~3.base_18|) 0)))) is different from false [2018-01-25 03:23:05,988 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-01-25 03:23:06,009 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 03:23:06,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [8] total 14 [2018-01-25 03:23:06,009 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:23:06,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:23:06,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:23:06,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=101, Unknown=2, NotChecked=42, Total=182 [2018-01-25 03:23:06,010 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 6 states. [2018-01-25 03:23:06,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:23:06,066 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-01-25 03:23:06,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:23:06,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-01-25 03:23:06,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:23:06,067 INFO L225 Difference]: With dead ends: 63 [2018-01-25 03:23:06,067 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 03:23:06,068 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=144, Unknown=2, NotChecked=50, Total=240 [2018-01-25 03:23:06,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 03:23:06,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 03:23:06,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 03:23:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 03:23:06,069 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2018-01-25 03:23:06,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:23:06,069 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 03:23:06,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:23:06,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 03:23:06,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 03:23:06,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 03:23:06,398 WARN L146 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 50 DAG size of output 34 [2018-01-25 03:23:06,518 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 25 DAG size of output 19 [2018-01-25 03:23:06,569 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 34) no Hoare annotation was computed. [2018-01-25 03:23:06,570 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 34) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:23:06,570 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 34) no Hoare annotation was computed. [2018-01-25 03:23:06,570 INFO L401 ceAbstractionStarter]: For program point fooFINAL(lines 12 19) no Hoare annotation was computed. [2018-01-25 03:23:06,570 INFO L401 ceAbstractionStarter]: For program point L15''''(lines 15 17) no Hoare annotation was computed. [2018-01-25 03:23:06,570 INFO L401 ceAbstractionStarter]: For program point fooEXIT(lines 12 19) no Hoare annotation was computed. [2018-01-25 03:23:06,570 INFO L404 ceAbstractionStarter]: At program point fooENTRY(lines 12 19) the Hoare annotation is: true [2018-01-25 03:23:06,570 INFO L401 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 34) no Hoare annotation was computed. [2018-01-25 03:23:06,570 INFO L397 ceAbstractionStarter]: At program point L15'''(lines 15 17) the Hoare annotation is: (let ((.cse2 (= foo_~size 32)) (.cse1 (select |#length| foo_~b.base)) (.cse0 (= 1 (select |#valid| foo_~b.base))) (.cse3 (= foo_~b.offset 0))) (or (not (= 0 |foo_#in~b.offset|)) (not (= (select |#valid| |foo_#in~b.base|) 1)) (not (= 32 |foo_#in~size|)) (and .cse0 (= .cse1 32) .cse2 .cse3 (<= 1 foo_~i~1)) (not (= 32 (select |#length| |foo_#in~b.base|))) (and .cse2 (= 32 .cse1) .cse0 .cse3 (= foo_~i~1 0)))) [2018-01-25 03:23:06,570 INFO L401 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-01-25 03:23:06,571 INFO L401 ceAbstractionStarter]: For program point L15(lines 15 17) no Hoare annotation was computed. [2018-01-25 03:23:06,571 INFO L401 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 34) no Hoare annotation was computed. [2018-01-25 03:23:06,571 INFO L401 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-01-25 03:23:06,571 INFO L401 ceAbstractionStarter]: For program point L15''(lines 15 17) no Hoare annotation was computed. [2018-01-25 03:23:06,571 INFO L401 ceAbstractionStarter]: For program point L16''(line 16) no Hoare annotation was computed. [2018-01-25 03:23:06,571 INFO L401 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 16) no Hoare annotation was computed. [2018-01-25 03:23:06,571 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 34) the Hoare annotation is: true [2018-01-25 03:23:06,571 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 34) no Hoare annotation was computed. [2018-01-25 03:23:06,571 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 34) the Hoare annotation is: true [2018-01-25 03:23:06,571 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 34) no Hoare annotation was computed. [2018-01-25 03:23:06,571 INFO L401 ceAbstractionStarter]: For program point L28''''(lines 28 32) no Hoare annotation was computed. [2018-01-25 03:23:06,571 INFO L401 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 26) no Hoare annotation was computed. [2018-01-25 03:23:06,571 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 21 34) no Hoare annotation was computed. [2018-01-25 03:23:06,572 INFO L401 ceAbstractionStarter]: For program point mainErr1AssertViolation(line 29) no Hoare annotation was computed. [2018-01-25 03:23:06,572 INFO L401 ceAbstractionStarter]: For program point L25(lines 25 27) no Hoare annotation was computed. [2018-01-25 03:23:06,572 INFO L401 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-01-25 03:23:06,572 INFO L401 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-01-25 03:23:06,572 INFO L397 ceAbstractionStarter]: At program point L25'''(lines 25 27) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-25 03:23:06,572 INFO L401 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-01-25 03:23:06,572 INFO L401 ceAbstractionStarter]: For program point L28(lines 28 32) no Hoare annotation was computed. [2018-01-25 03:23:06,572 INFO L401 ceAbstractionStarter]: For program point L24''''(line 24) no Hoare annotation was computed. [2018-01-25 03:23:06,572 INFO L401 ceAbstractionStarter]: For program point L29'(lines 29 31) no Hoare annotation was computed. [2018-01-25 03:23:06,572 INFO L401 ceAbstractionStarter]: For program point L24'''''(line 24) no Hoare annotation was computed. [2018-01-25 03:23:06,572 INFO L401 ceAbstractionStarter]: For program point L25''''(lines 25 27) no Hoare annotation was computed. [2018-01-25 03:23:06,572 INFO L401 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-25 03:23:06,572 INFO L401 ceAbstractionStarter]: For program point L24''(line 24) no Hoare annotation was computed. [2018-01-25 03:23:06,572 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 21 34) no Hoare annotation was computed. [2018-01-25 03:23:06,573 INFO L401 ceAbstractionStarter]: For program point L25''(lines 25 27) no Hoare annotation was computed. [2018-01-25 03:23:06,573 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 21 34) no Hoare annotation was computed. [2018-01-25 03:23:06,573 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 21 34) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:23:06,573 INFO L401 ceAbstractionStarter]: For program point L24'''(line 24) no Hoare annotation was computed. [2018-01-25 03:23:06,573 INFO L397 ceAbstractionStarter]: At program point L26'(line 26) the Hoare annotation is: (and (= 32 (select |#length| |main_~#mask~3.base|)) (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|) (<= 0 main_~i~3) (= 0 (select |old(#valid)| |main_~#mask~3.base|)) (= 0 |main_~#mask~3.offset|)) [2018-01-25 03:23:06,573 INFO L401 ceAbstractionStarter]: For program point L28''(lines 28 32) no Hoare annotation was computed. [2018-01-25 03:23:06,573 INFO L401 ceAbstractionStarter]: For program point L26''(line 26) no Hoare annotation was computed. [2018-01-25 03:23:06,573 INFO L401 ceAbstractionStarter]: For program point L24'(line 24) no Hoare annotation was computed. [2018-01-25 03:23:06,573 INFO L397 ceAbstractionStarter]: At program point L28'''(lines 28 32) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-25 03:23:06,578 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,579 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,581 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,581 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:23:06 BoogieIcfgContainer [2018-01-25 03:23:06,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:23:06,593 INFO L168 Benchmark]: Toolchain (without parser) took 13111.87 ms. Allocated memory was 305.7 MB in the beginning and 692.6 MB in the end (delta: 386.9 MB). Free memory was 266.6 MB in the beginning and 549.0 MB in the end (delta: -282.4 MB). Peak memory consumption was 104.5 MB. Max. memory is 5.3 GB. [2018-01-25 03:23:06,594 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:23:06,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.01 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 256.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:23:06,594 INFO L168 Benchmark]: Boogie Preprocessor took 32.95 ms. Allocated memory is still 305.7 MB. Free memory was 256.5 MB in the beginning and 254.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:23:06,595 INFO L168 Benchmark]: RCFGBuilder took 238.38 ms. Allocated memory is still 305.7 MB. Free memory was 254.5 MB in the beginning and 239.6 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:23:06,595 INFO L168 Benchmark]: TraceAbstraction took 12633.97 ms. Allocated memory was 305.7 MB in the beginning and 692.6 MB in the end (delta: 386.9 MB). Free memory was 239.6 MB in the beginning and 549.0 MB in the end (delta: -309.4 MB). Peak memory consumption was 77.5 MB. Max. memory is 5.3 GB. [2018-01-25 03:23:06,597 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.20 ms. Allocated memory is still 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 195.01 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 256.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.95 ms. Allocated memory is still 305.7 MB. Free memory was 256.5 MB in the beginning and 254.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 238.38 ms. Allocated memory is still 305.7 MB. Free memory was 254.5 MB in the beginning and 239.6 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 12633.97 ms. Allocated memory was 305.7 MB in the beginning and 692.6 MB in the end (delta: 386.9 MB). Free memory was 239.6 MB in the beginning and 549.0 MB in the end (delta: -309.4 MB). Peak memory consumption was 77.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 147 LocStat_NO_SUPPORTING_DISEQUALITIES : 36 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 26 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 31 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 27 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.980690 RENAME_VARIABLES(MILLISECONDS) : 0.403338 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.914506 PROJECTAWAY(MILLISECONDS) : 0.284889 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.147407 DISJOIN(MILLISECONDS) : 2.256545 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.442603 ADD_EQUALITY(MILLISECONDS) : 0.041890 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.047225 #CONJOIN_DISJUNCTIVE : 36 #RENAME_VARIABLES : 65 #UNFREEZE : 0 #CONJOIN : 59 #PROJECTAWAY : 60 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 63 #ADD_EQUALITY : 31 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 147 LocStat_NO_SUPPORTING_DISEQUALITIES : 36 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 26 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 31 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 27 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.158461 RENAME_VARIABLES(MILLISECONDS) : 0.323847 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.101708 PROJECTAWAY(MILLISECONDS) : 0.298004 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.088528 DISJOIN(MILLISECONDS) : 0.461596 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.360904 ADD_EQUALITY(MILLISECONDS) : 0.040618 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015432 #CONJOIN_DISJUNCTIVE : 36 #RENAME_VARIABLES : 65 #UNFREEZE : 0 #CONJOIN : 59 #PROJECTAWAY : 60 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 63 #ADD_EQUALITY : 31 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 179 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 36 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.992754 RENAME_VARIABLES(MILLISECONDS) : 0.307623 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.938225 PROJECTAWAY(MILLISECONDS) : 0.233647 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.123060 DISJOIN(MILLISECONDS) : 0.235566 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.349428 ADD_EQUALITY(MILLISECONDS) : 0.034095 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012522 #CONJOIN_DISJUNCTIVE : 129 #RENAME_VARIABLES : 298 #UNFREEZE : 0 #CONJOIN : 212 #PROJECTAWAY : 205 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 31 #RENAME_VARIABLES_DISJUNCTIVE : 293 #ADD_EQUALITY : 36 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 33 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 252 LocStat_NO_SUPPORTING_DISEQUALITIES : 60 LocStat_NO_DISJUNCTIONS : -66 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 41 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 38 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.881000 RENAME_VARIABLES(MILLISECONDS) : 0.239978 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.827802 PROJECTAWAY(MILLISECONDS) : 0.215804 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.148624 DISJOIN(MILLISECONDS) : 0.222339 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.270702 ADD_EQUALITY(MILLISECONDS) : 0.024558 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009304 #CONJOIN_DISJUNCTIVE : 158 #RENAME_VARIABLES : 335 #UNFREEZE : 0 #CONJOIN : 218 #PROJECTAWAY : 226 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 27 #RENAME_VARIABLES_DISJUNCTIVE : 335 #ADD_EQUALITY : 38 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 26]: 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: 29]: 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: 28]: Loop Invariant [2018-01-25 03:23:06,606 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,606 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((1 <= i && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) || ((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) - InvariantResult [Line: 15]: Loop Invariant [2018-01-25 03:23:06,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(0 == b) || !(\valid[b] == 1)) || !(32 == \old(size))) || ((((1 == \valid[b] && unknown-#length-unknown[b] == 32) && size == 32) && b == 0) && 1 <= i)) || !(32 == unknown-#length-unknown[b])) || ((((size == 32 && 32 == unknown-#length-unknown[b]) && 1 == \valid[b]) && b == 0) && i == 0) - InvariantResult [Line: 25]: Loop Invariant [2018-01-25 03:23:06,612 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,612 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,613 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:06,613 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((1 <= i && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) || ((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. SAFE Result, 12.5s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 341 SDtfs, 384 SDslu, 1101 SDs, 0 SdLazy, 395 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 710 GetRequests, 603 SyntacticMatches, 5 SemanticMatches, 102 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.0s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 37 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 17 PreInvPairs, 26 NumberOfFragments, 188 HoareAnnotationTreeSize, 17 FomulaSimplifications, 143 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 229 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 576 NumberOfCodeBlocks, 540 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 874 ConstructedInterpolants, 34 QuantifiedInterpolants, 160100 SizeOfPredicates, 12 NumberOfNonLiveVariables, 766 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 27 InterpolantComputations, 8 PerfectInterpolantSequences, 213/438 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/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-23-06-618.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_03-23-06-618.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_03-23-06-618.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_03-23-06-618.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_03-23-06-618.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_03-23-06-618.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_03-23-06-618.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_03-23-06-618.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_03-23-06-618.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-23-06-618.csv Received shutdown request...