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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:20:27,255 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:20:27,257 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:20:27,272 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:20:27,272 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:20:27,273 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:20:27,274 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:20:27,276 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:20:27,278 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:20:27,278 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:20:27,279 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:20:27,280 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:20:27,280 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:20:27,282 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:20:27,283 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:20:27,285 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:20:27,287 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:20:27,289 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:20:27,290 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:20:27,292 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:20:27,294 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:20:27,294 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:20:27,295 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:20:27,296 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:20:27,296 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:20:27,298 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:20:27,298 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:20:27,299 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:20:27,299 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:20:27,299 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:20:27,300 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:20:27,300 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:20:27,308 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:20:27,308 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:20:27,309 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:20:27,309 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:20:27,309 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:20:27,309 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:20:27,310 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:20:27,310 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:20:27,310 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:20:27,310 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:20:27,310 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:20:27,310 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:20:27,311 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:20:27,311 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:20:27,311 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:20:27,311 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:20:27,311 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:20:27,311 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:20:27,311 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:20:27,311 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:20:27,312 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:20:27,312 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:20:27,312 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:20:27,312 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:20:27,312 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:20:27,313 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:20:27,313 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:20:27,313 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:20:27,313 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:20:27,313 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:20:27,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:20:27,313 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:20:27,314 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:20:27,314 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:20:27,346 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:20:27,357 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:20:27,360 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:20:27,361 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:20:27,362 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:20:27,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2018-01-24 13:20:27,464 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:20:27,469 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:20:27,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:20:27,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:20:27,476 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:20:27,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:20:27" (1/1) ... [2018-01-24 13:20:27,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d10e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:27, skipping insertion in model container [2018-01-24 13:20:27,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:20:27" (1/1) ... [2018-01-24 13:20:27,493 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:20:27,507 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:20:27,616 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:20:27,631 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:20:27,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:27 WrapperNode [2018-01-24 13:20:27,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:20:27,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:20:27,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:20:27,662 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:20:27,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:27" (1/1) ... [2018-01-24 13:20:27,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:27" (1/1) ... [2018-01-24 13:20:27,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:27" (1/1) ... [2018-01-24 13:20:27,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:27" (1/1) ... [2018-01-24 13:20:27,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:27" (1/1) ... [2018-01-24 13:20:27,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:27" (1/1) ... [2018-01-24 13:20:27,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:27" (1/1) ... [2018-01-24 13:20:27,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:20:27,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:20:27,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:20:27,693 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:20:27,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:27" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:20:27,736 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:20:27,737 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:20:27,737 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 13:20:27,737 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:20:27,737 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 13:20:27,737 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 13:20:27,737 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:20:27,737 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:20:27,737 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:20:27,737 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 13:20:27,738 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:20:27,738 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:20:27,738 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:20:27,902 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:20:27,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:20:27 BoogieIcfgContainer [2018-01-24 13:20:27,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:20:27,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:20:27,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:20:27,907 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:20:27,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:20:27" (1/3) ... [2018-01-24 13:20:27,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e8045c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:20:27, skipping insertion in model container [2018-01-24 13:20:27,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:27" (2/3) ... [2018-01-24 13:20:27,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e8045c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:20:27, skipping insertion in model container [2018-01-24 13:20:27,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:20:27" (3/3) ... [2018-01-24 13:20:27,910 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c [2018-01-24 13:20:27,917 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:20:27,924 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-24 13:20:27,968 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:20:27,969 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:20:27,969 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:20:27,969 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:20:27,969 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:20:27,969 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:20:27,970 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:20:27,970 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:20:27,971 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:20:27,991 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 13:20:27,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 13:20:27,998 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:27,999 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:27,999 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:28,004 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-01-24 13:20:28,007 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:28,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:28,057 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:28,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:28,057 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:28,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:28,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:28,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:20:28,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:20:28,188 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:28,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:20:28,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:20:28,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:20:28,208 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-24 13:20:28,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:28,296 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-01-24 13:20:28,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:20:28,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-24 13:20:28,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:28,305 INFO L225 Difference]: With dead ends: 101 [2018-01-24 13:20:28,305 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 13:20:28,308 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:20:28,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 13:20:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-01-24 13:20:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 13:20:28,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-24 13:20:28,408 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-01-24 13:20:28,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:28,408 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-24 13:20:28,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:20:28,408 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-24 13:20:28,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 13:20:28,409 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:28,409 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:28,409 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:28,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-01-24 13:20:28,409 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:28,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:28,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:28,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:28,410 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:28,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:28,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:20:28,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:20:28,510 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:28,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:20:28,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:20:28,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:20:28,514 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-01-24 13:20:28,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:28,628 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-01-24 13:20:28,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:20:28,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 13:20:28,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:28,630 INFO L225 Difference]: With dead ends: 103 [2018-01-24 13:20:28,631 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 13:20:28,632 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:20:28,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 13:20:28,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-01-24 13:20:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 13:20:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-24 13:20:28,641 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 16 [2018-01-24 13:20:28,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:28,641 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-24 13:20:28,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:20:28,642 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-24 13:20:28,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 13:20:28,642 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:28,643 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:28,643 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:28,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-01-24 13:20:28,643 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:28,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:28,645 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:28,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:28,645 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:28,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:28,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:28,710 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:28,710 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:20:28,720 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:28,720 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:28,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:28,840 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:28,929 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:20:28,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2018-01-24 13:20:28,930 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:28,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:20:28,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:20:28,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:20:28,931 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-01-24 13:20:29,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:29,050 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-01-24 13:20:29,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:20:29,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-24 13:20:29,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:29,052 INFO L225 Difference]: With dead ends: 67 [2018-01-24 13:20:29,052 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 13:20:29,052 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:20:29,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 13:20:29,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-01-24 13:20:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 13:20:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-01-24 13:20:29,060 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 23 [2018-01-24 13:20:29,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:29,060 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-01-24 13:20:29,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:20:29,061 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-01-24 13:20:29,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 13:20:29,062 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:29,062 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:29,062 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:29,062 INFO L82 PathProgramCache]: Analyzing trace with hash 621927392, now seen corresponding path program 1 times [2018-01-24 13:20:29,062 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:29,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:29,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:29,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:29,064 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:29,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:29,139 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:29,139 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:20:29,150 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:29,150 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:29,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:29,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 13:20:29,185 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:29,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 13:20:29,231 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:20:29,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [6] total 7 [2018-01-24 13:20:29,231 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:29,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:20:29,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:20:29,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:20:29,232 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 3 states. [2018-01-24 13:20:29,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:29,266 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-01-24 13:20:29,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:20:29,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-24 13:20:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:29,269 INFO L225 Difference]: With dead ends: 65 [2018-01-24 13:20:29,269 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 13:20:29,270 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:20:29,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 13:20:29,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-01-24 13:20:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 13:20:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-24 13:20:29,278 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 28 [2018-01-24 13:20:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:29,278 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-24 13:20:29,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:20:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-24 13:20:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 13:20:29,280 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:29,280 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:29,280 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:29,280 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880015, now seen corresponding path program 1 times [2018-01-24 13:20:29,280 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:29,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:29,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:29,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:29,281 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:29,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:29,585 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:29,585 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:20:29,592 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:29,592 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:29,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:29,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:20:29,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:29,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:20:29,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:20:29,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:20:29,686 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:20:29,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:29,796 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:20:29,800 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:29,800 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:29,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:29,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:20:29,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:29,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:20:29,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:20:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:20:29,873 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:20:29,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:20:29,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5, 6, 5] total 15 [2018-01-24 13:20:29,889 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:20:29,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 13:20:29,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 13:20:29,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-01-24 13:20:29,891 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 12 states. [2018-01-24 13:20:30,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:30,159 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-01-24 13:20:30,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 13:20:30,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-01-24 13:20:30,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:30,162 INFO L225 Difference]: With dead ends: 127 [2018-01-24 13:20:30,162 INFO L226 Difference]: Without dead ends: 110 [2018-01-24 13:20:30,163 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-01-24 13:20:30,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-24 13:20:30,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 66. [2018-01-24 13:20:30,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-24 13:20:30,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-01-24 13:20:30,173 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 29 [2018-01-24 13:20:30,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:30,173 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-01-24 13:20:30,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 13:20:30,173 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-01-24 13:20:30,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 13:20:30,175 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:30,175 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:30,175 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:30,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880014, now seen corresponding path program 1 times [2018-01-24 13:20:30,176 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:30,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:30,177 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:30,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:30,177 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:30,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:20:30,239 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:30,239 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:20:30,247 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:30,247 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:30,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:30,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:20:30,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:30,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:20:30,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:20:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:20:30,290 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:30,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:20:30,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:30,319 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:20:30,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:30,322 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:30,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:30,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:20:30,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:30,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:20:30,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:20:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:20:30,395 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:30,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:20:30,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:20:30,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5, 6, 5] total 6 [2018-01-24 13:20:30,410 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:20:30,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:20:30,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:20:30,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:20:30,411 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 7 states. [2018-01-24 13:20:30,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:30,503 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-01-24 13:20:30,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:20:30,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-24 13:20:30,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:30,505 INFO L225 Difference]: With dead ends: 66 [2018-01-24 13:20:30,505 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 13:20:30,505 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 108 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:20:30,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 13:20:30,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-24 13:20:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-24 13:20:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-01-24 13:20:30,513 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 29 [2018-01-24 13:20:30,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:30,513 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-01-24 13:20:30,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:20:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-01-24 13:20:30,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 13:20:30,515 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:30,515 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:30,515 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:30,515 INFO L82 PathProgramCache]: Analyzing trace with hash -533212584, now seen corresponding path program 1 times [2018-01-24 13:20:30,515 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:30,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:30,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:30,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:30,517 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:30,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:30,633 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:30,633 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:20:30,641 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:30,642 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:30,662 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:30,721 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:30,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:30,791 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:20:30,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:30,795 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:30,820 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:30,827 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:30,863 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:20:30,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7, 7, 7] total 15 [2018-01-24 13:20:30,863 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:20:30,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 13:20:30,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 13:20:30,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-01-24 13:20:30,865 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 15 states. [2018-01-24 13:20:31,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:31,001 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2018-01-24 13:20:31,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 13:20:31,002 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-24 13:20:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:31,003 INFO L225 Difference]: With dead ends: 140 [2018-01-24 13:20:31,003 INFO L226 Difference]: Without dead ends: 97 [2018-01-24 13:20:31,004 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 125 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-01-24 13:20:31,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-24 13:20:31,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2018-01-24 13:20:31,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 13:20:31,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-24 13:20:31,015 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 34 [2018-01-24 13:20:31,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:31,016 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-24 13:20:31,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 13:20:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-24 13:20:31,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 13:20:31,017 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:31,017 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:31,017 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:31,018 INFO L82 PathProgramCache]: Analyzing trace with hash -2137316393, now seen corresponding path program 1 times [2018-01-24 13:20:31,018 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:31,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:31,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:31,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:31,019 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:31,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:31,069 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:20:31,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:31,070 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:20:31,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:31,075 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:31,101 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:31,227 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 13:20:31,228 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 13:20:31,332 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:20:31,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [5] total 10 [2018-01-24 13:20:31,332 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:31,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:20:31,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:20:31,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:20:31,334 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 6 states. [2018-01-24 13:20:31,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:31,412 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2018-01-24 13:20:31,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:20:31,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-24 13:20:31,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:31,414 INFO L225 Difference]: With dead ends: 135 [2018-01-24 13:20:31,414 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 13:20:31,414 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:20:31,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 13:20:31,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2018-01-24 13:20:31,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 13:20:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-01-24 13:20:31,424 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 43 [2018-01-24 13:20:31,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:31,425 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-01-24 13:20:31,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:20:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-01-24 13:20:31,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-24 13:20:31,426 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:31,426 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:31,426 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:31,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1584033375, now seen corresponding path program 1 times [2018-01-24 13:20:31,427 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:31,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:31,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:31,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:31,428 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:31,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 13:20:31,516 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:31,516 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:20:31,526 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:31,526 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:31,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 13:20:31,560 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:31,599 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 13:20:31,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:31,622 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:20:31,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:31,625 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:31,652 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:31,658 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 13:20:31,658 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:31,667 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 13:20:31,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:20:31,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-24 13:20:31,669 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:20:31,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:20:31,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:20:31,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:20:31,670 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 6 states. [2018-01-24 13:20:31,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:31,728 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-01-24 13:20:31,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:20:31,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-01-24 13:20:31,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:31,730 INFO L225 Difference]: With dead ends: 131 [2018-01-24 13:20:31,730 INFO L226 Difference]: Without dead ends: 110 [2018-01-24 13:20:31,730 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:20:31,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-24 13:20:31,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 88. [2018-01-24 13:20:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 13:20:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-01-24 13:20:31,741 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 49 [2018-01-24 13:20:31,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:31,741 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-01-24 13:20:31,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:20:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-01-24 13:20:31,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 13:20:31,743 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:31,743 INFO L322 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:31,743 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:31,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1798255855, now seen corresponding path program 2 times [2018-01-24 13:20:31,743 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:31,744 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:31,744 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:31,744 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:31,744 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:31,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 13:20:31,841 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:31,842 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:20:31,846 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:20:31,847 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:20:31,856 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:20:31,866 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:20:31,869 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:20:31,872 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 13:20:31,946 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 13:20:32,151 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:32,151 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:20:32,154 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:20:32,154 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:20:32,165 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:20:32,179 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:20:32,191 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:20:32,194 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:32,202 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 13:20:32,202 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 13:20:32,218 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:20:32,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 22 [2018-01-24 13:20:32,218 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:20:32,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 13:20:32,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 13:20:32,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-01-24 13:20:32,219 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 16 states. [2018-01-24 13:20:32,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:32,573 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2018-01-24 13:20:32,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 13:20:32,574 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-01-24 13:20:32,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:32,575 INFO L225 Difference]: With dead ends: 162 [2018-01-24 13:20:32,575 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 13:20:32,576 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=1147, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 13:20:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 13:20:32,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 107. [2018-01-24 13:20:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-24 13:20:32,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-01-24 13:20:32,586 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 52 [2018-01-24 13:20:32,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:32,587 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-01-24 13:20:32,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 13:20:32,587 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-01-24 13:20:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-24 13:20:32,588 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:32,588 INFO L322 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:32,588 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:32,589 INFO L82 PathProgramCache]: Analyzing trace with hash -88643296, now seen corresponding path program 1 times [2018-01-24 13:20:32,589 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:32,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:32,590 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 13:20:32,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:32,590 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:32,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 13:20:32,740 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:32,777 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:20:32,782 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:32,782 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:32,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:32,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:20:32,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:32,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:20:32,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:20:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 13:20:32,874 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 13:20:32,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:32,984 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:20:32,987 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:32,987 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:33,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:33,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:20:33,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:33,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:20:33,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:20:33,081 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 13:20:33,081 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 13:20:33,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:20:33,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6, 7, 6] total 18 [2018-01-24 13:20:33,113 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:20:33,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 13:20:33,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 13:20:33,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-01-24 13:20:33,114 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 14 states. [2018-01-24 13:20:33,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:33,334 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2018-01-24 13:20:33,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 13:20:33,335 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2018-01-24 13:20:33,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:33,336 INFO L225 Difference]: With dead ends: 141 [2018-01-24 13:20:33,337 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 13:20:33,337 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 194 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2018-01-24 13:20:33,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 13:20:33,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 102. [2018-01-24 13:20:33,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-24 13:20:33,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-01-24 13:20:33,348 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 53 [2018-01-24 13:20:33,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:33,348 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-01-24 13:20:33,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 13:20:33,348 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-01-24 13:20:33,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-24 13:20:33,350 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:33,350 INFO L322 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:33,350 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:33,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1320798415, now seen corresponding path program 2 times [2018-01-24 13:20:33,351 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:33,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:33,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:33,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:33,352 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:33,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-24 13:20:33,448 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:33,448 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:20:33,461 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:20:33,461 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:20:33,473 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:20:33,474 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:20:33,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:33,500 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:20:33,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-24 13:20:33,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:33,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:20:33,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 13:20:33,572 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:20:33,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-24 13:20:33,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:33,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:20:33,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 13:20:33,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:20:33,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-24 13:20:33,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:33,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:20:33,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 13:20:33,657 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:20:33,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-24 13:20:33,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:33,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:20:33,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 13:20:33,678 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~3.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_~#mask~3.base| 0)) (= 0 (select |c_old(#valid)| |main_~#mask~3.base|)))) is different from true [2018-01-24 13:20:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-01-24 13:20:33,692 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:33,708 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_~#mask~3.base_17| Int)) (or (= (store |c_#valid| |v_main_~#mask~3.base_17| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_~#mask~3.base_17|) 0)))) is different from false [2018-01-24 13:20:33,720 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-01-24 13:20:33,739 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:20:33,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [7] total 13 [2018-01-24 13:20:33,739 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:33,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:20:33,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:20:33,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=81, Unknown=2, NotChecked=38, Total=156 [2018-01-24 13:20:33,740 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 6 states. [2018-01-24 13:20:33,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:33,818 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2018-01-24 13:20:33,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:20:33,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-01-24 13:20:33,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:33,819 INFO L225 Difference]: With dead ends: 103 [2018-01-24 13:20:33,819 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 13:20:33,819 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 158 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=120, Unknown=2, NotChecked=46, Total=210 [2018-01-24 13:20:33,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 13:20:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 13:20:33,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 13:20:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 13:20:33,820 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2018-01-24 13:20:33,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:33,820 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 13:20:33,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:20:33,820 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 13:20:33,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 13:20:33,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 13:20:34,095 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 46 DAG size of output 32 [2018-01-24 13:20:34,204 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 37 DAG size of output 30 [2018-01-24 13:20:34,500 WARN L146 SmtUtils]: Spent 294ms on a formula simplification. DAG size of input: 89 DAG size of output 55 [2018-01-24 13:20:34,566 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-24 13:20:34,567 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 13:20:34,567 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-24 13:20:34,567 INFO L401 ceAbstractionStarter]: For program point fooFINAL(lines 12 19) no Hoare annotation was computed. [2018-01-24 13:20:34,567 INFO L401 ceAbstractionStarter]: For program point L15''''(lines 15 17) no Hoare annotation was computed. [2018-01-24 13:20:34,567 INFO L401 ceAbstractionStarter]: For program point fooEXIT(lines 12 19) no Hoare annotation was computed. [2018-01-24 13:20:34,567 INFO L404 ceAbstractionStarter]: At program point fooENTRY(lines 12 19) the Hoare annotation is: true [2018-01-24 13:20:34,567 INFO L401 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-24 13:20:34,567 INFO L397 ceAbstractionStarter]: At program point L15'''(lines 15 17) the Hoare annotation is: (let ((.cse8 (not (= 0 |foo_#in~b.offset|))) (.cse9 (not (= 32 (select |#length| |foo_#in~b.base|))))) (let ((.cse5 (or .cse8 .cse9)) (.cse7 (= foo_~i~1 0)) (.cse0 (not (= (select |#valid| |foo_#in~b.base|) 1)))) (and (let ((.cse2 (= (select |#length| foo_~b.base) 32)) (.cse1 (= 1 (select |#valid| foo_~b.base))) (.cse3 (<= foo_~size 31)) (.cse4 (= foo_~b.offset 0))) (or (< 31 |foo_#in~size|) .cse0 (and .cse1 .cse2 .cse3 .cse4 (<= 1 foo_~i~1)) (and (<= |foo_#in~size| foo_~size) .cse2 .cse1 (= 0 foo_~i~1) .cse3 .cse4) .cse5)) (or (<= foo_~size 2) .cse0 (< 2 |foo_#in~size|) .cse5) (let ((.cse6 (<= foo_~size 1))) (or .cse0 (and .cse6 .cse7) (< 1 |foo_#in~size|) (and .cse6 (= 1 foo_~i~1)) .cse5)) (or (and (= foo_~size 0) .cse7) .cse8 .cse0 (not (= 0 |foo_#in~size|)) .cse9)))) [2018-01-24 13:20:34,567 INFO L401 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-01-24 13:20:34,567 INFO L401 ceAbstractionStarter]: For program point L15(lines 15 17) no Hoare annotation was computed. [2018-01-24 13:20:34,567 INFO L401 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-24 13:20:34,567 INFO L401 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-01-24 13:20:34,567 INFO L401 ceAbstractionStarter]: For program point L15''(lines 15 17) no Hoare annotation was computed. [2018-01-24 13:20:34,568 INFO L401 ceAbstractionStarter]: For program point L16''(line 16) no Hoare annotation was computed. [2018-01-24 13:20:34,568 INFO L401 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 16) no Hoare annotation was computed. [2018-01-24 13:20:34,568 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 35) the Hoare annotation is: true [2018-01-24 13:20:34,568 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-24 13:20:34,568 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 35) the Hoare annotation is: true [2018-01-24 13:20:34,568 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-24 13:20:34,568 INFO L401 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 27) no Hoare annotation was computed. [2018-01-24 13:20:34,568 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 21 35) no Hoare annotation was computed. [2018-01-24 13:20:34,568 INFO L401 ceAbstractionStarter]: For program point mainErr1AssertViolation(line 30) no Hoare annotation was computed. [2018-01-24 13:20:34,568 INFO L401 ceAbstractionStarter]: For program point L25(lines 25 28) no Hoare annotation was computed. [2018-01-24 13:20:34,568 INFO L401 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-01-24 13:20:34,568 INFO L401 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-24 13:20:34,568 INFO L397 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 main_~i~3) (= 1 (select |#valid| main_~c~3.base)) .cse0 .cse1 (= (select |#length| main_~c~3.base) 32) (= main_~c~3.offset 0) .cse2 .cse3) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-24 13:20:34,568 INFO L401 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-01-24 13:20:34,569 INFO L401 ceAbstractionStarter]: For program point L24''''(line 24) no Hoare annotation was computed. [2018-01-24 13:20:34,569 INFO L397 ceAbstractionStarter]: At program point L27'(line 27) the Hoare annotation is: (let ((.cse2 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse0 (= 1 (select |#valid| main_~c~3.base))) (.cse1 (= 32 (select |#length| |main_~#mask~3.base|))) (.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 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 main_~i~3) .cse6) (and .cse2 (and .cse0 (and (<= 1 main_~i~3) .cse1)) .cse6 .cse3 .cse4 .cse5 (<= main_~i~3 31)))) [2018-01-24 13:20:34,569 INFO L401 ceAbstractionStarter]: For program point L24'''''(line 24) no Hoare annotation was computed. [2018-01-24 13:20:34,569 INFO L397 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|)) (.cse4 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse5 (= 0 |main_~#mask~3.offset|)) (.cse3 (select |#length| main_~c~3.base))) (or (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 (= .cse3 32) (= main_~c~3.offset 0) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse5 (= 0 main_~c~3.offset) (= 0 main_~i~3) (= 32 .cse3)))) [2018-01-24 13:20:34,569 INFO L401 ceAbstractionStarter]: For program point L25''''(lines 25 28) no Hoare annotation was computed. [2018-01-24 13:20:34,569 INFO L401 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-24 13:20:34,569 INFO L401 ceAbstractionStarter]: For program point L24''(line 24) no Hoare annotation was computed. [2018-01-24 13:20:34,569 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 21 35) no Hoare annotation was computed. [2018-01-24 13:20:34,569 INFO L401 ceAbstractionStarter]: For program point L25''(lines 25 28) no Hoare annotation was computed. [2018-01-24 13:20:34,569 INFO L401 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-01-24 13:20:34,569 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-01-24 13:20:34,569 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 13:20:34,569 INFO L401 ceAbstractionStarter]: For program point L24'''(line 24) no Hoare annotation was computed. [2018-01-24 13:20:34,570 INFO L401 ceAbstractionStarter]: For program point L29''''(lines 29 33) no Hoare annotation was computed. [2018-01-24 13:20:34,570 INFO L401 ceAbstractionStarter]: For program point L29''(lines 29 33) no Hoare annotation was computed. [2018-01-24 13:20:34,570 INFO L401 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-01-24 13:20:34,570 INFO L401 ceAbstractionStarter]: For program point L24'(line 24) no Hoare annotation was computed. [2018-01-24 13:20:34,570 INFO L401 ceAbstractionStarter]: For program point L30'(lines 30 32) no Hoare annotation was computed. [2018-01-24 13:20:34,577 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,578 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,578 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,578 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,593 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,594 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,594 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,595 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,595 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,596 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:20:34 BoogieIcfgContainer [2018-01-24 13:20:34,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:20:34,598 INFO L168 Benchmark]: Toolchain (without parser) took 7133.65 ms. Allocated memory was 307.2 MB in the beginning and 566.8 MB in the end (delta: 259.5 MB). Free memory was 268.3 MB in the beginning and 479.2 MB in the end (delta: -210.9 MB). Peak memory consumption was 180.3 MB. Max. memory is 5.3 GB. [2018-01-24 13:20:34,600 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 307.2 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:20:34,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.17 ms. Allocated memory is still 307.2 MB. Free memory was 267.3 MB in the beginning and 259.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:20:34,600 INFO L168 Benchmark]: Boogie Preprocessor took 30.58 ms. Allocated memory is still 307.2 MB. Free memory was 259.2 MB in the beginning and 257.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:20:34,601 INFO L168 Benchmark]: RCFGBuilder took 210.67 ms. Allocated memory is still 307.2 MB. Free memory was 257.3 MB in the beginning and 241.7 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. [2018-01-24 13:20:34,601 INFO L168 Benchmark]: TraceAbstraction took 6693.57 ms. Allocated memory was 307.2 MB in the beginning and 566.8 MB in the end (delta: 259.5 MB). Free memory was 241.7 MB in the beginning and 479.2 MB in the end (delta: -237.5 MB). Peak memory consumption was 153.7 MB. Max. memory is 5.3 GB. [2018-01-24 13:20:34,603 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.12 ms. Allocated memory is still 307.2 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 191.17 ms. Allocated memory is still 307.2 MB. Free memory was 267.3 MB in the beginning and 259.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.58 ms. Allocated memory is still 307.2 MB. Free memory was 259.2 MB in the beginning and 257.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 210.67 ms. Allocated memory is still 307.2 MB. Free memory was 257.3 MB in the beginning and 241.7 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6693.57 ms. Allocated memory was 307.2 MB in the beginning and 566.8 MB in the end (delta: 259.5 MB). Free memory was 241.7 MB in the beginning and 479.2 MB in the end (delta: -237.5 MB). Peak memory consumption was 153.7 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 30]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant [2018-01-24 13:20:34,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 <= i && 1 == \valid[c]) && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && unknown-#length-unknown[c] == 32) && c == 0) && 0 == \old(\valid)[mask]) && 0 == mask) || (((((((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]) - InvariantResult [Line: 15]: Loop Invariant [2018-01-24 13:20:34,612 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,612 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,613 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,613 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,613 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,613 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,615 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((31 < \old(size) || !(\valid[b] == 1)) || ((((1 == \valid[b] && unknown-#length-unknown[b] == 32) && size <= 31) && b == 0) && 1 <= i)) || (((((\old(size) <= size && unknown-#length-unknown[b] == 32) && 1 == \valid[b]) && 0 == i) && size <= 31) && b == 0)) || !(0 == b) || !(32 == unknown-#length-unknown[b])) && (((size <= 2 || !(\valid[b] == 1)) || 2 < \old(size)) || !(0 == b) || !(32 == unknown-#length-unknown[b]))) && ((((!(\valid[b] == 1) || (size <= 1 && i == 0)) || 1 < \old(size)) || (size <= 1 && 1 == i)) || !(0 == b) || !(32 == unknown-#length-unknown[b]))) && (((((size == 0 && i == 0) || !(0 == b)) || !(\valid[b] == 1)) || !(0 == \old(size))) || !(32 == unknown-#length-unknown[b])) - InvariantResult [Line: 25]: Loop Invariant [2018-01-24 13:20:34,618 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,618 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,618 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,619 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,619 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:34,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 <= i && 1 == \valid[c]) && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && unknown-#length-unknown[c] == 32) && c == 0) && 0 == \old(\valid)[mask]) && 0 == mask) || ((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. SAFE Result, 6.6s OverallTime, 12 OverallIterations, 7 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 426 SDtfs, 893 SDslu, 1201 SDs, 0 SdLazy, 1093 SolverSat, 151 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1445 GetRequests, 1252 SyntacticMatches, 43 SemanticMatches, 150 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 196 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 23 PreInvPairs, 41 NumberOfFragments, 375 HoareAnnotationTreeSize, 23 FomulaSimplifications, 842 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1277 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1123 NumberOfCodeBlocks, 1057 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1750 ConstructedInterpolants, 106 QuantifiedInterpolants, 335458 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1825 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 44 InterpolantComputations, 10 PerfectInterpolantSequences, 880/1144 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-20-34-624.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-20-34-624.csv Received shutdown request...