java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:39:00,161 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:39:00,163 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:39:00,179 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:39:00,180 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:39:00,181 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:39:00,182 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:39:00,185 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:39:00,187 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:39:00,188 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:39:00,189 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:39:00,189 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:39:00,190 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:39:00,191 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:39:00,192 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:39:00,195 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:39:00,197 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:39:00,199 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:39:00,200 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:39:00,201 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:39:00,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:39:00,204 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:39:00,204 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:39:00,205 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:39:00,206 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:39:00,207 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:39:00,207 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:39:00,208 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:39:00,208 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:39:00,208 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:39:00,209 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:39:00,209 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:39:00,220 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:39:00,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:39:00,221 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:39:00,221 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:39:00,221 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:39:00,222 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:39:00,222 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:39:00,222 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:39:00,223 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:39:00,223 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:39:00,223 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:39:00,223 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:39:00,223 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:39:00,223 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:39:00,224 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:39:00,224 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:39:00,224 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:39:00,224 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:39:00,224 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:39:00,225 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:39:00,225 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:39:00,225 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:39:00,225 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:39:00,225 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:39:00,225 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:39:00,226 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:39:00,226 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:39:00,226 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:39:00,226 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:39:00,226 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:39:00,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:39:00,227 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:39:00,228 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:39:00,228 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:39:00,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:39:00,274 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:39:00,278 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:39:00,279 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:39:00,279 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:39:00,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-01-31 08:39:00,376 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:39:00,383 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:39:00,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:39:00,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:39:00,394 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:39:00,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:39:00" (1/1) ... [2018-01-31 08:39:00,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76fcf4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:00, skipping insertion in model container [2018-01-31 08:39:00,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:39:00" (1/1) ... [2018-01-31 08:39:00,419 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:39:00,438 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:39:00,613 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:39:00,638 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:39:00,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:00 WrapperNode [2018-01-31 08:39:00,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:39:00,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:39:00,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:39:00,649 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:39:00,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:00" (1/1) ... [2018-01-31 08:39:00,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:00" (1/1) ... [2018-01-31 08:39:00,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:00" (1/1) ... [2018-01-31 08:39:00,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:00" (1/1) ... [2018-01-31 08:39:00,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:00" (1/1) ... [2018-01-31 08:39:00,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:00" (1/1) ... [2018-01-31 08:39:00,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:00" (1/1) ... [2018-01-31 08:39:00,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:39:00,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:39:00,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:39:00,701 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:39:00,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:00" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:39:00,771 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:39:00,771 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:39:00,771 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-31 08:39:00,771 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:39:00,771 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:39:00,771 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:39:00,772 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:39:00,772 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:39:00,772 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:39:00,772 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-31 08:39:00,772 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:39:00,772 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:39:00,773 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:39:01,237 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:39:01,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:39:01 BoogieIcfgContainer [2018-01-31 08:39:01,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:39:01,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:39:01,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:39:01,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:39:01,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:39:00" (1/3) ... [2018-01-31 08:39:01,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24283cfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:39:01, skipping insertion in model container [2018-01-31 08:39:01,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:00" (2/3) ... [2018-01-31 08:39:01,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24283cfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:39:01, skipping insertion in model container [2018-01-31 08:39:01,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:39:01" (3/3) ... [2018-01-31 08:39:01,246 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-01-31 08:39:01,254 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:39:01,262 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-01-31 08:39:01,305 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:39:01,306 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:39:01,306 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:39:01,306 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:39:01,306 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:39:01,306 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:39:01,306 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:39:01,306 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:39:01,307 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:39:01,332 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-31 08:39:01,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-31 08:39:01,341 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:01,342 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:01,342 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:01,350 INFO L82 PathProgramCache]: Analyzing trace with hash 514068382, now seen corresponding path program 1 times [2018-01-31 08:39:01,352 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:01,352 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:01,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:01,411 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:01,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:01,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:01,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:39:01,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:39:01,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-31 08:39:01,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-31 08:39:01,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-31 08:39:01,538 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-01-31 08:39:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:01,573 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2018-01-31 08:39:01,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-31 08:39:01,575 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-31 08:39:01,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:01,587 INFO L225 Difference]: With dead ends: 119 [2018-01-31 08:39:01,587 INFO L226 Difference]: Without dead ends: 61 [2018-01-31 08:39:01,596 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-31 08:39:01,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-31 08:39:01,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-31 08:39:01,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-31 08:39:01,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-01-31 08:39:01,642 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 14 [2018-01-31 08:39:01,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:01,643 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-01-31 08:39:01,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-31 08:39:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-01-31 08:39:01,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 08:39:01,645 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:01,646 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:01,646 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:01,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1745345203, now seen corresponding path program 1 times [2018-01-31 08:39:01,646 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:01,646 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:01,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:01,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:01,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:01,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:01,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:01,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:39:01,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:39:01,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:39:01,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:39:01,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:39:01,858 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 3 states. [2018-01-31 08:39:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:02,123 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-01-31 08:39:02,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:39:02,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-31 08:39:02,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:02,126 INFO L225 Difference]: With dead ends: 106 [2018-01-31 08:39:02,126 INFO L226 Difference]: Without dead ends: 86 [2018-01-31 08:39:02,129 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:39:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-31 08:39:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 65. [2018-01-31 08:39:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-31 08:39:02,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-01-31 08:39:02,147 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 15 [2018-01-31 08:39:02,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:02,147 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-01-31 08:39:02,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:39:02,147 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-01-31 08:39:02,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 08:39:02,148 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:02,150 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:02,150 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:02,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1619552690, now seen corresponding path program 1 times [2018-01-31 08:39:02,151 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:02,151 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:02,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:02,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:02,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:02,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:02,441 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:39:02,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:39:02,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:39:02,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:39:02,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:39:02,442 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 6 states. [2018-01-31 08:39:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:02,657 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2018-01-31 08:39:02,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:39:02,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-31 08:39:02,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:02,659 INFO L225 Difference]: With dead ends: 151 [2018-01-31 08:39:02,660 INFO L226 Difference]: Without dead ends: 97 [2018-01-31 08:39:02,661 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:39:02,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-31 08:39:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 77. [2018-01-31 08:39:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-31 08:39:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-01-31 08:39:02,670 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 21 [2018-01-31 08:39:02,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:02,671 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-01-31 08:39:02,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:39:02,671 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-01-31 08:39:02,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:39:02,672 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:02,672 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:02,672 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:02,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1332993157, now seen corresponding path program 1 times [2018-01-31 08:39:02,673 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:02,673 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:02,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:02,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:02,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:02,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:02,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:02,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:39:02,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:39:02,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:39:02,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:39:02,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:39:02,765 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 3 states. [2018-01-31 08:39:02,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:02,836 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-01-31 08:39:02,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:39:02,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-31 08:39:02,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:02,840 INFO L225 Difference]: With dead ends: 77 [2018-01-31 08:39:02,840 INFO L226 Difference]: Without dead ends: 75 [2018-01-31 08:39:02,841 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:39:02,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-31 08:39:02,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-31 08:39:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-31 08:39:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-01-31 08:39:02,849 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 25 [2018-01-31 08:39:02,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:02,849 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-01-31 08:39:02,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:39:02,849 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-01-31 08:39:02,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:39:02,850 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:02,850 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:02,850 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:02,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1332993158, now seen corresponding path program 1 times [2018-01-31 08:39:02,851 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:02,851 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:02,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:02,852 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:02,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:02,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:03,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:39:03,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:39:03,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:39:03,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:39:03,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:39:03,010 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 4 states. [2018-01-31 08:39:03,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:03,271 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-01-31 08:39:03,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:39:03,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-31 08:39:03,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:03,273 INFO L225 Difference]: With dead ends: 91 [2018-01-31 08:39:03,273 INFO L226 Difference]: Without dead ends: 89 [2018-01-31 08:39:03,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:39:03,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-31 08:39:03,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2018-01-31 08:39:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-31 08:39:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-01-31 08:39:03,290 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 25 [2018-01-31 08:39:03,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:03,291 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-01-31 08:39:03,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:39:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-01-31 08:39:03,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-31 08:39:03,296 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:03,296 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-01-31 08:39:03,296 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:03,296 INFO L82 PathProgramCache]: Analyzing trace with hash 852385009, now seen corresponding path program 1 times [2018-01-31 08:39:03,297 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:03,297 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:03,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:03,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:03,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:03,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:39:03,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:39:03,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:39:03,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:39:03,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:39:03,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:39:03,536 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 7 states. [2018-01-31 08:39:03,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:03,865 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-01-31 08:39:03,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:39:03,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-31 08:39:03,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:03,866 INFO L225 Difference]: With dead ends: 92 [2018-01-31 08:39:03,867 INFO L226 Difference]: Without dead ends: 91 [2018-01-31 08:39:03,867 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:39:03,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-31 08:39:03,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2018-01-31 08:39:03,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-31 08:39:03,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-01-31 08:39:03,877 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 41 [2018-01-31 08:39:03,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:03,877 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-01-31 08:39:03,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:39:03,878 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-01-31 08:39:03,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-31 08:39:03,879 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:03,879 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:03,879 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:03,880 INFO L82 PathProgramCache]: Analyzing trace with hash 654131555, now seen corresponding path program 1 times [2018-01-31 08:39:03,880 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:03,880 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:03,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:03,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:03,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:03,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:03,964 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:39:03,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:39:03,965 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:39:03,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:39:03,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:39:03,965 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 5 states. [2018-01-31 08:39:04,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:04,063 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-01-31 08:39:04,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:39:04,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-31 08:39:04,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:04,064 INFO L225 Difference]: With dead ends: 81 [2018-01-31 08:39:04,064 INFO L226 Difference]: Without dead ends: 80 [2018-01-31 08:39:04,065 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:39:04,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-31 08:39:04,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-31 08:39:04,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-31 08:39:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-01-31 08:39:04,074 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 42 [2018-01-31 08:39:04,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:04,075 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-01-31 08:39:04,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:39:04,075 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-01-31 08:39:04,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-31 08:39:04,077 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:04,077 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:04,077 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:04,077 INFO L82 PathProgramCache]: Analyzing trace with hash 654131556, now seen corresponding path program 1 times [2018-01-31 08:39:04,077 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:04,077 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:04,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:04,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:04,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:04,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:04,237 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:39:04,237 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:39:04,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:39:04,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:39:04,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:39:04,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:39:04,238 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 6 states. [2018-01-31 08:39:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:04,543 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-01-31 08:39:04,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:39:04,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-01-31 08:39:04,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:04,544 INFO L225 Difference]: With dead ends: 89 [2018-01-31 08:39:04,544 INFO L226 Difference]: Without dead ends: 88 [2018-01-31 08:39:04,545 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:39:04,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-31 08:39:04,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-01-31 08:39:04,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-31 08:39:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-01-31 08:39:04,553 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 42 [2018-01-31 08:39:04,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:04,553 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-01-31 08:39:04,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:39:04,554 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-01-31 08:39:04,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-31 08:39:04,555 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:04,555 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:04,555 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:04,555 INFO L82 PathProgramCache]: Analyzing trace with hash -737235937, now seen corresponding path program 1 times [2018-01-31 08:39:04,556 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:04,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:04,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:04,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:04,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:04,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:04,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:04,750 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:04,751 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:04,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:04,796 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:04,849 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:04,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-01-31 08:39:04,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:39:04,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:39:04,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:39:04,850 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 7 states. [2018-01-31 08:39:04,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:04,997 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-01-31 08:39:04,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:39:04,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-31 08:39:04,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:04,999 INFO L225 Difference]: With dead ends: 126 [2018-01-31 08:39:04,999 INFO L226 Difference]: Without dead ends: 104 [2018-01-31 08:39:05,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:39:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-31 08:39:05,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2018-01-31 08:39:05,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-31 08:39:05,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-01-31 08:39:05,008 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 41 [2018-01-31 08:39:05,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:05,008 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-01-31 08:39:05,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:39:05,009 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-01-31 08:39:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-31 08:39:05,010 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:05,010 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:05,010 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:05,010 INFO L82 PathProgramCache]: Analyzing trace with hash 921737641, now seen corresponding path program 1 times [2018-01-31 08:39:05,011 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:05,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:05,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:05,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:05,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:05,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:39:05,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:05,161 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:05,167 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:05,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:39:05,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:39:05,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 12 [2018-01-31 08:39:05,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:39:05,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:39:05,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:39:05,421 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 12 states. [2018-01-31 08:39:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:05,760 INFO L93 Difference]: Finished difference Result 162 states and 169 transitions. [2018-01-31 08:39:05,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:39:05,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-01-31 08:39:05,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:05,762 INFO L225 Difference]: With dead ends: 162 [2018-01-31 08:39:05,762 INFO L226 Difference]: Without dead ends: 103 [2018-01-31 08:39:05,762 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:39:05,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-31 08:39:05,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-01-31 08:39:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-31 08:39:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2018-01-31 08:39:05,774 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 45 [2018-01-31 08:39:05,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:05,775 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2018-01-31 08:39:05,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:39:05,775 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-01-31 08:39:05,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-31 08:39:05,776 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:05,776 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-01-31 08:39:05,777 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:05,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1964423637, now seen corresponding path program 1 times [2018-01-31 08:39:05,777 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:05,777 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:05,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:05,778 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:05,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:05,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:06,032 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:06,033 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:06,033 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:06,039 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:06,083 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:06,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:06,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-01-31 08:39:06,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:39:06,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:39:06,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:39:06,330 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 15 states. [2018-01-31 08:39:06,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:06,557 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-01-31 08:39:06,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:39:06,557 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-01-31 08:39:06,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:06,558 INFO L225 Difference]: With dead ends: 180 [2018-01-31 08:39:06,558 INFO L226 Difference]: Without dead ends: 124 [2018-01-31 08:39:06,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2018-01-31 08:39:06,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-31 08:39:06,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 108. [2018-01-31 08:39:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-31 08:39:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2018-01-31 08:39:06,567 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 50 [2018-01-31 08:39:06,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:06,567 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2018-01-31 08:39:06,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:39:06,567 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2018-01-31 08:39:06,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-31 08:39:06,569 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:06,569 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:06,569 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:06,569 INFO L82 PathProgramCache]: Analyzing trace with hash 842523789, now seen corresponding path program 1 times [2018-01-31 08:39:06,569 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:06,569 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:06,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:06,570 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:06,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:06,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-31 08:39:06,868 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:06,868 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:06,873 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:06,912 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:06,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:39:06,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:07,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:39:07,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:39:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-31 08:39:07,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:07,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-01-31 08:39:07,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:39:07,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:39:07,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:39:07,437 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand 9 states. [2018-01-31 08:39:07,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:07,750 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2018-01-31 08:39:07,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:39:07,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-01-31 08:39:07,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:07,751 INFO L225 Difference]: With dead ends: 122 [2018-01-31 08:39:07,751 INFO L226 Difference]: Without dead ends: 121 [2018-01-31 08:39:07,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:39:07,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-31 08:39:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 110. [2018-01-31 08:39:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-31 08:39:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2018-01-31 08:39:07,761 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 54 [2018-01-31 08:39:07,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:07,761 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2018-01-31 08:39:07,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:39:07,761 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-01-31 08:39:07,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-31 08:39:07,763 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:07,763 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:07,763 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:07,763 INFO L82 PathProgramCache]: Analyzing trace with hash 845661734, now seen corresponding path program 1 times [2018-01-31 08:39:07,763 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:07,763 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:07,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:07,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:07,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:07,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-31 08:39:07,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:07,873 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:07,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:07,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-31 08:39:08,059 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:08,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-31 08:39:08,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:39:08,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:39:08,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:39:08,060 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 9 states. [2018-01-31 08:39:08,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:08,196 INFO L93 Difference]: Finished difference Result 155 states and 161 transitions. [2018-01-31 08:39:08,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:39:08,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-01-31 08:39:08,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:08,197 INFO L225 Difference]: With dead ends: 155 [2018-01-31 08:39:08,197 INFO L226 Difference]: Without dead ends: 133 [2018-01-31 08:39:08,198 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:39:08,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-31 08:39:08,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 116. [2018-01-31 08:39:08,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-31 08:39:08,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-01-31 08:39:08,207 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 70 [2018-01-31 08:39:08,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:08,207 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2018-01-31 08:39:08,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:39:08,207 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-01-31 08:39:08,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-31 08:39:08,209 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:08,209 INFO L351 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:08,209 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:08,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1314715566, now seen corresponding path program 2 times [2018-01-31 08:39:08,209 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:08,209 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:08,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:08,210 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:08,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:08,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-31 08:39:08,369 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:08,369 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:08,377 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:39:08,393 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:08,416 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:08,429 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:08,433 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-31 08:39:08,580 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:08,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-01-31 08:39:08,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 08:39:08,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 08:39:08,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:39:08,581 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 18 states. [2018-01-31 08:39:09,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:09,427 INFO L93 Difference]: Finished difference Result 138 states and 141 transitions. [2018-01-31 08:39:09,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 08:39:09,428 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 79 [2018-01-31 08:39:09,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:09,429 INFO L225 Difference]: With dead ends: 138 [2018-01-31 08:39:09,429 INFO L226 Difference]: Without dead ends: 137 [2018-01-31 08:39:09,430 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2018-01-31 08:39:09,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-31 08:39:09,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2018-01-31 08:39:09,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-31 08:39:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2018-01-31 08:39:09,439 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 79 [2018-01-31 08:39:09,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:09,439 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2018-01-31 08:39:09,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 08:39:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2018-01-31 08:39:09,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-31 08:39:09,441 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:09,441 INFO L351 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:09,441 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:09,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2101476935, now seen corresponding path program 1 times [2018-01-31 08:39:09,441 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:09,442 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:09,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:09,442 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:09,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:09,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:09,936 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 13 DAG size of output 9 [2018-01-31 08:39:10,300 WARN L146 SmtUtils]: Spent 229ms on a formula simplification. DAG size of input: 15 DAG size of output 11 [2018-01-31 08:39:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-31 08:39:10,334 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:10,334 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-31 08:39:10,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:10,377 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:10,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:39:10,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:10,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:39:10,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:39:10,634 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-31 08:39:10,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:10,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-01-31 08:39:10,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:39:10,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:39:10,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:39:10,658 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand 9 states. [2018-01-31 08:39:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:10,883 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2018-01-31 08:39:10,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:39:10,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-01-31 08:39:10,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:10,884 INFO L225 Difference]: With dead ends: 132 [2018-01-31 08:39:10,884 INFO L226 Difference]: Without dead ends: 131 [2018-01-31 08:39:10,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:39:10,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-31 08:39:10,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 124. [2018-01-31 08:39:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-31 08:39:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2018-01-31 08:39:10,897 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 80 [2018-01-31 08:39:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:10,897 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2018-01-31 08:39:10,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:39:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2018-01-31 08:39:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-31 08:39:10,898 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:10,899 INFO L351 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:10,899 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:10,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1611238886, now seen corresponding path program 2 times [2018-01-31 08:39:10,899 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:10,899 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:10,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:10,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:10,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:10,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:11,132 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 39 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-31 08:39:11,133 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:11,133 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:11,138 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:39:11,149 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:11,158 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:11,160 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:11,164 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:11,265 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-31 08:39:11,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:11,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-01-31 08:39:11,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:39:11,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:39:11,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:39:11,286 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand 17 states. [2018-01-31 08:39:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:11,796 INFO L93 Difference]: Finished difference Result 207 states and 214 transitions. [2018-01-31 08:39:11,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:39:11,797 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 83 [2018-01-31 08:39:11,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:11,797 INFO L225 Difference]: With dead ends: 207 [2018-01-31 08:39:11,798 INFO L226 Difference]: Without dead ends: 140 [2018-01-31 08:39:11,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:39:11,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-31 08:39:11,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 124. [2018-01-31 08:39:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-31 08:39:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 127 transitions. [2018-01-31 08:39:11,807 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 127 transitions. Word has length 83 [2018-01-31 08:39:11,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:11,808 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 127 transitions. [2018-01-31 08:39:11,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:39:11,808 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2018-01-31 08:39:11,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-31 08:39:11,809 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:11,809 INFO L351 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:11,809 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:11,809 INFO L82 PathProgramCache]: Analyzing trace with hash 808358781, now seen corresponding path program 2 times [2018-01-31 08:39:11,810 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:11,810 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:11,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:11,812 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:11,813 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:11,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 53 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-31 08:39:12,125 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:12,125 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-31 08:39:12,140 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:12,153 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:12,174 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:12,185 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:12,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 63 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-31 08:39:12,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:12,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-01-31 08:39:12,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:39:12,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:39:12,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-01-31 08:39:12,363 INFO L87 Difference]: Start difference. First operand 124 states and 127 transitions. Second operand 21 states. [2018-01-31 08:39:12,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:12,708 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2018-01-31 08:39:12,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 08:39:12,708 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 89 [2018-01-31 08:39:12,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:12,709 INFO L225 Difference]: With dead ends: 234 [2018-01-31 08:39:12,709 INFO L226 Difference]: Without dead ends: 170 [2018-01-31 08:39:12,710 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=992, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 08:39:12,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-31 08:39:12,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 154. [2018-01-31 08:39:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-31 08:39:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 157 transitions. [2018-01-31 08:39:12,720 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 157 transitions. Word has length 89 [2018-01-31 08:39:12,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:12,721 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 157 transitions. [2018-01-31 08:39:12,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:39:12,721 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 157 transitions. [2018-01-31 08:39:12,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-01-31 08:39:12,722 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:12,722 INFO L351 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:12,722 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:12,722 INFO L82 PathProgramCache]: Analyzing trace with hash -110009104, now seen corresponding path program 3 times [2018-01-31 08:39:12,722 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:12,723 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:12,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:12,723 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:12,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:12,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:13,431 WARN L143 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 13 [2018-01-31 08:39:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-01-31 08:39:13,672 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:13,672 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:13,679 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:39:13,691 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:13,696 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:13,697 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:13,700 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:13,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:39:13,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:13,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:39:13,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:39:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 11 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-01-31 08:39:14,272 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:14,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-01-31 08:39:14,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 08:39:14,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 08:39:14,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:39:14,274 INFO L87 Difference]: Start difference. First operand 154 states and 157 transitions. Second operand 18 states. [2018-01-31 08:39:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:14,979 INFO L93 Difference]: Finished difference Result 167 states and 172 transitions. [2018-01-31 08:39:14,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 08:39:14,979 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 92 [2018-01-31 08:39:14,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:14,980 INFO L225 Difference]: With dead ends: 167 [2018-01-31 08:39:14,980 INFO L226 Difference]: Without dead ends: 166 [2018-01-31 08:39:14,981 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:39:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-31 08:39:14,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 153. [2018-01-31 08:39:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-31 08:39:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 156 transitions. [2018-01-31 08:39:14,993 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 156 transitions. Word has length 92 [2018-01-31 08:39:14,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:14,994 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 156 transitions. [2018-01-31 08:39:14,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 08:39:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 156 transitions. [2018-01-31 08:39:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-31 08:39:14,995 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:14,995 INFO L351 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:14,995 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:14,996 INFO L82 PathProgramCache]: Analyzing trace with hash -2007883639, now seen corresponding path program 2 times [2018-01-31 08:39:14,996 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:14,996 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:14,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:14,997 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:14,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:15,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-31 08:39:15,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:15,248 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:15,253 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:39:15,263 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:15,264 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:15,267 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:15,286 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:39:15,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-31 08:39:15,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:15,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:39:15,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-31 08:39:15,455 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:39:15,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-31 08:39:15,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:15,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:39:15,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-31 08:39:15,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:39:15,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-31 08:39:15,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:15,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:39:15,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-31 08:39:15,562 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#b~3.base| Int)) (and (= (store |c_old(#valid)| |main_~#b~3.base| 0) |c_#valid|) (= 0 (select |c_old(#valid)| |main_~#b~3.base|)))) is different from true [2018-01-31 08:39:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-01-31 08:39:15,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:39:15,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2018-01-31 08:39:15,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:39:15,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:39:15,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2018-01-31 08:39:15,598 INFO L87 Difference]: Start difference. First operand 153 states and 156 transitions. Second operand 13 states. [2018-01-31 08:39:16,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:16,261 INFO L93 Difference]: Finished difference Result 198 states and 206 transitions. [2018-01-31 08:39:16,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:39:16,261 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2018-01-31 08:39:16,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:16,262 INFO L225 Difference]: With dead ends: 198 [2018-01-31 08:39:16,262 INFO L226 Difference]: Without dead ends: 162 [2018-01-31 08:39:16,262 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 101 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=442, Unknown=1, NotChecked=46, Total=650 [2018-01-31 08:39:16,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-31 08:39:16,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 152. [2018-01-31 08:39:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-31 08:39:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2018-01-31 08:39:16,284 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 108 [2018-01-31 08:39:16,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:16,284 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2018-01-31 08:39:16,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:39:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2018-01-31 08:39:16,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-01-31 08:39:16,286 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:16,286 INFO L351 BasicCegarLoop]: trace histogram [9, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:16,286 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:16,286 INFO L82 PathProgramCache]: Analyzing trace with hash 653779002, now seen corresponding path program 3 times [2018-01-31 08:39:16,286 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:16,286 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:16,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:16,287 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:16,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:16,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 108 proven. 14 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-01-31 08:39:16,693 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:16,694 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:16,699 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:39:16,711 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:16,716 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:16,718 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:16,721 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:16,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:39:16,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:16,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:39:16,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:39:16,974 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 114 proven. 4 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-01-31 08:39:16,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:16,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-01-31 08:39:16,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-31 08:39:16,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-31 08:39:16,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2018-01-31 08:39:16,995 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand 23 states. [2018-01-31 08:39:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:17,466 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2018-01-31 08:39:17,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:39:17,466 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 127 [2018-01-31 08:39:17,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:17,467 INFO L225 Difference]: With dead ends: 156 [2018-01-31 08:39:17,467 INFO L226 Difference]: Without dead ends: 155 [2018-01-31 08:39:17,468 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 112 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 08:39:17,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-31 08:39:17,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2018-01-31 08:39:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-31 08:39:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 151 transitions. [2018-01-31 08:39:17,481 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 151 transitions. Word has length 127 [2018-01-31 08:39:17,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:17,482 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 151 transitions. [2018-01-31 08:39:17,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-31 08:39:17,482 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 151 transitions. [2018-01-31 08:39:17,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-01-31 08:39:17,483 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:17,483 INFO L351 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:17,483 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:17,483 INFO L82 PathProgramCache]: Analyzing trace with hash -930774613, now seen corresponding path program 1 times [2018-01-31 08:39:17,483 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:17,483 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:17,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:17,484 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:17,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:17,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-01-31 08:39:17,633 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:17,633 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:17,638 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:17,670 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 158 proven. 13 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-01-31 08:39:17,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:17,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 25 [2018-01-31 08:39:17,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-31 08:39:17,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-31 08:39:17,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2018-01-31 08:39:17,851 INFO L87 Difference]: Start difference. First operand 149 states and 151 transitions. Second operand 25 states. [2018-01-31 08:39:18,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:18,368 INFO L93 Difference]: Finished difference Result 237 states and 247 transitions. [2018-01-31 08:39:18,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-31 08:39:18,369 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 148 [2018-01-31 08:39:18,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:18,370 INFO L225 Difference]: With dead ends: 237 [2018-01-31 08:39:18,370 INFO L226 Difference]: Without dead ends: 183 [2018-01-31 08:39:18,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=373, Invalid=2177, Unknown=0, NotChecked=0, Total=2550 [2018-01-31 08:39:18,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-31 08:39:18,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 167. [2018-01-31 08:39:18,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-01-31 08:39:18,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 170 transitions. [2018-01-31 08:39:18,385 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 170 transitions. Word has length 148 [2018-01-31 08:39:18,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:18,386 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 170 transitions. [2018-01-31 08:39:18,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-31 08:39:18,386 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 170 transitions. [2018-01-31 08:39:18,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-01-31 08:39:18,388 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:18,389 INFO L351 BasicCegarLoop]: trace histogram [14, 9, 9, 9, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:18,389 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:18,389 INFO L82 PathProgramCache]: Analyzing trace with hash -186583576, now seen corresponding path program 2 times [2018-01-31 08:39:18,389 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:18,389 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:18,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:18,390 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:18,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:18,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2018-01-31 08:39:18,716 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:18,716 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:39:18,721 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:39:18,734 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:18,758 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:18,762 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:18,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 330 proven. 33 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-01-31 08:39:19,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:19,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20] total 31 [2018-01-31 08:39:19,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-31 08:39:19,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-31 08:39:19,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:39:19,065 INFO L87 Difference]: Start difference. First operand 167 states and 170 transitions. Second operand 31 states. [2018-01-31 08:39:19,967 WARN L143 SmtUtils]: Spent 126ms on a formula simplification that was a NOOP. DAG size: 11 [2018-01-31 08:39:20,890 WARN L143 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 9 [2018-01-31 08:39:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:21,947 INFO L93 Difference]: Finished difference Result 317 states and 330 transitions. [2018-01-31 08:39:21,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-31 08:39:21,947 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 204 [2018-01-31 08:39:21,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:21,949 INFO L225 Difference]: With dead ends: 317 [2018-01-31 08:39:21,949 INFO L226 Difference]: Without dead ends: 257 [2018-01-31 08:39:21,950 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=563, Invalid=3597, Unknown=0, NotChecked=0, Total=4160 [2018-01-31 08:39:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-01-31 08:39:21,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 223. [2018-01-31 08:39:21,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-01-31 08:39:21,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 228 transitions. [2018-01-31 08:39:21,972 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 228 transitions. Word has length 204 [2018-01-31 08:39:21,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:21,973 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 228 transitions. [2018-01-31 08:39:21,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-31 08:39:21,973 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 228 transitions. [2018-01-31 08:39:21,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-01-31 08:39:21,975 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:21,975 INFO L351 BasicCegarLoop]: trace histogram [20, 14, 14, 14, 14, 14, 14, 14, 14, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:21,975 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:39:21,975 INFO L82 PathProgramCache]: Analyzing trace with hash -129615679, now seen corresponding path program 3 times [2018-01-31 08:39:21,975 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:21,975 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:21,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:21,976 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:21,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:22,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-01-31 08:39:22,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:22,440 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:22,446 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:39:22,462 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:22,467 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:22,468 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:22,472 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:22,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:39:22,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:22,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:39:22,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:39:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1299 trivial. 0 not checked. [2018-01-31 08:39:22,837 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:39:22,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2018-01-31 08:39:22,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:39:22,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:39:22,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-01-31 08:39:22,838 INFO L87 Difference]: Start difference. First operand 223 states and 228 transitions. Second operand 21 states. [2018-01-31 08:39:24,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:24,077 INFO L93 Difference]: Finished difference Result 254 states and 263 transitions. [2018-01-31 08:39:24,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-31 08:39:24,078 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 269 [2018-01-31 08:39:24,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:24,078 INFO L225 Difference]: With dead ends: 254 [2018-01-31 08:39:24,078 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 08:39:24,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 253 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=561, Invalid=1695, Unknown=0, NotChecked=0, Total=2256 [2018-01-31 08:39:24,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 08:39:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 08:39:24,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 08:39:24,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 08:39:24,081 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 269 [2018-01-31 08:39:24,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:24,081 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 08:39:24,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:39:24,081 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 08:39:24,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 08:39:24,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 08:39:24,103 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:39:24,110 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:39:24,129 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:39:24,159 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:39:25,778 WARN L146 SmtUtils]: Spent 1229ms on a formula simplification. DAG size of input: 46 DAG size of output 23 [2018-01-31 08:39:29,020 WARN L146 SmtUtils]: Spent 3226ms on a formula simplification. DAG size of input: 133 DAG size of output 69 [2018-01-31 08:39:29,135 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 31) no Hoare annotation was computed. [2018-01-31 08:39:29,135 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 31) no Hoare annotation was computed. [2018-01-31 08:39:29,135 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 31) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:39:29,136 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 31) no Hoare annotation was computed. [2018-01-31 08:39:29,136 INFO L399 ceAbstractionStarter]: For program point L14'''(lines 14 16) no Hoare annotation was computed. [2018-01-31 08:39:29,136 INFO L399 ceAbstractionStarter]: For program point L14'''''''(lines 14 16) no Hoare annotation was computed. [2018-01-31 08:39:29,136 INFO L399 ceAbstractionStarter]: For program point L14'''''(line 14) no Hoare annotation was computed. [2018-01-31 08:39:29,136 INFO L399 ceAbstractionStarter]: For program point fooEXIT(lines 12 18) no Hoare annotation was computed. [2018-01-31 08:39:29,136 INFO L399 ceAbstractionStarter]: For program point L14''''(line 14) no Hoare annotation was computed. [2018-01-31 08:39:29,136 INFO L399 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-31 08:39:29,136 INFO L399 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-31 08:39:29,136 INFO L399 ceAbstractionStarter]: For program point L15'(line 15) no Hoare annotation was computed. [2018-01-31 08:39:29,136 INFO L399 ceAbstractionStarter]: For program point L15''(line 15) no Hoare annotation was computed. [2018-01-31 08:39:29,137 INFO L399 ceAbstractionStarter]: For program point L13'(line 13) no Hoare annotation was computed. [2018-01-31 08:39:29,137 INFO L399 ceAbstractionStarter]: For program point fooFINAL(lines 12 18) no Hoare annotation was computed. [2018-01-31 08:39:29,137 INFO L402 ceAbstractionStarter]: At program point fooENTRY(lines 12 18) the Hoare annotation is: true [2018-01-31 08:39:29,138 INFO L399 ceAbstractionStarter]: For program point L12(lines 12 18) no Hoare annotation was computed. [2018-01-31 08:39:29,138 INFO L399 ceAbstractionStarter]: For program point L15'''(line 15) no Hoare annotation was computed. [2018-01-31 08:39:29,138 INFO L399 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-01-31 08:39:29,138 INFO L399 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-01-31 08:39:29,138 INFO L399 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-01-31 08:39:29,138 INFO L399 ceAbstractionStarter]: For program point L12'(lines 12 18) no Hoare annotation was computed. [2018-01-31 08:39:29,138 INFO L399 ceAbstractionStarter]: For program point L14'(lines 14 16) no Hoare annotation was computed. [2018-01-31 08:39:29,138 INFO L399 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 15) no Hoare annotation was computed. [2018-01-31 08:39:29,139 INFO L395 ceAbstractionStarter]: At program point L14''''''(lines 14 16) the Hoare annotation is: (let ((.cse13 (exists ((foo_~i~1 Int)) (and (<= 0 (+ (* 4 foo_~i~1) |foo_#in~b.offset|)) (<= (+ foo_~i~1 1) |foo_#in~size|))))) (let ((.cse8 (not .cse13)) (.cse6 (not (= (select |#valid| |foo_#in~b.base|) 1))) (.cse7 (not (= 400 (select |#length| |foo_#in~b.base|)))) (.cse0 (<= 1 foo_~i~1)) (.cse10 (not (= 0 |foo_#in~b.offset|))) (.cse2 (<= |foo_#in~size| foo_~size)) (.cse3 (<= |foo_#in~size| foo_~n)) (.cse4 (= foo_~b.base |foo_#in~b.base|)) (.cse5 (= foo_~b.offset 0)) (.cse9 (= foo_~i~1 0)) (.cse11 (< |foo_#in~n| |foo_#in~size|))) (and (let ((.cse1 (<= foo_~size 1))) (or (and (<= foo_~i~1 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9) .cse10 (< 1 |foo_#in~size|) .cse11)) (or (and (= foo_~size 0) .cse3 .cse4 .cse5 .cse9) .cse6 .cse7 .cse10 (not (= 0 |foo_#in~size|)) .cse11) (or .cse6 .cse7 .cse8 (<= foo_~i~1 2) .cse10 (< 2 |foo_#in~size|) .cse11) (let ((.cse12 (<= foo_~size |foo_#in~size|)) (.cse14 (<= 2 foo_~n))) (or .cse6 .cse7 (and .cse12 .cse13 (and .cse2 .cse4 .cse14 .cse5 .cse0 (<= foo_~size foo_~n))) .cse10 (< |foo_#in~n| 2) (< 99 |foo_#in~size|) (and .cse12 .cse14 .cse2 .cse3 .cse4 .cse5 .cse9) .cse11))))) [2018-01-31 08:39:29,139 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 31) the Hoare annotation is: true [2018-01-31 08:39:29,139 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 31) no Hoare annotation was computed. [2018-01-31 08:39:29,139 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 31) the Hoare annotation is: true [2018-01-31 08:39:29,139 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 31) no Hoare annotation was computed. [2018-01-31 08:39:29,139 INFO L395 ceAbstractionStarter]: At program point L22'''''(lines 22 24) the Hoare annotation is: (let ((.cse0 (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1))) (.cse1 (= 0 |main_~#b~3.offset|)) (.cse2 (= (select |#length| |main_~#b~3.base|) 400)) (.cse3 (= 0 (select |old(#valid)| |main_~#b~3.base|)))) (or (and .cse0 .cse1 .cse2 (= main_~i~3 0) .cse3) (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3))) [2018-01-31 08:39:29,139 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-31 08:39:29,139 INFO L399 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-01-31 08:39:29,139 INFO L395 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1))) (.cse1 (= 0 |main_~#b~3.offset|)) (.cse2 (= (select |#length| |main_~#b~3.base|) 400)) (.cse3 (= 0 (select |old(#valid)| |main_~#b~3.base|)))) (or (and .cse0 .cse1 .cse2 (= main_~i~3 0) .cse3) (and .cse0 .cse1 .cse2 (<= 1 main_~i~3) .cse3 (<= main_~i~3 99)))) [2018-01-31 08:39:29,139 INFO L399 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2018-01-31 08:39:29,139 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-31 08:39:29,139 INFO L399 ceAbstractionStarter]: For program point L25(lines 25 29) no Hoare annotation was computed. [2018-01-31 08:39:29,139 INFO L399 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-31 08:39:29,139 INFO L399 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-01-31 08:39:29,140 INFO L399 ceAbstractionStarter]: For program point L23'''(line 23) no Hoare annotation was computed. [2018-01-31 08:39:29,140 INFO L399 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-31 08:39:29,140 INFO L399 ceAbstractionStarter]: For program point L23'(line 23) no Hoare annotation was computed. [2018-01-31 08:39:29,140 INFO L399 ceAbstractionStarter]: For program point L21'''''(line 21) no Hoare annotation was computed. [2018-01-31 08:39:29,140 INFO L399 ceAbstractionStarter]: For program point L22''''''(lines 22 24) no Hoare annotation was computed. [2018-01-31 08:39:29,140 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 20 31) no Hoare annotation was computed. [2018-01-31 08:39:29,140 INFO L399 ceAbstractionStarter]: For program point L22''(lines 22 24) no Hoare annotation was computed. [2018-01-31 08:39:29,140 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 20 31) no Hoare annotation was computed. [2018-01-31 08:39:29,140 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 20 31) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:39:29,140 INFO L399 ceAbstractionStarter]: For program point L22''''(line 22) no Hoare annotation was computed. [2018-01-31 08:39:29,140 INFO L399 ceAbstractionStarter]: For program point L22'''(line 22) no Hoare annotation was computed. [2018-01-31 08:39:29,140 INFO L399 ceAbstractionStarter]: For program point L26'(line 26) no Hoare annotation was computed. [2018-01-31 08:39:29,140 INFO L399 ceAbstractionStarter]: For program point L26''(line 26) no Hoare annotation was computed. [2018-01-31 08:39:29,140 INFO L399 ceAbstractionStarter]: For program point L21''''(line 21) no Hoare annotation was computed. [2018-01-31 08:39:29,140 INFO L399 ceAbstractionStarter]: For program point L26'''(line 26) no Hoare annotation was computed. [2018-01-31 08:39:29,141 INFO L395 ceAbstractionStarter]: At program point L25'''''(lines 25 29) the Hoare annotation is: (let ((.cse0 (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1))) (.cse1 (= 0 |main_~#b~3.offset|)) (.cse2 (= (select |#length| |main_~#b~3.base|) 400)) (.cse3 (= 0 (select |old(#valid)| |main_~#b~3.base|)))) (or (and .cse0 .cse1 .cse2 (= main_~i~3 0) .cse3) (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3))) [2018-01-31 08:39:29,141 INFO L399 ceAbstractionStarter]: For program point L25'''(line 25) no Hoare annotation was computed. [2018-01-31 08:39:29,141 INFO L399 ceAbstractionStarter]: For program point L25''''''(lines 25 29) no Hoare annotation was computed. [2018-01-31 08:39:29,141 INFO L399 ceAbstractionStarter]: For program point L21'''(line 21) no Hoare annotation was computed. [2018-01-31 08:39:29,141 INFO L399 ceAbstractionStarter]: For program point L21'(line 21) no Hoare annotation was computed. [2018-01-31 08:39:29,141 INFO L399 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-31 08:39:29,141 INFO L399 ceAbstractionStarter]: For program point L25''''(line 25) no Hoare annotation was computed. [2018-01-31 08:39:29,141 INFO L399 ceAbstractionStarter]: For program point L25''(lines 25 29) no Hoare annotation was computed. [2018-01-31 08:39:29,141 INFO L399 ceAbstractionStarter]: For program point L23''(line 23) no Hoare annotation was computed. [2018-01-31 08:39:29,141 INFO L399 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 20 31) no Hoare annotation was computed. [2018-01-31 08:39:29,141 INFO L399 ceAbstractionStarter]: For program point L21''(line 21) no Hoare annotation was computed. [2018-01-31 08:39:29,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,160 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,161 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,161 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,168 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,168 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,168 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,169 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,169 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,169 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,178 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,179 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:39:29 BoogieIcfgContainer [2018-01-31 08:39:29,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:39:29,191 INFO L168 Benchmark]: Toolchain (without parser) took 28814.69 ms. Allocated memory was 300.4 MB in the beginning and 645.9 MB in the end (delta: 345.5 MB). Free memory was 261.3 MB in the beginning and 510.8 MB in the end (delta: -249.5 MB). Peak memory consumption was 309.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:39:29,192 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 300.4 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:39:29,193 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.21 ms. Allocated memory is still 300.4 MB. Free memory was 260.3 MB in the beginning and 252.0 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 5.3 GB. [2018-01-31 08:39:29,193 INFO L168 Benchmark]: Boogie Preprocessor took 50.73 ms. Allocated memory is still 300.4 MB. Free memory was 252.0 MB in the beginning and 251.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-31 08:39:29,193 INFO L168 Benchmark]: RCFGBuilder took 537.40 ms. Allocated memory is still 300.4 MB. Free memory was 251.0 MB in the beginning and 232.9 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 5.3 GB. [2018-01-31 08:39:29,193 INFO L168 Benchmark]: TraceAbstraction took 27952.18 ms. Allocated memory was 300.4 MB in the beginning and 645.9 MB in the end (delta: 345.5 MB). Free memory was 231.9 MB in the beginning and 510.8 MB in the end (delta: -278.9 MB). Peak memory consumption was 279.6 MB. Max. memory is 5.3 GB. [2018-01-31 08:39:29,195 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.11 ms. Allocated memory is still 300.4 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 264.21 ms. Allocated memory is still 300.4 MB. Free memory was 260.3 MB in the beginning and 252.0 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 50.73 ms. Allocated memory is still 300.4 MB. Free memory was 252.0 MB in the beginning and 251.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 537.40 ms. Allocated memory is still 300.4 MB. Free memory was 251.0 MB in the beginning and 232.9 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 27952.18 ms. Allocated memory was 300.4 MB in the beginning and 645.9 MB in the end (delta: 345.5 MB). Free memory was 231.9 MB in the beginning and 510.8 MB in the end (delta: -278.9 MB). Peak memory consumption was 279.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] * 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 * 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: 15]: 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: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds 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: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds 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: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2018-01-31 08:39:29,202 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,203 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,203 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,203 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,204 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,204 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,204 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,205 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,205 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,205 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[foo_~i~1,QUANTIFIED] [2018-01-31 08:39:29,214 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,218 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,219 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,219 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((i <= 1 && 1 <= i) && size <= 1) && \old(size) <= size) && \old(size) <= n) && b == b) && b == 0) || !(\valid[b] == 1)) || !(400 == unknown-#length-unknown[b])) || !(\exists foo_~i~1 : int :: 0 <= 4 * foo_~i~1 + b && foo_~i~1 + 1 <= \old(size))) || (((((size <= 1 && \old(size) <= size) && \old(size) <= n) && b == b) && b == 0) && i == 0)) || !(0 == b)) || 1 < \old(size)) || \old(n) < \old(size)) && (((((((((size == 0 && \old(size) <= n) && b == b) && b == 0) && i == 0) || !(\valid[b] == 1)) || !(400 == unknown-#length-unknown[b])) || !(0 == b)) || !(0 == \old(size))) || \old(n) < \old(size))) && ((((((!(\valid[b] == 1) || !(400 == unknown-#length-unknown[b])) || !(\exists foo_~i~1 : int :: 0 <= 4 * foo_~i~1 + b && foo_~i~1 + 1 <= \old(size))) || i <= 2) || !(0 == b)) || 2 < \old(size)) || \old(n) < \old(size))) && (((((((!(\valid[b] == 1) || !(400 == unknown-#length-unknown[b])) || ((size <= \old(size) && (\exists foo_~i~1 : int :: 0 <= 4 * foo_~i~1 + b && foo_~i~1 + 1 <= \old(size))) && ((((\old(size) <= size && b == b) && 2 <= n) && b == 0) && 1 <= i) && size <= n)) || !(0 == b)) || \old(n) < 2) || 99 < \old(size)) || ((((((size <= \old(size) && 2 <= n) && \old(size) <= size) && \old(size) <= n) && b == b) && b == 0) && i == 0)) || \old(n) < \old(size)) - InvariantResult [Line: 25]: Loop Invariant [2018-01-31 08:39:29,220 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((\valid == \old(\valid)[b := 1] && 0 == b) && unknown-#length-unknown[b] == 400) && i == 0) && 0 == \old(\valid)[b]) || ((((1 <= i && \valid == \old(\valid)[b := 1]) && 0 == b) && unknown-#length-unknown[b] == 400) && 0 == \old(\valid)[b]) - InvariantResult [Line: 22]: Loop Invariant [2018-01-31 08:39:29,222 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,222 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:39:29,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((\valid == \old(\valid)[b := 1] && 0 == b) && unknown-#length-unknown[b] == 400) && i == 0) && 0 == \old(\valid)[b]) || ((((1 <= i && \valid == \old(\valid)[b := 1]) && 0 == b) && unknown-#length-unknown[b] == 400) && 0 == \old(\valid)[b]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 64 locations, 8 error locations. SAFE Result, 27.8s OverallTime, 23 OverallIterations, 20 TraceHistogramMax, 11.2s AutomataDifference, 0.0s DeadEndRemovalTime, 5.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1160 SDtfs, 2447 SDslu, 5878 SDs, 0 SdLazy, 4840 SolverSat, 341 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1922 GetRequests, 1441 SyntacticMatches, 40 SemanticMatches, 441 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3752 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 286 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 39 PreInvPairs, 82 NumberOfFragments, 407 HoareAnnotationTreeSize, 39 FomulaSimplifications, 5566 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 9 FomulaSimplificationsInter, 3575 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 3303 NumberOfCodeBlocks, 2876 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3265 ConstructedInterpolants, 444 QuantifiedInterpolants, 1575537 SizeOfPredicates, 93 NumberOfNonLiveVariables, 2547 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 38 InterpolantComputations, 11 PerfectInterpolantSequences, 5472/6055 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-39-29-235.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-39-29-235.csv Received shutdown request...