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_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:38:33,151 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:38:33,153 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:38:33,175 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:38:33,176 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:38:33,177 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:38:33,178 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:38:33,180 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:38:33,182 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:38:33,183 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:38:33,185 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:38:33,185 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:38:33,186 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:38:33,187 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:38:33,188 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:38:33,199 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:38:33,201 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:38:33,205 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:38:33,206 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:38:33,208 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:38:33,210 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:38:33,210 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:38:33,210 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:38:33,211 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:38:33,212 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:38:33,213 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:38:33,213 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:38:33,214 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:38:33,214 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:38:33,215 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:38:33,215 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:38:33,215 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:38:33,225 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:38:33,225 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:38:33,226 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:38:33,226 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:38:33,226 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:38:33,226 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:38:33,227 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:38:33,227 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:38:33,227 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:38:33,227 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:38:33,228 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:38:33,228 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:38:33,228 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:38:33,228 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:38:33,228 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:38:33,228 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:38:33,229 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:38:33,229 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:38:33,229 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:38:33,229 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:38:33,229 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:38:33,230 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:38:33,230 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:38:33,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:38:33,230 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:38:33,230 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:38:33,230 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:38:33,231 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:38:33,231 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:38:33,231 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:38:33,231 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:38:33,231 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:38:33,232 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:38:33,232 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:38:33,285 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:38:33,297 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:38:33,299 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:38:33,301 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:38:33,301 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:38:33,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2018-01-31 08:38:33,431 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:38:33,441 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:38:33,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:38:33,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:38:33,450 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:38:33,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:38:33" (1/1) ... [2018-01-31 08:38:33,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d782bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:38:33, skipping insertion in model container [2018-01-31 08:38:33,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:38:33" (1/1) ... [2018-01-31 08:38:33,473 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:38:33,493 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:38:33,660 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:38:33,684 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:38:33,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:38:33 WrapperNode [2018-01-31 08:38:33,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:38:33,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:38:33,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:38:33,694 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:38:33,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:38:33" (1/1) ... [2018-01-31 08:38:33,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:38:33" (1/1) ... [2018-01-31 08:38:33,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:38:33" (1/1) ... [2018-01-31 08:38:33,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:38:33" (1/1) ... [2018-01-31 08:38:33,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:38:33" (1/1) ... [2018-01-31 08:38:33,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:38:33" (1/1) ... [2018-01-31 08:38:33,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:38:33" (1/1) ... [2018-01-31 08:38:33,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:38:33,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:38:33,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:38:33,738 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:38:33,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:38:33" (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-31 08:38:33,813 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:38:33,813 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:38:33,814 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-31 08:38:33,814 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:38:33,814 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:38:33,815 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:38:33,815 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:38:33,815 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:38:33,815 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:38:33,815 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-31 08:38:33,816 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:38:33,816 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:38:33,816 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:38:34,265 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:38:34,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:38:34 BoogieIcfgContainer [2018-01-31 08:38:34,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:38:34,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:38:34,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:38:34,272 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:38:34,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:38:33" (1/3) ... [2018-01-31 08:38:34,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c952d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:38:34, skipping insertion in model container [2018-01-31 08:38:34,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:38:33" (2/3) ... [2018-01-31 08:38:34,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c952d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:38:34, skipping insertion in model container [2018-01-31 08:38:34,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:38:34" (3/3) ... [2018-01-31 08:38:34,276 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c [2018-01-31 08:38:34,286 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:38:34,295 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-31 08:38:34,350 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:38:34,350 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:38:34,350 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:38:34,350 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:38:34,350 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:38:34,351 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:38:34,351 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:38:34,351 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:38:34,352 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:38:34,368 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-31 08:38:34,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 08:38:34,376 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:38:34,377 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:38:34,378 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:38:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1751798805, now seen corresponding path program 1 times [2018-01-31 08:38:34,387 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:38:34,388 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:38:34,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:34,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:38:34,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:34,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:38:34,602 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-31 08:38:34,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:38:34,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:38:34,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:38:34,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:38:34,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:38:34,618 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2018-01-31 08:38:34,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:38:34,708 INFO L93 Difference]: Finished difference Result 138 states and 160 transitions. [2018-01-31 08:38:34,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:38:34,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-31 08:38:34,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:38:34,718 INFO L225 Difference]: With dead ends: 138 [2018-01-31 08:38:34,718 INFO L226 Difference]: Without dead ends: 82 [2018-01-31 08:38:34,721 INFO L554 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-31 08:38:34,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-31 08:38:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2018-01-31 08:38:34,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-31 08:38:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-01-31 08:38:34,855 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 16 [2018-01-31 08:38:34,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:38:34,856 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-01-31 08:38:34,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:38:34,856 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-01-31 08:38:34,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:38:34,857 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:38:34,857 INFO L351 BasicCegarLoop]: trace histogram [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-31 08:38:34,858 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:38:34,858 INFO L82 PathProgramCache]: Analyzing trace with hash -177512800, now seen corresponding path program 1 times [2018-01-31 08:38:34,858 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:38:34,858 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:38:34,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:34,861 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:38:34,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:34,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:38:35,212 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-31 08:38:35,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:38:35,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:38:35,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:38:35,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:38:35,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:38:35,215 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 6 states. [2018-01-31 08:38:35,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:38:35,564 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2018-01-31 08:38:35,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:38:35,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-31 08:38:35,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:38:35,567 INFO L225 Difference]: With dead ends: 144 [2018-01-31 08:38:35,567 INFO L226 Difference]: Without dead ends: 92 [2018-01-31 08:38:35,568 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:38:35,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-31 08:38:35,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2018-01-31 08:38:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-31 08:38:35,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2018-01-31 08:38:35,578 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 25 [2018-01-31 08:38:35,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:38:35,579 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2018-01-31 08:38:35,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:38:35,579 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-01-31 08:38:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:38:35,580 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:38:35,581 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:38:35,581 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:38:35,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1833243520, now seen corresponding path program 1 times [2018-01-31 08:38:35,581 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:38:35,582 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:38:35,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:35,583 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:38:35,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:35,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:38:35,688 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-31 08:38:35,689 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:38:35,689 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:38:35,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:38:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:35,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:38:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:38:35,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:38:35,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-01-31 08:38:35,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:38:35,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:38:35,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:38:35,903 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 8 states. [2018-01-31 08:38:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:38:36,551 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-01-31 08:38:36,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:38:36,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-31 08:38:36,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:38:36,553 INFO L225 Difference]: With dead ends: 117 [2018-01-31 08:38:36,553 INFO L226 Difference]: Without dead ends: 96 [2018-01-31 08:38:36,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:38:36,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-31 08:38:36,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2018-01-31 08:38:36,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-31 08:38:36,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-01-31 08:38:36,563 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 37 [2018-01-31 08:38:36,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:38:36,564 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-01-31 08:38:36,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:38:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-01-31 08:38:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-31 08:38:36,566 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:38:36,566 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:38:36,566 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:38:36,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1055716779, now seen corresponding path program 1 times [2018-01-31 08:38:36,566 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:38:36,566 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:38:36,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:36,568 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:38:36,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:36,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:38:36,664 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-31 08:38:36,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:38:36,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:38:36,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:38:36,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:38:36,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:38:36,666 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 3 states. [2018-01-31 08:38:36,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:38:36,747 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-01-31 08:38:36,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:38:36,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-01-31 08:38:36,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:38:36,751 INFO L225 Difference]: With dead ends: 100 [2018-01-31 08:38:36,751 INFO L226 Difference]: Without dead ends: 99 [2018-01-31 08:38:36,751 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:38:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-31 08:38:36,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2018-01-31 08:38:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-31 08:38:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-01-31 08:38:36,760 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 46 [2018-01-31 08:38:36,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:38:36,761 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-01-31 08:38:36,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:38:36,761 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-01-31 08:38:36,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 08:38:36,763 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:38:36,763 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:38:36,763 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:38:36,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1632518168, now seen corresponding path program 1 times [2018-01-31 08:38:36,763 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:38:36,764 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:38:36,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:36,765 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:38:36,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:36,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:38:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:38:36,897 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:38:36,897 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-31 08:38:36,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:38:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:36,936 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:38:36,956 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-31 08:38:36,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:38:36,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:38:36,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:38:37,090 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:38:37,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:38:37,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 6 [2018-01-31 08:38:37,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:38:37,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:38:37,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:38:37,127 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 7 states. [2018-01-31 08:38:37,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:38:37,236 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-01-31 08:38:37,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:38:37,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-01-31 08:38:37,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:38:37,240 INFO L225 Difference]: With dead ends: 89 [2018-01-31 08:38:37,240 INFO L226 Difference]: Without dead ends: 88 [2018-01-31 08:38:37,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:38:37,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-31 08:38:37,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-01-31 08:38:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 08:38:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-01-31 08:38:37,256 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 47 [2018-01-31 08:38:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:38:37,256 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-01-31 08:38:37,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:38:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-01-31 08:38:37,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 08:38:37,258 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:38:37,258 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:38:37,258 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:38:37,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1632518167, now seen corresponding path program 1 times [2018-01-31 08:38:37,259 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:38:37,260 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:38:37,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:37,261 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:38:37,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:37,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:38:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:38:37,625 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:38:37,625 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:38:37,630 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:38:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:37,663 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:38:37,680 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-31 08:38:37,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:38:37,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:38:37,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:38:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:38:37,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:38:37,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2018-01-31 08:38:37,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:38:37,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:38:37,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:38:37,798 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 8 states. [2018-01-31 08:38:38,031 WARN L143 SmtUtils]: Spent 102ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-31 08:38:38,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:38:38,281 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-01-31 08:38:38,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:38:38,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-01-31 08:38:38,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:38:38,283 INFO L225 Difference]: With dead ends: 97 [2018-01-31 08:38:38,283 INFO L226 Difference]: Without dead ends: 96 [2018-01-31 08:38:38,284 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:38:38,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-31 08:38:38,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 89. [2018-01-31 08:38:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-31 08:38:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-01-31 08:38:38,297 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 47 [2018-01-31 08:38:38,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:38:38,299 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-01-31 08:38:38,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:38:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-01-31 08:38:38,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-31 08:38:38,300 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:38:38,301 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:38:38,301 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:38:38,301 INFO L82 PathProgramCache]: Analyzing trace with hash 275780314, now seen corresponding path program 1 times [2018-01-31 08:38:38,301 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:38:38,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:38:38,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:38,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:38:38,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:38,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:38:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:38:38,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:38:38,428 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:38:38,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:38:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:38,478 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:38:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:38:38,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:38:38,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-01-31 08:38:38,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:38:38,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:38:38,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:38:38,723 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 15 states. [2018-01-31 08:38:38,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:38:38,953 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2018-01-31 08:38:38,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:38:38,954 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-01-31 08:38:38,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:38:38,955 INFO L225 Difference]: With dead ends: 181 [2018-01-31 08:38:38,955 INFO L226 Difference]: Without dead ends: 127 [2018-01-31 08:38:38,956 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2018-01-31 08:38:38,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-31 08:38:38,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2018-01-31 08:38:38,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-31 08:38:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2018-01-31 08:38:38,970 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 55 [2018-01-31 08:38:38,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:38:38,970 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2018-01-31 08:38:38,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:38:38,971 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2018-01-31 08:38:38,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-31 08:38:38,972 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:38:38,973 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:38:38,973 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:38:38,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1105514929, now seen corresponding path program 1 times [2018-01-31 08:38:38,973 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:38:38,973 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:38:38,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:38,974 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:38:38,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:38,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:38:39,201 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-31 08:38:39,201 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:38:39,201 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:38:39,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:38:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:39,237 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:38:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:38:39,422 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:38:39,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2018-01-31 08:38:39,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:38:39,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:38:39,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:38:39,423 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 13 states. [2018-01-31 08:38:39,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:38:39,927 INFO L93 Difference]: Finished difference Result 201 states and 212 transitions. [2018-01-31 08:38:39,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:38:39,928 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-01-31 08:38:39,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:38:39,929 INFO L225 Difference]: With dead ends: 201 [2018-01-31 08:38:39,929 INFO L226 Difference]: Without dead ends: 141 [2018-01-31 08:38:39,930 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2018-01-31 08:38:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-31 08:38:39,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2018-01-31 08:38:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-31 08:38:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2018-01-31 08:38:39,941 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 65 [2018-01-31 08:38:39,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:38:39,941 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2018-01-31 08:38:39,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:38:39,942 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2018-01-31 08:38:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-31 08:38:39,943 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:38:39,943 INFO L351 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:38:39,943 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:38:39,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1979655572, now seen corresponding path program 2 times [2018-01-31 08:38:39,944 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:38:39,944 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:38:39,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:39,945 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:38:39,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:39,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:38:40,053 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-31 08:38:40,053 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:38:40,053 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:38:40,059 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:38:40,074 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:38:40,097 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:38:40,113 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:38:40,118 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:38:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 32 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-31 08:38:40,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:38:40,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 12] total 14 [2018-01-31 08:38:40,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:38:40,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:38:40,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:38:40,695 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand 15 states. [2018-01-31 08:38:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:38:41,157 INFO L93 Difference]: Finished difference Result 185 states and 192 transitions. [2018-01-31 08:38:41,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-31 08:38:41,157 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 85 [2018-01-31 08:38:41,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:38:41,159 INFO L225 Difference]: With dead ends: 185 [2018-01-31 08:38:41,159 INFO L226 Difference]: Without dead ends: 184 [2018-01-31 08:38:41,159 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2018-01-31 08:38:41,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-31 08:38:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 151. [2018-01-31 08:38:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-31 08:38:41,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 157 transitions. [2018-01-31 08:38:41,172 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 157 transitions. Word has length 85 [2018-01-31 08:38:41,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:38:41,172 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 157 transitions. [2018-01-31 08:38:41,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:38:41,172 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 157 transitions. [2018-01-31 08:38:41,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-31 08:38:41,174 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:38:41,174 INFO L351 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:38:41,174 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:38:41,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1239780640, now seen corresponding path program 1 times [2018-01-31 08:38:41,175 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:38:41,175 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:38:41,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:41,176 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:38:41,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:41,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:38:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 31 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-31 08:38:41,459 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:38:41,459 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:38:41,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:38:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:41,491 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:38:41,500 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-31 08:38:41,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:38:41,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:38:41,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:38:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 31 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-31 08:38:41,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:38:41,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2018-01-31 08:38:41,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:38:41,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:38:41,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:38:41,834 INFO L87 Difference]: Start difference. First operand 151 states and 157 transitions. Second operand 10 states. [2018-01-31 08:38:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:38:42,148 INFO L93 Difference]: Finished difference Result 176 states and 184 transitions. [2018-01-31 08:38:42,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:38:42,148 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2018-01-31 08:38:42,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:38:42,150 INFO L225 Difference]: With dead ends: 176 [2018-01-31 08:38:42,150 INFO L226 Difference]: Without dead ends: 175 [2018-01-31 08:38:42,150 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 79 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:38:42,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-31 08:38:42,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 161. [2018-01-31 08:38:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-31 08:38:42,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 168 transitions. [2018-01-31 08:38:42,170 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 168 transitions. Word has length 86 [2018-01-31 08:38:42,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:38:42,170 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 168 transitions. [2018-01-31 08:38:42,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:38:42,171 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 168 transitions. [2018-01-31 08:38:42,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-01-31 08:38:42,172 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:38:42,172 INFO L351 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:38:42,172 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:38:42,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2028181181, now seen corresponding path program 2 times [2018-01-31 08:38:42,173 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:38:42,179 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:38:42,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:42,180 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:38:42,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:42,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:38:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 49 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-01-31 08:38:42,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:38:42,788 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:38:42,794 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:38:42,806 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:38:42,815 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:38:42,817 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:38:42,821 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:38:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 61 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-31 08:38:43,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:38:43,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2018-01-31 08:38:43,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-31 08:38:43,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-31 08:38:43,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:38:43,132 INFO L87 Difference]: Start difference. First operand 161 states and 168 transitions. Second operand 26 states. [2018-01-31 08:38:44,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:38:44,492 INFO L93 Difference]: Finished difference Result 255 states and 269 transitions. [2018-01-31 08:38:44,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-31 08:38:44,493 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 95 [2018-01-31 08:38:44,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:38:44,494 INFO L225 Difference]: With dead ends: 255 [2018-01-31 08:38:44,494 INFO L226 Difference]: Without dead ends: 180 [2018-01-31 08:38:44,496 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=429, Invalid=2651, Unknown=0, NotChecked=0, Total=3080 [2018-01-31 08:38:44,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-31 08:38:44,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 146. [2018-01-31 08:38:44,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-31 08:38:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 150 transitions. [2018-01-31 08:38:44,507 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 150 transitions. Word has length 95 [2018-01-31 08:38:44,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:38:44,507 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 150 transitions. [2018-01-31 08:38:44,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-31 08:38:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-01-31 08:38:44,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-31 08:38:44,509 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:38:44,509 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:38:44,509 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:38:44,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1032799290, now seen corresponding path program 1 times [2018-01-31 08:38:44,510 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:38:44,510 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:38:44,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:44,511 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:38:44,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:44,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:38:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 49 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-31 08:38:44,618 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:38:44,618 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:38:44,623 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:38:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:44,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:38:44,738 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-31 08:38:44,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:38:44,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2018-01-31 08:38:44,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 08:38:44,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 08:38:44,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:38:44,759 INFO L87 Difference]: Start difference. First operand 146 states and 150 transitions. Second operand 18 states. [2018-01-31 08:38:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:38:45,135 INFO L93 Difference]: Finished difference Result 232 states and 239 transitions. [2018-01-31 08:38:45,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 08:38:45,136 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 104 [2018-01-31 08:38:45,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:38:45,137 INFO L225 Difference]: With dead ends: 232 [2018-01-31 08:38:45,137 INFO L226 Difference]: Without dead ends: 176 [2018-01-31 08:38:45,138 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:38:45,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-31 08:38:45,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 155. [2018-01-31 08:38:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-31 08:38:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 158 transitions. [2018-01-31 08:38:45,150 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 158 transitions. Word has length 104 [2018-01-31 08:38:45,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:38:45,150 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 158 transitions. [2018-01-31 08:38:45,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 08:38:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 158 transitions. [2018-01-31 08:38:45,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-01-31 08:38:45,161 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:38:45,162 INFO L351 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:38:45,162 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:38:45,162 INFO L82 PathProgramCache]: Analyzing trace with hash -395053783, now seen corresponding path program 2 times [2018-01-31 08:38:45,162 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:38:45,162 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:38:45,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:45,163 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:38:45,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:45,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:38:45,855 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 40 proven. 58 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-31 08:38:45,855 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:38:45,855 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:38:45,860 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:38:45,870 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:38:45,871 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:38:45,875 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:38:45,941 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:45,944 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-31 08:38:45,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:38:45,946 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-31 08:38:45,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-31 08:38:46,030 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:46,031 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-31 08:38:46,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:38:46,062 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-31 08:38:46,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-31 08:38:46,202 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:46,202 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-31 08:38:46,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:38:46,204 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-31 08:38:46,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-31 08:38:46,325 WARN L1033 $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-31 08:38:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-01-31 08:38:46,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:38:46,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 22 [2018-01-31 08:38:46,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 08:38:46,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 08:38:46,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=363, Unknown=1, NotChecked=38, Total=462 [2018-01-31 08:38:46,368 INFO L87 Difference]: Start difference. First operand 155 states and 158 transitions. Second operand 22 states. [2018-01-31 08:38:46,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:38:46,998 INFO L93 Difference]: Finished difference Result 169 states and 173 transitions. [2018-01-31 08:38:46,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 08:38:46,999 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 113 [2018-01-31 08:38:46,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:38:47,000 INFO L225 Difference]: With dead ends: 169 [2018-01-31 08:38:47,000 INFO L226 Difference]: Without dead ends: 156 [2018-01-31 08:38:47,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=244, Invalid=1398, Unknown=2, NotChecked=78, Total=1722 [2018-01-31 08:38:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-31 08:38:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 147. [2018-01-31 08:38:47,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-31 08:38:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2018-01-31 08:38:47,015 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 113 [2018-01-31 08:38:47,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:38:47,016 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2018-01-31 08:38:47,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 08:38:47,016 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2018-01-31 08:38:47,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-01-31 08:38:47,017 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:38:47,017 INFO L351 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2018-01-31 08:38:47,017 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:38:47,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1399123569, now seen corresponding path program 1 times [2018-01-31 08:38:47,017 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:38:47,017 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:38:47,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:47,019 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:38:47,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:47,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:38:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-01-31 08:38:47,469 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:38:47,469 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-31 08:38:47,480 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:38:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:47,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:38:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-31 08:38:47,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:38:47,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 13 [2018-01-31 08:38:47,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:38:47,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:38:47,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:38:47,682 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 13 states. [2018-01-31 08:38:47,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:38:47,858 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2018-01-31 08:38:47,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:38:47,858 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-01-31 08:38:47,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:38:47,859 INFO L225 Difference]: With dead ends: 185 [2018-01-31 08:38:47,859 INFO L226 Difference]: Without dead ends: 173 [2018-01-31 08:38:47,860 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:38:47,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-01-31 08:38:47,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 162. [2018-01-31 08:38:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-31 08:38:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 164 transitions. [2018-01-31 08:38:47,874 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 164 transitions. Word has length 115 [2018-01-31 08:38:47,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:38:47,874 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 164 transitions. [2018-01-31 08:38:47,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:38:47,874 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 164 transitions. [2018-01-31 08:38:47,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-01-31 08:38:47,876 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:38:47,876 INFO L351 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:38:47,876 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:38:47,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1775952036, now seen corresponding path program 2 times [2018-01-31 08:38:47,877 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:38:47,877 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:38:47,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:47,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:38:47,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:38:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:38:47,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:38:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-01-31 08:38:48,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:38:48,108 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:38:48,113 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:38:48,124 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:38:48,142 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:38:48,144 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:38:48,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:38:48,368 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 170 proven. 13 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-01-31 08:38:48,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:38:48,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16] total 20 [2018-01-31 08:38:48,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-31 08:38:48,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-31 08:38:48,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:38:48,402 INFO L87 Difference]: Start difference. First operand 162 states and 164 transitions. Second operand 20 states. [2018-01-31 08:38:49,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:38:49,163 INFO L93 Difference]: Finished difference Result 240 states and 246 transitions. [2018-01-31 08:38:49,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-31 08:38:49,164 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 161 [2018-01-31 08:38:49,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:38:49,165 INFO L225 Difference]: With dead ends: 240 [2018-01-31 08:38:49,165 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 08:38:49,166 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=1417, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 08:38:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 08:38:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 08:38:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 08:38:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 08:38:49,166 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2018-01-31 08:38:49,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:38:49,167 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 08:38:49,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-31 08:38:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 08:38:49,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 08:38:49,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 08:38:49,255 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:38:49,525 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 47 DAG size of output 31 [2018-01-31 08:38:49,626 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 47 DAG size of output 33 [2018-01-31 08:38:49,783 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 44 DAG size of output 1 [2018-01-31 08:38:50,040 WARN L146 SmtUtils]: Spent 255ms on a formula simplification. DAG size of input: 79 DAG size of output 48 [2018-01-31 08:38:50,158 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 42 DAG size of output 33 [2018-01-31 08:38:50,161 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 35) no Hoare annotation was computed. [2018-01-31 08:38:50,161 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-31 08:38:50,162 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:38:50,162 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-31 08:38:50,162 INFO L399 ceAbstractionStarter]: For program point L15''''(line 15) no Hoare annotation was computed. [2018-01-31 08:38:50,162 INFO L399 ceAbstractionStarter]: For program point fooEXIT(lines 12 19) no Hoare annotation was computed. [2018-01-31 08:38:50,162 INFO L395 ceAbstractionStarter]: At program point L15''''''(lines 15 17) the Hoare annotation is: (let ((.cse1 (= foo_~i~1 0)) (.cse0 (not (= 0 |foo_#in~b.offset|))) (.cse2 (not (= (select |#valid| |foo_#in~b.base|) 1))) (.cse3 (not (= 32 (select |#length| |foo_#in~b.base|))))) (and (or .cse0 .cse1 .cse2 (not (= 0 |foo_#in~size|)) .cse3) (let ((.cse7 (= (select |#length| foo_~b.base) 32)) (.cse4 (<= foo_~size |foo_#in~size|)) (.cse5 (<= |foo_#in~size| foo_~size)) (.cse6 (= 1 (select |#valid| foo_~b.base))) (.cse8 (= foo_~b.offset 0))) (or (and .cse4 .cse5 (and .cse6 .cse7 .cse8 (<= 1 foo_~i~1))) (< 31 |foo_#in~size|) .cse0 .cse2 .cse3 (and .cse7 .cse4 .cse5 .cse6 .cse8 .cse1))) (or .cse0 (and (<= 2 |foo_#in~size|) (<= foo_~i~1 2)) (<= foo_~i~1 1) .cse2 (< 2 |foo_#in~size|) .cse3))) [2018-01-31 08:38:50,162 INFO L399 ceAbstractionStarter]: For program point L15'''''''(lines 15 17) no Hoare annotation was computed. [2018-01-31 08:38:50,162 INFO L399 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-31 08:38:50,162 INFO L399 ceAbstractionStarter]: For program point L16'''(line 16) no Hoare annotation was computed. [2018-01-31 08:38:50,163 INFO L399 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-31 08:38:50,163 INFO L399 ceAbstractionStarter]: For program point L15'(lines 15 17) no Hoare annotation was computed. [2018-01-31 08:38:50,163 INFO L399 ceAbstractionStarter]: For program point L16''(line 16) no Hoare annotation was computed. [2018-01-31 08:38:50,163 INFO L399 ceAbstractionStarter]: For program point fooFINAL(lines 12 19) no Hoare annotation was computed. [2018-01-31 08:38:50,163 INFO L399 ceAbstractionStarter]: For program point L15'''''(line 15) no Hoare annotation was computed. [2018-01-31 08:38:50,163 INFO L402 ceAbstractionStarter]: At program point fooENTRY(lines 12 19) the Hoare annotation is: true [2018-01-31 08:38:50,163 INFO L399 ceAbstractionStarter]: For program point L12(lines 12 19) no Hoare annotation was computed. [2018-01-31 08:38:50,163 INFO L399 ceAbstractionStarter]: For program point L15'''(lines 15 17) no Hoare annotation was computed. [2018-01-31 08:38:50,163 INFO L399 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-01-31 08:38:50,164 INFO L399 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-01-31 08:38:50,164 INFO L399 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-01-31 08:38:50,164 INFO L399 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-01-31 08:38:50,164 INFO L399 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-01-31 08:38:50,165 INFO L399 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 16) no Hoare annotation was computed. [2018-01-31 08:38:50,165 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 35) the Hoare annotation is: true [2018-01-31 08:38:50,165 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-31 08:38:50,165 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 35) the Hoare annotation is: true [2018-01-31 08:38:50,165 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-31 08:38:50,165 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 21 35) no Hoare annotation was computed. [2018-01-31 08:38:50,165 INFO L399 ceAbstractionStarter]: For program point mainErr1AssertViolation(line 30) no Hoare annotation was computed. [2018-01-31 08:38:50,165 INFO L399 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-01-31 08:38:50,165 INFO L399 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-01-31 08:38:50,166 INFO L399 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-01-31 08:38:50,166 INFO L399 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-01-31 08:38:50,166 INFO L399 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-31 08:38:50,166 INFO L399 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-01-31 08:38:50,166 INFO L399 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-01-31 08:38:50,166 INFO L399 ceAbstractionStarter]: For program point L27''''(line 27) no Hoare annotation was computed. [2018-01-31 08:38:50,166 INFO L395 ceAbstractionStarter]: At program point L27'(line 27) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| main_~c~3.base))) (.cse1 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse2 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse3 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse4 (= 0 |main_~#mask~3.offset|)) (.cse5 (= 0 main_~c~3.offset)) (.cse6 (= 32 (select |#length| main_~c~3.base)))) (or (and .cse0 .cse1 (= (select main_~b~3 0) 0) .cse2 .cse3 .cse4 .cse5 (<= 1 main_~i~3) .cse6 (<= main_~i~3 31)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 main_~i~3) .cse6))) [2018-01-31 08:38:50,166 INFO L399 ceAbstractionStarter]: For program point L27'''(line 27) no Hoare annotation was computed. [2018-01-31 08:38:50,166 INFO L399 ceAbstractionStarter]: For program point L29''''''(lines 29 33) no Hoare annotation was computed. [2018-01-31 08:38:50,167 INFO L399 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-31 08:38:50,167 INFO L399 ceAbstractionStarter]: For program point L24''(line 24) no Hoare annotation was computed. [2018-01-31 08:38:50,167 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 21 35) no Hoare annotation was computed. [2018-01-31 08:38:50,167 INFO L399 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-01-31 08:38:50,167 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-01-31 08:38:50,167 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:38:50,167 INFO L399 ceAbstractionStarter]: For program point L29''''(line 29) no Hoare annotation was computed. [2018-01-31 08:38:50,167 INFO L399 ceAbstractionStarter]: For program point L25'''''''(lines 25 28) no Hoare annotation was computed. [2018-01-31 08:38:50,167 INFO L399 ceAbstractionStarter]: For program point L30'(lines 30 32) no Hoare annotation was computed. [2018-01-31 08:38:50,167 INFO L399 ceAbstractionStarter]: For program point L25'''''(line 25) no Hoare annotation was computed. [2018-01-31 08:38:50,168 INFO L399 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 27) no Hoare annotation was computed. [2018-01-31 08:38:50,168 INFO L399 ceAbstractionStarter]: For program point L25'''(lines 25 28) no Hoare annotation was computed. [2018-01-31 08:38:50,168 INFO L399 ceAbstractionStarter]: For program point L24''''(line 24) no Hoare annotation was computed. [2018-01-31 08:38:50,168 INFO L395 ceAbstractionStarter]: At program point L25''''''(lines 25 28) 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 (select |#valid| main_~c~3.base)) .cse0 (= (select main_~b~3 0) 0) .cse1 .cse2 .cse3 (= 0 main_~c~3.offset) (<= 1 main_~i~3) (= 32 (select |#length| main_~c~3.base))) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-31 08:38:50,168 INFO L399 ceAbstractionStarter]: For program point L25'(lines 25 28) no Hoare annotation was computed. [2018-01-31 08:38:50,168 INFO L399 ceAbstractionStarter]: For program point L24'''''(line 24) no Hoare annotation was computed. [2018-01-31 08:38:50,168 INFO L399 ceAbstractionStarter]: For program point L29'''(line 29) no Hoare annotation was computed. [2018-01-31 08:38:50,168 INFO L399 ceAbstractionStarter]: For program point L25''''(line 25) no Hoare annotation was computed. [2018-01-31 08:38:50,168 INFO L399 ceAbstractionStarter]: For program point L24'''(line 24) no Hoare annotation was computed. [2018-01-31 08:38:50,168 INFO L399 ceAbstractionStarter]: For program point L29''(lines 29 33) no Hoare annotation was computed. [2018-01-31 08:38:50,168 INFO L399 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-01-31 08:38:50,169 INFO L395 ceAbstractionStarter]: At program point L29'''''(lines 29 33) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| main_~c~3.base))) (.cse1 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse2 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse6 (= 32 (select |#length| main_~c~3.base))) (.cse3 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse4 (= 0 |main_~#mask~3.offset|)) (.cse5 (= 0 main_~c~3.offset))) (or (and (= (select main_~b~3 main_~i~3) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 main_~i~3) .cse6) (and (<= 1 main_~i~3) .cse0 .cse1 (= (select main_~b~3 0) 0) .cse2 .cse6 .cse3 .cse4 .cse5))) [2018-01-31 08:38:50,169 INFO L399 ceAbstractionStarter]: For program point L24'(line 24) no Hoare annotation was computed. [2018-01-31 08:38:50,178 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,179 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,179 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,197 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,197 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:38:50 BoogieIcfgContainer [2018-01-31 08:38:50,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:38:50,202 INFO L168 Benchmark]: Toolchain (without parser) took 16771.01 ms. Allocated memory was 303.0 MB in the beginning and 590.3 MB in the end (delta: 287.3 MB). Free memory was 263.8 MB in the beginning and 439.6 MB in the end (delta: -175.8 MB). Peak memory consumption was 223.8 MB. Max. memory is 5.3 GB. [2018-01-31 08:38:50,204 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 303.0 MB. Free memory is still 268.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:38:50,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.14 ms. Allocated memory is still 303.0 MB. Free memory was 262.8 MB in the beginning and 254.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:38:50,204 INFO L168 Benchmark]: Boogie Preprocessor took 44.03 ms. Allocated memory is still 303.0 MB. Free memory was 254.8 MB in the beginning and 252.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:38:50,205 INFO L168 Benchmark]: RCFGBuilder took 527.55 ms. Allocated memory is still 303.0 MB. Free memory was 252.8 MB in the beginning and 234.8 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:38:50,205 INFO L168 Benchmark]: TraceAbstraction took 15935.39 ms. Allocated memory was 303.0 MB in the beginning and 590.3 MB in the end (delta: 287.3 MB). Free memory was 234.8 MB in the beginning and 439.6 MB in the end (delta: -204.8 MB). Peak memory consumption was 194.8 MB. Max. memory is 5.3 GB. [2018-01-31 08:38:50,206 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.16 ms. Allocated memory is still 303.0 MB. Free memory is still 268.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 251.14 ms. Allocated memory is still 303.0 MB. Free memory was 262.8 MB in the beginning and 254.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.03 ms. Allocated memory is still 303.0 MB. Free memory was 254.8 MB in the beginning and 252.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 527.55 ms. Allocated memory is still 303.0 MB. Free memory was 252.8 MB in the beginning and 234.8 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 15935.39 ms. Allocated memory was 303.0 MB in the beginning and 590.3 MB in the end (delta: 287.3 MB). Free memory was 234.8 MB in the beginning and 439.6 MB in the end (delta: -204.8 MB). Peak memory consumption was 194.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 30]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant [2018-01-31 08:38:50,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,218 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,218 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,218 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[c] && 32 == unknown-#length-unknown[mask]) && b[0] == 0) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) && 0 == c) && 1 <= i) && 32 == unknown-#length-unknown[c]) || ((((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-31 08:38:50,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,229 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,229 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,229 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((!(0 == b) || i == 0) || !(\valid[b] == 1)) || !(0 == \old(size))) || !(32 == unknown-#length-unknown[b])) && (((((((size <= \old(size) && \old(size) <= size) && ((1 == \valid[b] && unknown-#length-unknown[b] == 32) && b == 0) && 1 <= i) || 31 < \old(size)) || !(0 == b)) || !(\valid[b] == 1)) || !(32 == unknown-#length-unknown[b])) || (((((unknown-#length-unknown[b] == 32 && size <= \old(size)) && \old(size) <= size) && 1 == \valid[b]) && b == 0) && i == 0))) && (((((!(0 == b) || (2 <= \old(size) && i <= 2)) || i <= 1) || !(\valid[b] == 1)) || 2 < \old(size)) || !(32 == unknown-#length-unknown[b])) - InvariantResult [Line: 29]: Loop Invariant [2018-01-31 08:38:50,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,233 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,234 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,234 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,234 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:38:50,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((b[i] == 0 && 1 == \valid[c]) && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) && 0 == c) && 0 == i) && 32 == unknown-#length-unknown[c]) || ((((((((1 <= i && 1 == \valid[c]) && 32 == unknown-#length-unknown[mask]) && b[0] == 0) && \old(\valid)[mask := 1] == \valid) && 32 == unknown-#length-unknown[c]) && 0 == \old(\valid)[mask]) && 0 == mask) && 0 == c) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 64 locations, 6 error locations. SAFE Result, 15.8s OverallTime, 15 OverallIterations, 9 TraceHistogramMax, 6.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 809 SDtfs, 1692 SDslu, 4291 SDs, 0 SdLazy, 3253 SolverSat, 241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1262 GetRequests, 938 SyntacticMatches, 22 SemanticMatches, 302 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2081 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 214 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 29 PreInvPairs, 50 NumberOfFragments, 362 HoareAnnotationTreeSize, 29 FomulaSimplifications, 440 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1333 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 2107 NumberOfCodeBlocks, 2017 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2080 ConstructedInterpolants, 108 QuantifiedInterpolants, 629919 SizeOfPredicates, 75 NumberOfNonLiveVariables, 1908 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 1571/1816 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-38-50-245.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-38-50-245.csv Received shutdown request...