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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 18:38:27,371 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 18:38:27,372 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 18:38:27,382 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 18:38:27,383 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 18:38:27,383 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 18:38:27,384 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 18:38:27,386 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 18:38:27,388 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 18:38:27,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 18:38:27,389 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 18:38:27,390 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 18:38:27,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 18:38:27,392 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 18:38:27,393 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 18:38:27,399 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 18:38:27,400 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 18:38:27,401 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 18:38:27,402 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 18:38:27,402 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 18:38:27,404 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 18:38:27,404 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 18:38:27,404 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 18:38:27,405 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 18:38:27,406 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 18:38:27,407 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 18:38:27,407 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 18:38:27,407 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 18:38:27,408 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 18:38:27,408 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 18:38:27,408 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 18:38:27,408 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 18:38:27,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 18:38:27,417 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 18:38:27,418 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 18:38:27,418 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 18:38:27,418 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 18:38:27,419 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 18:38:27,419 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 18:38:27,419 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 18:38:27,419 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 18:38:27,419 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 18:38:27,419 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 18:38:27,420 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 18:38:27,420 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 18:38:27,420 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 18:38:27,420 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 18:38:27,420 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 18:38:27,420 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 18:38:27,420 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 18:38:27,420 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 18:38:27,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:38:27,421 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 18:38:27,421 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 18:38:27,421 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 18:38:27,421 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 18:38:27,448 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 18:38:27,456 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 18:38:27,459 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 18:38:27,460 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 18:38:27,461 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 18:38:27,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-02-04 18:38:27,609 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 18:38:27,611 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 18:38:27,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 18:38:27,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 18:38:27,618 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 18:38:27,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:38:27" (1/1) ... [2018-02-04 18:38:27,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fe43571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:27, skipping insertion in model container [2018-02-04 18:38:27,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:38:27" (1/1) ... [2018-02-04 18:38:27,636 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:38:27,667 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:38:27,775 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:38:27,788 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:38:27,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:27 WrapperNode [2018-02-04 18:38:27,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 18:38:27,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 18:38:27,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 18:38:27,795 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 18:38:27,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:27" (1/1) ... [2018-02-04 18:38:27,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:27" (1/1) ... [2018-02-04 18:38:27,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:27" (1/1) ... [2018-02-04 18:38:27,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:27" (1/1) ... [2018-02-04 18:38:27,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:27" (1/1) ... [2018-02-04 18:38:27,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:27" (1/1) ... [2018-02-04 18:38:27,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:27" (1/1) ... [2018-02-04 18:38:27,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 18:38:27,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 18:38:27,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 18:38:27,825 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 18:38:27,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:27" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 18:38:27,862 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 18:38:27,862 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 18:38:27,862 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 18:38:27,863 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 18:38:27,863 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 18:38:27,863 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 18:38:27,863 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 18:38:27,863 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 18:38:27,863 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 18:38:27,863 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 18:38:27,863 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 18:38:27,863 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 18:38:27,863 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 18:38:27,863 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 18:38:27,863 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 18:38:27,863 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 18:38:28,027 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 18:38:28,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:38:28 BoogieIcfgContainer [2018-02-04 18:38:28,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 18:38:28,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 18:38:28,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 18:38:28,030 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 18:38:28,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 06:38:27" (1/3) ... [2018-02-04 18:38:28,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f26c78c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:38:28, skipping insertion in model container [2018-02-04 18:38:28,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:27" (2/3) ... [2018-02-04 18:38:28,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f26c78c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:38:28, skipping insertion in model container [2018-02-04 18:38:28,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:38:28" (3/3) ... [2018-02-04 18:38:28,032 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-02-04 18:38:28,037 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 18:38:28,042 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 18:38:28,083 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 18:38:28,083 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 18:38:28,083 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 18:38:28,083 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 18:38:28,083 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 18:38:28,084 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 18:38:28,084 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 18:38:28,084 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 18:38:28,084 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 18:38:28,094 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-02-04 18:38:28,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 18:38:28,102 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:28,103 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:28,103 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:28,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1159416495, now seen corresponding path program 1 times [2018-02-04 18:38:28,108 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:28,109 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:28,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:28,144 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:28,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:28,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:38:28,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:28,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:38:28,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 18:38:28,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 18:38:28,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 18:38:28,230 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-02-04 18:38:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:28,247 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-02-04 18:38:28,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 18:38:28,248 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-02-04 18:38:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:28,256 INFO L225 Difference]: With dead ends: 59 [2018-02-04 18:38:28,257 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 18:38:28,258 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-02-04 18:38:28,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 18:38:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-04 18:38:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 18:38:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-04 18:38:28,360 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 12 [2018-02-04 18:38:28,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:28,361 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-04 18:38:28,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 18:38:28,361 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-04 18:38:28,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 18:38:28,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:28,361 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:28,361 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:28,362 INFO L82 PathProgramCache]: Analyzing trace with hash 91943959, now seen corresponding path program 1 times [2018-02-04 18:38:28,362 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:28,362 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:28,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:28,363 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:28,363 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:28,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:38:28,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:28,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:38:28,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:38:28,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:38:28,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:38:28,430 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 4 states. [2018-02-04 18:38:28,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:28,579 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-02-04 18:38:28,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:38:28,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 18:38:28,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:28,580 INFO L225 Difference]: With dead ends: 55 [2018-02-04 18:38:28,581 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 18:38:28,581 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:38:28,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 18:38:28,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-04 18:38:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 18:38:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-02-04 18:38:28,586 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 14 [2018-02-04 18:38:28,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:28,587 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-02-04 18:38:28,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:38:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-02-04 18:38:28,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 18:38:28,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:28,588 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:28,588 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:28,588 INFO L82 PathProgramCache]: Analyzing trace with hash 91943960, now seen corresponding path program 1 times [2018-02-04 18:38:28,588 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:28,588 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:28,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:28,590 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:28,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:28,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:38:28,679 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:28,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:38:28,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:38:28,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:38:28,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:38:28,680 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 5 states. [2018-02-04 18:38:28,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:28,798 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-02-04 18:38:28,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:38:28,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 18:38:28,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:28,799 INFO L225 Difference]: With dead ends: 54 [2018-02-04 18:38:28,799 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 18:38:28,799 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:38:28,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 18:38:28,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 18:38:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 18:38:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-02-04 18:38:28,804 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 14 [2018-02-04 18:38:28,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:28,804 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-02-04 18:38:28,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:38:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-02-04 18:38:28,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 18:38:28,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:28,805 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] [2018-02-04 18:38:28,805 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:28,805 INFO L82 PathProgramCache]: Analyzing trace with hash -255124515, now seen corresponding path program 1 times [2018-02-04 18:38:28,805 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:28,805 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:28,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:28,806 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:28,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:28,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:28,827 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:38:28,827 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:28,828 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:28,828 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:28,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:28,884 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-02-04 18:38:28,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:28,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:28,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:38:28,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-02-04 18:38:28,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:28,902 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-02-04 18:38:28,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 18:38:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:38:28,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:28,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:38:28,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:38:28,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:38:28,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:38:28,908 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 4 states. [2018-02-04 18:38:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:28,947 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-02-04 18:38:28,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:38:28,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-04 18:38:28,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:28,948 INFO L225 Difference]: With dead ends: 51 [2018-02-04 18:38:28,948 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 18:38:28,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:38:28,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 18:38:28,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 18:38:28,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 18:38:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-02-04 18:38:28,950 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 20 [2018-02-04 18:38:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:28,951 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-02-04 18:38:28,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:38:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-02-04 18:38:28,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 18:38:28,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:28,951 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] [2018-02-04 18:38:28,952 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:28,952 INFO L82 PathProgramCache]: Analyzing trace with hash -255124514, now seen corresponding path program 1 times [2018-02-04 18:38:28,952 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:28,952 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:28,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:28,953 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:28,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:28,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:28,970 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:38:28,970 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:28,970 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:28,971 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:29,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:29,011 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 8 treesize of output 7 [2018-02-04 18:38:29,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:29,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:29,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-04 18:38:29,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 15 [2018-02-04 18:38:29,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:29,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:38:29,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-02-04 18:38:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:38:29,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:29,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 18:38:29,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:38:29,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:38:29,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:38:29,109 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 7 states. [2018-02-04 18:38:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:29,222 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-02-04 18:38:29,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 18:38:29,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-02-04 18:38:29,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:29,225 INFO L225 Difference]: With dead ends: 61 [2018-02-04 18:38:29,225 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 18:38:29,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:38:29,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 18:38:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2018-02-04 18:38:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 18:38:29,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-02-04 18:38:29,229 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 20 [2018-02-04 18:38:29,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:29,229 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-02-04 18:38:29,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:38:29,229 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-02-04 18:38:29,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 18:38:29,230 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:29,230 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:29,230 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:29,230 INFO L82 PathProgramCache]: Analyzing trace with hash 468265909, now seen corresponding path program 1 times [2018-02-04 18:38:29,231 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:29,231 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:29,231 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:29,232 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:29,232 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:29,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:38:29,309 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:29,310 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:29,310 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:29,328 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:38:29,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:38:29,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-02-04 18:38:29,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:38:29,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:38:29,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:38:29,367 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 9 states. [2018-02-04 18:38:29,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:29,491 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-04 18:38:29,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:38:29,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-04 18:38:29,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:29,492 INFO L225 Difference]: With dead ends: 92 [2018-02-04 18:38:29,492 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 18:38:29,492 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-02-04 18:38:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 18:38:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2018-02-04 18:38:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 18:38:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-02-04 18:38:29,497 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 24 [2018-02-04 18:38:29,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:29,497 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-02-04 18:38:29,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:38:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-02-04 18:38:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 18:38:29,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:29,498 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:29,498 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:29,499 INFO L82 PathProgramCache]: Analyzing trace with hash -504403376, now seen corresponding path program 1 times [2018-02-04 18:38:29,499 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:29,499 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:29,500 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:29,500 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:29,500 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:29,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:29,530 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:38:29,530 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:29,530 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:29,531 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:29,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:29,580 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 8 treesize of output 7 [2018-02-04 18:38:29,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:29,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:29,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-04 18:38:29,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 15 [2018-02-04 18:38:29,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:29,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:38:29,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-02-04 18:38:29,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:38:29,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:38:29,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 18:38:29,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 18:38:29,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 18:38:29,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-02-04 18:38:29,710 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 10 states. [2018-02-04 18:38:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:29,953 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-02-04 18:38:29,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 18:38:29,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-02-04 18:38:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:29,955 INFO L225 Difference]: With dead ends: 103 [2018-02-04 18:38:29,955 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 18:38:29,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-02-04 18:38:29,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 18:38:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 80. [2018-02-04 18:38:29,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 18:38:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-02-04 18:38:29,960 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 27 [2018-02-04 18:38:29,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:29,961 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-02-04 18:38:29,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 18:38:29,961 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-02-04 18:38:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 18:38:29,961 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:29,961 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] [2018-02-04 18:38:29,962 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:29,962 INFO L82 PathProgramCache]: Analyzing trace with hash 616992647, now seen corresponding path program 1 times [2018-02-04 18:38:29,962 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:29,962 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:29,963 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:29,964 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:29,964 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:29,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 18:38:30,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:30,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:38:30,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:38:30,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:38:30,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:38:30,011 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 4 states. [2018-02-04 18:38:30,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:30,048 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-02-04 18:38:30,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:38:30,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 18:38:30,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:30,049 INFO L225 Difference]: With dead ends: 77 [2018-02-04 18:38:30,049 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 18:38:30,049 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:38:30,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 18:38:30,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 18:38:30,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 18:38:30,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-02-04 18:38:30,053 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 29 [2018-02-04 18:38:30,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:30,053 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-02-04 18:38:30,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:38:30,054 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-02-04 18:38:30,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 18:38:30,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:30,054 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] [2018-02-04 18:38:30,055 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:30,055 INFO L82 PathProgramCache]: Analyzing trace with hash 616992648, now seen corresponding path program 1 times [2018-02-04 18:38:30,055 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:30,055 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:30,056 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:30,056 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:30,056 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:30,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 18:38:30,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:30,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 18:38:30,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:38:30,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:38:30,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:38:30,160 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 7 states. [2018-02-04 18:38:30,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:30,276 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-02-04 18:38:30,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 18:38:30,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-04 18:38:30,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:30,276 INFO L225 Difference]: With dead ends: 76 [2018-02-04 18:38:30,276 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 18:38:30,277 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:38:30,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 18:38:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-04 18:38:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 18:38:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-02-04 18:38:30,280 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 29 [2018-02-04 18:38:30,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:30,280 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-02-04 18:38:30,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:38:30,280 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-02-04 18:38:30,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 18:38:30,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:30,281 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] [2018-02-04 18:38:30,281 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:30,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1946902913, now seen corresponding path program 1 times [2018-02-04 18:38:30,281 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:30,281 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:30,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:30,282 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:30,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:30,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 18:38:30,327 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:30,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:38:30,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:38:30,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:38:30,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:38:30,329 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 4 states. [2018-02-04 18:38:30,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:30,381 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-02-04 18:38:30,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:38:30,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-02-04 18:38:30,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:30,382 INFO L225 Difference]: With dead ends: 90 [2018-02-04 18:38:30,382 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 18:38:30,382 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:38:30,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 18:38:30,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2018-02-04 18:38:30,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 18:38:30,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-02-04 18:38:30,386 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 30 [2018-02-04 18:38:30,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:30,386 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-02-04 18:38:30,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:38:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-02-04 18:38:30,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 18:38:30,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:30,388 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:30,388 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:30,388 INFO L82 PathProgramCache]: Analyzing trace with hash 746385703, now seen corresponding path program 2 times [2018-02-04 18:38:30,388 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:30,388 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:30,389 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:30,389 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:30,389 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:30,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:38:30,451 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:30,451 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:30,452 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:38:30,469 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:38:30,470 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:38:30,473 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:30,508 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:38:30,509 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:38:30,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-02-04 18:38:30,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 18:38:30,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 18:38:30,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-04 18:38:30,509 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 12 states. [2018-02-04 18:38:30,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:30,723 INFO L93 Difference]: Finished difference Result 136 states and 138 transitions. [2018-02-04 18:38:30,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 18:38:30,723 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-02-04 18:38:30,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:30,724 INFO L225 Difference]: With dead ends: 136 [2018-02-04 18:38:30,724 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 18:38:30,724 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-02-04 18:38:30,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 18:38:30,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 108. [2018-02-04 18:38:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 18:38:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-02-04 18:38:30,728 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 31 [2018-02-04 18:38:30,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:30,728 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-02-04 18:38:30,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 18:38:30,729 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-02-04 18:38:30,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 18:38:30,729 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:30,730 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] [2018-02-04 18:38:30,730 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:30,730 INFO L82 PathProgramCache]: Analyzing trace with hash 946337879, now seen corresponding path program 1 times [2018-02-04 18:38:30,730 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:30,730 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:30,731 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:30,731 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:38:30,731 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:30,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 18:38:30,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:30,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:38:30,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:38:30,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:38:30,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:38:30,790 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 6 states. [2018-02-04 18:38:30,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:30,841 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-02-04 18:38:30,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 18:38:30,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-02-04 18:38:30,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:30,842 INFO L225 Difference]: With dead ends: 107 [2018-02-04 18:38:30,842 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 18:38:30,842 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:38:30,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 18:38:30,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-02-04 18:38:30,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 18:38:30,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-02-04 18:38:30,845 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 33 [2018-02-04 18:38:30,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:30,845 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-02-04 18:38:30,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:38:30,845 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-02-04 18:38:30,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 18:38:30,846 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:30,846 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] [2018-02-04 18:38:30,846 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:30,846 INFO L82 PathProgramCache]: Analyzing trace with hash 946337880, now seen corresponding path program 1 times [2018-02-04 18:38:30,846 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:30,846 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:30,847 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:30,847 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:30,847 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:30,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:30,858 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:38:30,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:30,858 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:30,859 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:30,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:30,919 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-02-04 18:38:30,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:30,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:30,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:38:30,943 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:30,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:30,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 18:38:30,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:30,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:30,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-04 18:38:30,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:30,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2018-02-04 18:38:30,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:31,013 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 2 xjuncts. [2018-02-04 18:38:31,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:81, output treesize:31 [2018-02-04 18:38:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 18:38:31,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:31,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 18:38:31,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:38:31,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:38:31,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:38:31,024 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 7 states. [2018-02-04 18:38:31,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:31,070 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-02-04 18:38:31,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 18:38:31,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-02-04 18:38:31,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:31,071 INFO L225 Difference]: With dead ends: 105 [2018-02-04 18:38:31,071 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 18:38:31,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-02-04 18:38:31,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 18:38:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-02-04 18:38:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 18:38:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-02-04 18:38:31,074 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 33 [2018-02-04 18:38:31,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:31,074 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-02-04 18:38:31,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:38:31,074 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-02-04 18:38:31,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 18:38:31,075 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:31,075 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] [2018-02-04 18:38:31,076 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:31,076 INFO L82 PathProgramCache]: Analyzing trace with hash 946329935, now seen corresponding path program 1 times [2018-02-04 18:38:31,076 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:31,076 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:31,077 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:31,077 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:31,077 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:31,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:31,094 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:38:31,095 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:31,095 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:31,095 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:31,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:31,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 18:38:31,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-02-04 18:38:31,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:31,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:31,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:31,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:3 [2018-02-04 18:38:31,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 18:38:31,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:31,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 18:38:31,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:38:31,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:38:31,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:38:31,158 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 7 states. [2018-02-04 18:38:31,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:31,219 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-02-04 18:38:31,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 18:38:31,219 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-02-04 18:38:31,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:31,219 INFO L225 Difference]: With dead ends: 111 [2018-02-04 18:38:31,220 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 18:38:31,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-02-04 18:38:31,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 18:38:31,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2018-02-04 18:38:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 18:38:31,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-02-04 18:38:31,222 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 33 [2018-02-04 18:38:31,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:31,222 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-02-04 18:38:31,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:38:31,222 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-02-04 18:38:31,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 18:38:31,222 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:31,222 INFO L351 BasicCegarLoop]: trace histogram [3, 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-02-04 18:38:31,222 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:31,223 INFO L82 PathProgramCache]: Analyzing trace with hash 529142380, now seen corresponding path program 1 times [2018-02-04 18:38:31,223 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:31,223 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:31,223 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:31,223 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:31,224 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:31,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:31,325 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 18:38:31,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:31,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 18:38:31,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:38:31,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:38:31,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:38:31,326 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 9 states. [2018-02-04 18:38:31,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:31,477 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2018-02-04 18:38:31,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 18:38:31,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-02-04 18:38:31,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:31,478 INFO L225 Difference]: With dead ends: 113 [2018-02-04 18:38:31,478 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 18:38:31,478 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-04 18:38:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 18:38:31,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2018-02-04 18:38:31,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 18:38:31,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-02-04 18:38:31,480 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 34 [2018-02-04 18:38:31,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:31,480 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-02-04 18:38:31,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:38:31,480 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-02-04 18:38:31,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 18:38:31,480 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:31,480 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:31,480 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:31,481 INFO L82 PathProgramCache]: Analyzing trace with hash 569056812, now seen corresponding path program 3 times [2018-02-04 18:38:31,481 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:31,481 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:31,481 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:31,481 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:31,481 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:31,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:31,488 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:38:31,488 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:31,488 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:31,489 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:38:31,503 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 18:38:31,503 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:38:31,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:31,516 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 8 treesize of output 7 [2018-02-04 18:38:31,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:31,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:31,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 18:38:31,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 15 [2018-02-04 18:38:31,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:31,541 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-02-04 18:38:31,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-02-04 18:38:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 18:38:31,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:38:31,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 18:38:31,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:38:31,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:38:31,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:38:31,577 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 7 states. [2018-02-04 18:38:31,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:31,677 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-02-04 18:38:31,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 18:38:31,678 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-02-04 18:38:31,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:31,678 INFO L225 Difference]: With dead ends: 107 [2018-02-04 18:38:31,678 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 18:38:31,679 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:38:31,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 18:38:31,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-02-04 18:38:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 18:38:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-02-04 18:38:31,681 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 34 [2018-02-04 18:38:31,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:31,681 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-02-04 18:38:31,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:38:31,681 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-02-04 18:38:31,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 18:38:31,681 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:31,681 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] [2018-02-04 18:38:31,681 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:31,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1102363112, now seen corresponding path program 1 times [2018-02-04 18:38:31,682 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:31,682 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:31,682 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:31,682 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:38:31,682 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:31,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:31,696 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:38:31,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:31,697 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:31,697 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:31,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:31,743 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-02-04 18:38:31,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:31,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:31,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:38:31,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:31,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-02-04 18:38:31,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2018-02-04 18:38:31,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:31,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:31,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:31,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:20 [2018-02-04 18:38:31,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 18:38:31,970 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:31,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 18:38:31,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 18:38:31,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 18:38:31,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=75, Unknown=6, NotChecked=0, Total=110 [2018-02-04 18:38:31,972 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 11 states. [2018-02-04 18:38:32,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:32,248 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-02-04 18:38:32,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 18:38:32,248 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-02-04 18:38:32,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:32,249 INFO L225 Difference]: With dead ends: 104 [2018-02-04 18:38:32,250 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 18:38:32,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=130, Unknown=7, NotChecked=0, Total=182 [2018-02-04 18:38:32,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 18:38:32,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-04 18:38:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 18:38:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-02-04 18:38:32,253 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 35 [2018-02-04 18:38:32,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:32,253 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-02-04 18:38:32,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 18:38:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-02-04 18:38:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 18:38:32,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:32,254 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:32,254 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:32,254 INFO L82 PathProgramCache]: Analyzing trace with hash 984721596, now seen corresponding path program 1 times [2018-02-04 18:38:32,254 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:32,254 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:32,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:32,256 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:32,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:32,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 18:38:32,329 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:32,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 18:38:32,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:38:32,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:38:32,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:38:32,330 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 9 states. [2018-02-04 18:38:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:32,428 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-02-04 18:38:32,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 18:38:32,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-02-04 18:38:32,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:32,430 INFO L225 Difference]: With dead ends: 77 [2018-02-04 18:38:32,430 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 18:38:32,430 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-02-04 18:38:32,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 18:38:32,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 18:38:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 18:38:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-02-04 18:38:32,432 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 41 [2018-02-04 18:38:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:32,433 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-02-04 18:38:32,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:38:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-02-04 18:38:32,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 18:38:32,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:32,434 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:32,434 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:32,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1657687266, now seen corresponding path program 1 times [2018-02-04 18:38:32,434 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:32,434 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:32,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:32,435 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:32,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:32,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 18:38:32,485 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:32,486 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:32,486 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:32,500 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:32,532 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 18:38:32,532 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:38:32,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-02-04 18:38:32,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 18:38:32,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 18:38:32,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-02-04 18:38:32,533 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 11 states. [2018-02-04 18:38:32,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:32,796 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2018-02-04 18:38:32,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 18:38:32,797 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-04 18:38:32,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:32,797 INFO L225 Difference]: With dead ends: 102 [2018-02-04 18:38:32,797 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 18:38:32,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=106, Invalid=134, Unknown=0, NotChecked=0, Total=240 [2018-02-04 18:38:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 18:38:32,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2018-02-04 18:38:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 18:38:32,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-02-04 18:38:32,800 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 41 [2018-02-04 18:38:32,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:32,800 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-02-04 18:38:32,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 18:38:32,800 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-02-04 18:38:32,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 18:38:32,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:32,801 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:32,801 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:32,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1214448692, now seen corresponding path program 1 times [2018-02-04 18:38:32,801 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:32,801 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:32,802 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:32,802 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:32,802 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:32,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:32,817 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:38:32,817 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:32,817 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:32,818 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:32,840 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:32,857 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-02-04 18:38:32,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:32,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:32,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:38:32,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:32,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:32,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 18:38:32,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:32,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:32,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-02-04 18:38:32,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 18:38:32,916 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 10 treesize of output 9 [2018-02-04 18:38:32,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:32,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:32,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:32,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-02-04 18:38:32,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-02-04 18:38:32,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 7 treesize of output 1 [2018-02-04 18:38:32,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:32,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:32,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:32,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:27 [2018-02-04 18:38:33,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 18:38:33,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:33,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2018-02-04 18:38:33,140 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-02-04 18:38:33,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:33,142 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 16 treesize of output 23 [2018-02-04 18:38:33,142 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:33,146 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:33,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-02-04 18:38:33,156 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:33,157 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 16 treesize of output 23 [2018-02-04 18:38:33,157 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:33,171 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:33,175 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:33,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:38:33,183 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:70, output treesize:46 [2018-02-04 18:38:33,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 54 [2018-02-04 18:38:33,269 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:38:33,270 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:33,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2018-02-04 18:38:33,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:33,276 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:33,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 18 [2018-02-04 18:38:33,277 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:33,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:33,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:38:33,284 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:80, output treesize:18 [2018-02-04 18:38:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:38:33,301 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:38:33,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 18:38:33,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 18:38:33,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 18:38:33,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-02-04 18:38:33,302 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 19 states. [2018-02-04 18:38:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:33,819 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-02-04 18:38:33,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 18:38:33,820 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-02-04 18:38:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:33,820 INFO L225 Difference]: With dead ends: 87 [2018-02-04 18:38:33,820 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 18:38:33,821 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 18:38:33,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 18:38:33,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-04 18:38:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 18:38:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-02-04 18:38:33,822 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 44 [2018-02-04 18:38:33,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:33,823 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-02-04 18:38:33,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 18:38:33,823 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-02-04 18:38:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 18:38:33,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:33,823 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:33,823 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:33,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1501091225, now seen corresponding path program 2 times [2018-02-04 18:38:33,823 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:33,823 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:33,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:33,824 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:33,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:33,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 18:38:33,954 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:33,954 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:33,955 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:38:33,969 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:38:33,969 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:38:33,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:33,980 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 8 treesize of output 7 [2018-02-04 18:38:33,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:33,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:33,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 18:38:34,027 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 18:38:34,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:38:34,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-02-04 18:38:34,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 18:38:34,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 18:38:34,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-04 18:38:34,028 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 12 states. [2018-02-04 18:38:34,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:34,141 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-02-04 18:38:34,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 18:38:34,141 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-02-04 18:38:34,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:34,141 INFO L225 Difference]: With dead ends: 56 [2018-02-04 18:38:34,141 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 18:38:34,142 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-02-04 18:38:34,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 18:38:34,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-04 18:38:34,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 18:38:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-02-04 18:38:34,143 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 45 [2018-02-04 18:38:34,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:34,143 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-02-04 18:38:34,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 18:38:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-02-04 18:38:34,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 18:38:34,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:34,144 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:34,144 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:34,144 INFO L82 PathProgramCache]: Analyzing trace with hash 2137693807, now seen corresponding path program 2 times [2018-02-04 18:38:34,145 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:34,145 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:34,145 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:34,145 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:38:34,145 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:34,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:34,166 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:38:34,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:34,166 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:34,167 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:38:34,187 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:38:34,187 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:38:34,191 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:34,204 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-02-04 18:38:34,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:34,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:34,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:38:34,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:34,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:34,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 18:38:34,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:34,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:34,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-04 18:38:34,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 18:38:34,255 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 10 treesize of output 9 [2018-02-04 18:38:34,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:34,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:34,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:34,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-04 18:38:34,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-02-04 18:38:34,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 7 treesize of output 1 [2018-02-04 18:38:34,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:34,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:34,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:34,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:17 [2018-02-04 18:38:34,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-02-04 18:38:34,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:34,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 62 [2018-02-04 18:38:34,988 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-02-04 18:38:34,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 40 [2018-02-04 18:38:34,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 43 [2018-02-04 18:38:34,998 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:35,005 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:35,011 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:35,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-02-04 18:38:35,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:35,030 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-02-04 18:38:35,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:35,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:35,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:35,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 64 [2018-02-04 18:38:35,035 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:35,042 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:35,051 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:35,059 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:35,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-02-04 18:38:35,080 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:115, output treesize:91 [2018-02-04 18:38:35,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 107 [2018-02-04 18:38:35,223 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:35,225 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:35,225 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:38:35,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:35,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 133 [2018-02-04 18:38:35,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:35,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 12 [2018-02-04 18:38:35,250 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:35,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:35,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:35,262 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:151, output treesize:10 [2018-02-04 18:38:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 15 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:38:35,295 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:38:35,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 18:38:35,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 18:38:35,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 18:38:35,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=357, Unknown=34, NotChecked=0, Total=462 [2018-02-04 18:38:35,296 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 22 states. [2018-02-04 18:38:36,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:36,992 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-02-04 18:38:36,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 18:38:36,992 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 55 [2018-02-04 18:38:36,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:36,993 INFO L225 Difference]: With dead ends: 128 [2018-02-04 18:38:36,993 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 18:38:36,993 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=225, Invalid=1377, Unknown=120, NotChecked=0, Total=1722 [2018-02-04 18:38:36,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 18:38:36,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2018-02-04 18:38:36,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 18:38:36,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-02-04 18:38:36,995 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 55 [2018-02-04 18:38:36,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:36,995 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-02-04 18:38:36,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 18:38:36,995 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-02-04 18:38:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 18:38:36,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:36,996 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:36,996 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:36,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1655485324, now seen corresponding path program 3 times [2018-02-04 18:38:36,996 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:36,996 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:36,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:36,997 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:38:36,997 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:37,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 18:38:37,068 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:37,068 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:37,069 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:38:37,093 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 18:38:37,093 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:38:37,096 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:37,143 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 18:38:37,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:38:37,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2018-02-04 18:38:37,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 18:38:37,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 18:38:37,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-02-04 18:38:37,145 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 14 states. [2018-02-04 18:38:37,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:37,549 INFO L93 Difference]: Finished difference Result 144 states and 150 transitions. [2018-02-04 18:38:37,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 18:38:37,549 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-02-04 18:38:37,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:37,550 INFO L225 Difference]: With dead ends: 144 [2018-02-04 18:38:37,550 INFO L226 Difference]: Without dead ends: 144 [2018-02-04 18:38:37,550 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2018-02-04 18:38:37,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-04 18:38:37,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 106. [2018-02-04 18:38:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 18:38:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-02-04 18:38:37,552 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 58 [2018-02-04 18:38:37,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:37,552 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-02-04 18:38:37,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 18:38:37,552 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-02-04 18:38:37,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 18:38:37,553 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:37,553 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:37,553 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:37,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1376443912, now seen corresponding path program 4 times [2018-02-04 18:38:37,553 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:37,553 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:37,553 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:37,554 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:38:37,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:37,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:37,669 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 18:38:37,670 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:37,670 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:37,670 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:38:37,682 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:38:37,683 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:38:37,685 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:37,987 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 18:38:37,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:38:37,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-02-04 18:38:37,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 18:38:37,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 18:38:37,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-02-04 18:38:37,989 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 20 states. [2018-02-04 18:38:38,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:38,613 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-02-04 18:38:38,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 18:38:38,615 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2018-02-04 18:38:38,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:38,616 INFO L225 Difference]: With dead ends: 91 [2018-02-04 18:38:38,616 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 18:38:38,616 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 18:38:38,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 18:38:38,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-02-04 18:38:38,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 18:38:38,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-02-04 18:38:38,618 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 59 [2018-02-04 18:38:38,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:38,619 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-02-04 18:38:38,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 18:38:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-02-04 18:38:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 18:38:38,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:38,619 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:38,620 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:38,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1456637332, now seen corresponding path program 5 times [2018-02-04 18:38:38,620 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:38,620 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:38,621 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:38,621 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:38:38,621 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:38,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:38,638 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:38:38,638 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:38,638 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:38,639 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:38:38,664 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-02-04 18:38:38,664 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:38:38,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:38,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 6 treesize of output 5 [2018-02-04 18:38:38,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:38,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:38,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-02-04 18:38:38,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:38,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:38,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 18:38:38,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:38,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:38,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-02-04 18:38:38,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 18:38:38,749 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 10 treesize of output 9 [2018-02-04 18:38:38,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:38,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:38,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:38,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-02-04 18:38:38,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-02-04 18:38:38,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 7 treesize of output 1 [2018-02-04 18:38:38,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:38,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:38,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:38,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:21 [2018-02-04 18:38:40,087 WARN L146 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 81 DAG size of output 73 [2018-02-04 18:38:40,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2018-02-04 18:38:40,103 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-02-04 18:38:40,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,108 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 50 [2018-02-04 18:38:40,112 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2018-02-04 18:38:40,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,123 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 117 [2018-02-04 18:38:40,125 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:40,143 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:40,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:40,163 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:40,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 82 [2018-02-04 18:38:40,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,191 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 46 [2018-02-04 18:38:40,214 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,226 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 70 [2018-02-04 18:38:40,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,238 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,240 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 109 [2018-02-04 18:38:40,244 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:40,272 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:40,280 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:40,293 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:40,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:40,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-02-04 18:38:40,343 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:170, output treesize:152 [2018-02-04 18:38:40,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 140 [2018-02-04 18:38:40,561 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,562 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,564 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,565 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 73 [2018-02-04 18:38:40,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:40,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,590 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,590 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:38:40,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:40,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 96 [2018-02-04 18:38:40,594 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:40,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:40,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:38:40,626 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:230, output treesize:31 [2018-02-04 18:38:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 37 refuted. 31 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:38:40,706 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:38:40,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 18:38:40,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 18:38:40,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 18:38:40,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=653, Unknown=125, NotChecked=0, Total=870 [2018-02-04 18:38:40,707 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 30 states. [2018-02-04 18:38:44,189 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 96 DAG size of output 76 [2018-02-04 18:38:45,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:45,436 INFO L93 Difference]: Finished difference Result 151 states and 157 transitions. [2018-02-04 18:38:45,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 18:38:45,437 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2018-02-04 18:38:45,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:45,437 INFO L225 Difference]: With dead ends: 151 [2018-02-04 18:38:45,437 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 18:38:45,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=323, Invalid=2422, Unknown=447, NotChecked=0, Total=3192 [2018-02-04 18:38:45,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 18:38:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 117. [2018-02-04 18:38:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 18:38:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2018-02-04 18:38:45,441 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 66 [2018-02-04 18:38:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:45,441 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2018-02-04 18:38:45,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 18:38:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-02-04 18:38:45,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 18:38:45,442 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:45,442 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:45,442 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:45,442 INFO L82 PathProgramCache]: Analyzing trace with hash -590785937, now seen corresponding path program 6 times [2018-02-04 18:38:45,442 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:45,442 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:45,443 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:45,443 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:38:45,443 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:45,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 32 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 18:38:45,553 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:45,553 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:45,554 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:38:45,577 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-02-04 18:38:45,577 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:38:45,580 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 32 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 18:38:45,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:38:45,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 18 [2018-02-04 18:38:45,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 18:38:45,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 18:38:45,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-02-04 18:38:45,691 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 18 states. [2018-02-04 18:38:45,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:45,893 INFO L93 Difference]: Finished difference Result 163 states and 169 transitions. [2018-02-04 18:38:45,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 18:38:45,894 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2018-02-04 18:38:45,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:45,894 INFO L225 Difference]: With dead ends: 163 [2018-02-04 18:38:45,894 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 18:38:45,895 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=484, Unknown=0, NotChecked=0, Total=702 [2018-02-04 18:38:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 18:38:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2018-02-04 18:38:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 18:38:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-02-04 18:38:45,897 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 69 [2018-02-04 18:38:45,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:45,897 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-02-04 18:38:45,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 18:38:45,898 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-02-04 18:38:45,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 18:38:45,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:45,898 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:45,898 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:45,899 INFO L82 PathProgramCache]: Analyzing trace with hash -755276387, now seen corresponding path program 7 times [2018-02-04 18:38:45,899 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:45,899 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:45,899 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:45,899 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:38:45,899 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:45,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:46,003 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 35 proven. 33 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 18:38:46,003 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:46,003 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:46,004 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:46,016 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 50 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 18:38:46,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:38:46,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2018-02-04 18:38:46,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 18:38:46,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 18:38:46,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-02-04 18:38:46,087 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 19 states. [2018-02-04 18:38:46,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:46,325 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-02-04 18:38:46,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 18:38:46,325 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2018-02-04 18:38:46,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:46,326 INFO L225 Difference]: With dead ends: 104 [2018-02-04 18:38:46,326 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 18:38:46,326 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2018-02-04 18:38:46,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 18:38:46,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-04 18:38:46,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 18:38:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-02-04 18:38:46,327 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 70 [2018-02-04 18:38:46,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:46,328 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-02-04 18:38:46,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 18:38:46,328 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-02-04 18:38:46,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 18:38:46,328 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:46,328 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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-02-04 18:38:46,328 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:38:46,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1302767729, now seen corresponding path program 8 times [2018-02-04 18:38:46,328 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:46,328 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:46,329 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:46,329 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:46,329 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:46,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:46,342 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:38:46,343 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:46,343 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:46,343 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:38:46,358 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:38:46,359 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:38:46,362 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:46,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 6 treesize of output 5 [2018-02-04 18:38:46,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:46,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:46,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-02-04 18:38:46,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:46,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:46,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 18:38:46,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:46,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-02-04 18:38:46,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:46,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:46,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-02-04 18:38:46,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:38:46,560 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 8 treesize of output 7 [2018-02-04 18:38:46,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:46,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:46,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:38:46,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-02-04 18:38:46,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-02-04 18:38:46,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-02-04 18:38:46,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:46,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:46,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:46,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:22 [2018-02-04 18:38:48,492 WARN L146 SmtUtils]: Spent 295ms on a formula simplification. DAG size of input: 87 DAG size of output 78 [2018-02-04 18:38:48,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 10 [2018-02-04 18:38:48,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:48,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 88 [2018-02-04 18:38:48,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-02-04 18:38:48,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 52 [2018-02-04 18:38:48,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 54 [2018-02-04 18:38:48,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 56 [2018-02-04 18:38:48,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 63 [2018-02-04 18:38:48,787 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:48,802 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:48,815 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:48,829 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:48,842 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:48,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 98 [2018-02-04 18:38:48,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2018-02-04 18:38:48,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:48,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 66 [2018-02-04 18:38:48,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:48,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:48,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:48,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 92 [2018-02-04 18:38:48,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:48,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:48,897 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:48,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:48,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:48,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:48,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 135 [2018-02-04 18:38:48,904 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:48,919 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:48,932 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:48,944 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:48,960 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:48,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:49,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2018-02-04 18:38:49,045 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 13 variables, input treesize:181, output treesize:157 [2018-02-04 18:38:49,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 195 [2018-02-04 18:38:49,399 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:49,400 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:49,402 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:49,403 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:49,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:49,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:49,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:49,409 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:49,410 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:49,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:49,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:49,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:49,414 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:49,415 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:49,416 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:38:49,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:49,418 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:38:49,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 232 [2018-02-04 18:38:49,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:49,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 14 [2018-02-04 18:38:49,492 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:49,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:49,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:49,517 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:274, output treesize:14 [2018-02-04 18:38:49,588 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 55 refuted. 57 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:38:49,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:38:49,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 18:38:49,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 18:38:49,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 18:38:49,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=628, Unknown=150, NotChecked=0, Total=870 [2018-02-04 18:38:49,589 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 30 states. [2018-02-04 18:39:00,437 WARN L143 SmtUtils]: Spent 114ms on a formula simplification that was a NOOP. DAG size: 86 [2018-02-04 18:39:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:39:12,143 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2018-02-04 18:39:12,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 18:39:12,143 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 77 [2018-02-04 18:39:12,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:39:12,144 INFO L225 Difference]: With dead ends: 168 [2018-02-04 18:39:12,144 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 18:39:12,144 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=302, Invalid=2121, Unknown=547, NotChecked=0, Total=2970 [2018-02-04 18:39:12,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 18:39:12,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 141. [2018-02-04 18:39:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-04 18:39:12,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 147 transitions. [2018-02-04 18:39:12,146 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 147 transitions. Word has length 77 [2018-02-04 18:39:12,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:39:12,146 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 147 transitions. [2018-02-04 18:39:12,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 18:39:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 147 transitions. [2018-02-04 18:39:12,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 18:39:12,147 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:39:12,147 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 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-02-04 18:39:12,147 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:39:12,147 INFO L82 PathProgramCache]: Analyzing trace with hash 459506644, now seen corresponding path program 9 times [2018-02-04 18:39:12,147 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:39:12,147 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:39:12,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:39:12,148 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:39:12,148 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:39:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:39:12,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:39:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 45 proven. 50 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 18:39:12,250 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:39:12,251 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:39:12,251 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:39:12,276 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-02-04 18:39:12,276 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:39:12,279 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:39:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 45 proven. 32 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-04 18:39:12,381 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:39:12,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2018-02-04 18:39:12,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 18:39:12,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 18:39:12,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2018-02-04 18:39:12,382 INFO L87 Difference]: Start difference. First operand 141 states and 147 transitions. Second operand 20 states. [2018-02-04 18:39:12,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:39:12,722 INFO L93 Difference]: Finished difference Result 205 states and 213 transitions. [2018-02-04 18:39:12,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 18:39:12,722 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 80 [2018-02-04 18:39:12,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:39:12,723 INFO L225 Difference]: With dead ends: 205 [2018-02-04 18:39:12,723 INFO L226 Difference]: Without dead ends: 205 [2018-02-04 18:39:12,724 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=394, Invalid=866, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 18:39:12,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-04 18:39:12,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 149. [2018-02-04 18:39:12,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-04 18:39:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 155 transitions. [2018-02-04 18:39:12,727 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 155 transitions. Word has length 80 [2018-02-04 18:39:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:39:12,727 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 155 transitions. [2018-02-04 18:39:12,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 18:39:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2018-02-04 18:39:12,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 18:39:12,728 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:39:12,728 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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-02-04 18:39:12,728 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:39:12,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1572028070, now seen corresponding path program 10 times [2018-02-04 18:39:12,729 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:39:12,729 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:39:12,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:39:12,729 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:39:12,730 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:39:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:39:12,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:39:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 62 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-04 18:39:12,808 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:39:12,808 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:39:12,809 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:39:12,820 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:39:12,820 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:39:12,823 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:39:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 50 proven. 50 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-04 18:39:12,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:39:12,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2018-02-04 18:39:12,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 18:39:12,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 18:39:12,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2018-02-04 18:39:12,972 INFO L87 Difference]: Start difference. First operand 149 states and 155 transitions. Second operand 24 states. [2018-02-04 18:39:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:39:13,449 INFO L93 Difference]: Finished difference Result 179 states and 183 transitions. [2018-02-04 18:39:13,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 18:39:13,450 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 81 [2018-02-04 18:39:13,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:39:13,451 INFO L225 Difference]: With dead ends: 179 [2018-02-04 18:39:13,451 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 18:39:13,452 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=258, Invalid=1148, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 18:39:13,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 18:39:13,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 144. [2018-02-04 18:39:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 18:39:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 148 transitions. [2018-02-04 18:39:13,463 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 148 transitions. Word has length 81 [2018-02-04 18:39:13,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:39:13,463 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 148 transitions. [2018-02-04 18:39:13,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 18:39:13,463 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2018-02-04 18:39:13,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 18:39:13,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:39:13,464 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 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-02-04 18:39:13,464 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:39:13,464 INFO L82 PathProgramCache]: Analyzing trace with hash -951076584, now seen corresponding path program 11 times [2018-02-04 18:39:13,464 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:39:13,465 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:39:13,465 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:39:13,465 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:39:13,465 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:39:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:39:13,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:39:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 53 proven. 49 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 18:39:13,595 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:39:13,596 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:39:13,596 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:39:13,611 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-02-04 18:39:13,611 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:39:13,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:39:13,717 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 72 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 18:39:13,717 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:39:13,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 22 [2018-02-04 18:39:13,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 18:39:13,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 18:39:13,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2018-02-04 18:39:13,718 INFO L87 Difference]: Start difference. First operand 144 states and 148 transitions. Second operand 22 states. [2018-02-04 18:39:14,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:39:14,006 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-02-04 18:39:14,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 18:39:14,007 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 81 [2018-02-04 18:39:14,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:39:14,007 INFO L225 Difference]: With dead ends: 119 [2018-02-04 18:39:14,007 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 18:39:14,008 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=216, Invalid=906, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 18:39:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 18:39:14,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-02-04 18:39:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 18:39:14,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-02-04 18:39:14,009 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 81 [2018-02-04 18:39:14,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:39:14,010 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-02-04 18:39:14,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 18:39:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-02-04 18:39:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 18:39:14,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:39:14,010 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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-02-04 18:39:14,010 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:39:14,010 INFO L82 PathProgramCache]: Analyzing trace with hash -559166732, now seen corresponding path program 12 times [2018-02-04 18:39:14,010 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:39:14,011 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:39:14,011 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:39:14,011 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:39:14,011 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:39:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:39:14,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:39:14,038 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:39:14,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:39:14,039 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:39:14,039 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:39:14,079 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-04 18:39:14,080 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:39:14,085 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:39:14,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 6 treesize of output 5 [2018-02-04 18:39:14,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:39:14,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:39:14,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-02-04 18:39:14,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:14,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:14,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 18:39:14,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:39:14,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:39:14,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-02-04 18:39:14,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 18:39:14,156 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 10 treesize of output 9 [2018-02-04 18:39:14,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:39:14,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:39:14,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:39:14,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-02-04 18:39:14,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-02-04 18:39:14,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 7 treesize of output 1 [2018-02-04 18:39:14,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:39:14,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:39:14,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:39:14,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:18 [2018-02-04 18:39:25,600 WARN L146 SmtUtils]: Spent 593ms on a formula simplification. DAG size of input: 94 DAG size of output 84 [2018-02-04 18:39:25,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 104 [2018-02-04 18:39:25,663 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-02-04 18:39:25,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 61 [2018-02-04 18:39:25,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 63 [2018-02-04 18:39:25,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2018-02-04 18:39:25,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 67 [2018-02-04 18:39:25,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 76 [2018-02-04 18:39:25,812 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:39:25,838 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:39:25,860 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:39:25,883 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:39:25,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:39:25,931 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:39:25,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 118 [2018-02-04 18:39:25,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:25,985 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 60 [2018-02-04 18:39:25,989 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:25,990 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:25,991 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:25,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 84 [2018-02-04 18:39:25,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,000 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,001 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,002 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 120 [2018-02-04 18:39:26,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,012 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,012 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,014 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,015 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,016 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,017 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 168 [2018-02-04 18:39:26,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,025 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 235 [2018-02-04 18:39:26,037 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 18:39:26,080 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:39:26,097 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:39:26,111 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:39:26,125 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:39:26,146 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:39:26,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:39:26,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-2 vars, End of recursive call: 12 dim-0 vars, and 1 xjuncts. [2018-02-04 18:39:26,208 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 13 variables, input treesize:194, output treesize:178 [2018-02-04 18:39:26,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 187 [2018-02-04 18:39:26,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,585 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:39:26,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,590 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,594 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,595 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,595 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:39:26,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 339 [2018-02-04 18:39:26,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:39:26,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 11 [2018-02-04 18:39:26,666 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:39:26,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:39:26,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:39:26,681 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 15 variables, input treesize:274, output treesize:11 [2018-02-04 18:39:26,789 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 27 refuted. 95 times theorem prover too weak. 45 trivial. 0 not checked. [2018-02-04 18:39:26,789 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:39:26,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 18:39:26,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 18:39:26,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 18:39:26,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=509, Unknown=299, NotChecked=0, Total=870 [2018-02-04 18:39:26,790 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 30 states. [2018-02-04 18:39:46,419 WARN L143 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 79 [2018-02-04 18:39:51,413 WARN L143 SmtUtils]: Spent 168ms on a formula simplification that was a NOOP. DAG size: 87 [2018-02-04 18:40:15,236 WARN L143 SmtUtils]: Spent 953ms on a formula simplification that was a NOOP. DAG size: 94 [2018-02-04 18:40:24,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:40:24,957 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2018-02-04 18:40:24,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 18:40:24,957 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 88 [2018-02-04 18:40:24,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:40:24,957 INFO L225 Difference]: With dead ends: 123 [2018-02-04 18:40:24,958 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 18:40:24,958 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 47.4s TimeCoverageRelationStatistics Valid=279, Invalid=2251, Unknown=1010, NotChecked=0, Total=3540 [2018-02-04 18:40:24,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 18:40:24,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2018-02-04 18:40:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 18:40:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2018-02-04 18:40:24,959 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 88 [2018-02-04 18:40:24,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:40:24,960 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2018-02-04 18:40:24,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 18:40:24,960 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2018-02-04 18:40:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 18:40:24,960 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:40:24,960 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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-02-04 18:40:24,960 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:40:24,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1797486475, now seen corresponding path program 13 times [2018-02-04 18:40:24,960 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:40:24,960 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:40:24,961 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:40:24,961 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:40:24,961 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:40:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:40:24,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:40:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 32 proven. 85 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 18:40:25,059 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:40:25,059 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:40:25,059 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:40:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:40:25,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:40:25,230 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 72 proven. 72 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-02-04 18:40:25,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:40:25,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-02-04 18:40:25,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 18:40:25,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 18:40:25,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2018-02-04 18:40:25,231 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand 28 states. [2018-02-04 18:40:25,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:40:25,598 INFO L93 Difference]: Finished difference Result 202 states and 209 transitions. [2018-02-04 18:40:25,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 18:40:25,599 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 92 [2018-02-04 18:40:25,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:40:25,599 INFO L225 Difference]: With dead ends: 202 [2018-02-04 18:40:25,599 INFO L226 Difference]: Without dead ends: 179 [2018-02-04 18:40:25,600 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=334, Invalid=1558, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 18:40:25,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-04 18:40:25,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 163. [2018-02-04 18:40:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-04 18:40:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 169 transitions. [2018-02-04 18:40:25,607 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 169 transitions. Word has length 92 [2018-02-04 18:40:25,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:40:25,607 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 169 transitions. [2018-02-04 18:40:25,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 18:40:25,607 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 169 transitions. [2018-02-04 18:40:25,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 18:40:25,609 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:40:25,609 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 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-02-04 18:40:25,609 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:40:25,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1681484029, now seen corresponding path program 14 times [2018-02-04 18:40:25,610 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:40:25,610 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:40:25,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:40:25,610 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:40:25,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:40:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:40:25,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:40:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 75 proven. 68 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-04 18:40:25,772 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:40:25,772 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:40:25,773 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:40:25,786 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:40:25,787 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:40:25,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:40:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 98 proven. 45 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-04 18:40:25,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:40:25,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2018-02-04 18:40:25,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 18:40:25,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 18:40:25,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2018-02-04 18:40:25,893 INFO L87 Difference]: Start difference. First operand 163 states and 169 transitions. Second operand 25 states. [2018-02-04 18:40:26,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:40:26,139 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2018-02-04 18:40:26,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 18:40:26,140 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 92 [2018-02-04 18:40:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:40:26,140 INFO L225 Difference]: With dead ends: 136 [2018-02-04 18:40:26,141 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 18:40:26,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=278, Invalid=1204, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 18:40:26,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 18:40:26,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2018-02-04 18:40:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 18:40:26,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-02-04 18:40:26,142 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 92 [2018-02-04 18:40:26,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:40:26,143 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-02-04 18:40:26,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 18:40:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-02-04 18:40:26,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 18:40:26,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:40:26,143 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 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-02-04 18:40:26,143 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:40:26,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1684179480, now seen corresponding path program 15 times [2018-02-04 18:40:26,143 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:40:26,143 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:40:26,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:40:26,144 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:40:26,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:40:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:40:26,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:40:26,338 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 75 proven. 73 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-02-04 18:40:26,339 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:40:26,339 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:40:26,339 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:40:26,365 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-02-04 18:40:26,365 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:40:26,368 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:40:26,563 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 63 proven. 50 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-04 18:40:26,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:40:26,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2018-02-04 18:40:26,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 18:40:26,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 18:40:26,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=816, Unknown=0, NotChecked=0, Total=992 [2018-02-04 18:40:26,564 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 32 states. [2018-02-04 18:40:26,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:40:26,958 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-02-04 18:40:26,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 18:40:26,958 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 95 [2018-02-04 18:40:26,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:40:26,959 INFO L225 Difference]: With dead ends: 102 [2018-02-04 18:40:26,959 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 18:40:26,959 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=489, Invalid=1767, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 18:40:26,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 18:40:26,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-02-04 18:40:26,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 18:40:26,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-02-04 18:40:26,960 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 95 [2018-02-04 18:40:26,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:40:26,961 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-02-04 18:40:26,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 18:40:26,961 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-02-04 18:40:26,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 18:40:26,961 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:40:26,961 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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-02-04 18:40:26,961 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:40:26,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1419901777, now seen corresponding path program 16 times [2018-02-04 18:40:26,961 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:40:26,961 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:40:26,962 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:40:26,962 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:40:26,962 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:40:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:40:26,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:40:26,983 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:40:26,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:40:26,983 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:40:26,984 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:40:27,002 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:40:27,002 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:40:27,006 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:40:27,015 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-02-04 18:40:27,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:40:27,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:27,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:40:27,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:27,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 18:40:27,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:40:27,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:27,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2018-02-04 18:40:27,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:27,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:27,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:27,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-02-04 18:40:27,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:40:27,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:27,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-02-04 18:40:27,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 18:40:27,072 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 10 treesize of output 9 [2018-02-04 18:40:27,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:40:27,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:27,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:27,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-02-04 18:40:27,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-02-04 18:40:27,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 7 treesize of output 1 [2018-02-04 18:40:27,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:40:27,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:27,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:27,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:29 [2018-02-04 18:40:29,705 WARN L143 SmtUtils]: Spent 117ms on a formula simplification that was a NOOP. DAG size: 61 [2018-02-04 18:40:30,526 WARN L146 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 75 DAG size of output 64 [2018-02-04 18:40:30,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 88 [2018-02-04 18:40:30,553 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 41 [2018-02-04 18:40:30,558 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,559 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 49 [2018-02-04 18:40:30,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,565 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2018-02-04 18:40:30,574 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,580 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 89 [2018-02-04 18:40:30,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,601 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,613 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,616 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 121 [2018-02-04 18:40:30,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,645 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 161 [2018-02-04 18:40:30,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,678 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,682 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,690 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 218 [2018-02-04 18:40:30,692 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:40:30,760 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:30,805 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:30,844 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:30,875 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:30,900 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:30,927 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:30,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 106 [2018-02-04 18:40:30,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,980 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 49 [2018-02-04 18:40:30,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2018-02-04 18:40:30,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,993 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,996 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:30,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 89 [2018-02-04 18:40:31,000 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,000 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,001 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,001 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,002 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,002 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 121 [2018-02-04 18:40:31,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,012 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,014 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,014 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,015 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,016 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,017 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,017 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,018 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 161 [2018-02-04 18:40:31,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,025 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 218 [2018-02-04 18:40:31,036 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 18:40:31,064 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:31,080 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:31,091 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:31,101 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:31,109 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:31,126 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:31,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:31,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:31,169 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 1 variables, input treesize:153, output treesize:154 [2018-02-04 18:40:31,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 149 [2018-02-04 18:40:31,454 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,455 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,457 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,458 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,458 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,459 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,459 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 157 [2018-02-04 18:40:31,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:40:31,515 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,515 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,516 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,516 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,518 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,525 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:40:31,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:31,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 207 [2018-02-04 18:40:31,527 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:40:31,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:31,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:40:31,556 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:232, output treesize:29 [2018-02-04 18:40:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-02-04 18:40:31,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:40:31,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 18:40:31,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 18:40:31,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 18:40:31,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1479, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 18:40:31,738 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 41 states. [2018-02-04 18:40:38,252 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 92 DAG size of output 65 [2018-02-04 18:40:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:40:39,675 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2018-02-04 18:40:39,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 18:40:39,675 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-02-04 18:40:39,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:40:39,676 INFO L225 Difference]: With dead ends: 144 [2018-02-04 18:40:39,676 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 18:40:39,677 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=435, Invalid=5727, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 18:40:39,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 18:40:39,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-02-04 18:40:39,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 18:40:39,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-02-04 18:40:39,678 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 99 [2018-02-04 18:40:39,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:40:39,678 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-02-04 18:40:39,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 18:40:39,678 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-02-04 18:40:39,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-04 18:40:39,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:40:39,679 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 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-02-04 18:40:39,679 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:40:39,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1834501176, now seen corresponding path program 17 times [2018-02-04 18:40:39,679 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:40:39,679 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:40:39,679 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:40:39,680 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:40:39,680 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:40:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:40:39,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:40:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 101 proven. 90 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 18:40:39,828 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:40:39,828 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:40:39,829 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:40:39,838 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-02-04 18:40:39,838 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:40:39,840 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:40:40,050 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 98 proven. 102 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-02-04 18:40:40,050 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:40:40,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2018-02-04 18:40:40,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 18:40:40,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 18:40:40,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1084, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 18:40:40,051 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 36 states. [2018-02-04 18:40:40,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:40:40,585 INFO L93 Difference]: Finished difference Result 151 states and 153 transitions. [2018-02-04 18:40:40,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 18:40:40,585 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 103 [2018-02-04 18:40:40,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:40:40,586 INFO L225 Difference]: With dead ends: 151 [2018-02-04 18:40:40,586 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 18:40:40,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=663, Invalid=4029, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 18:40:40,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 18:40:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-02-04 18:40:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 18:40:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-02-04 18:40:40,588 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 103 [2018-02-04 18:40:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:40:40,588 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-02-04 18:40:40,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 18:40:40,589 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-02-04 18:40:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-04 18:40:40,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:40:40,589 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 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-02-04 18:40:40,589 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:40:40,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1856187308, now seen corresponding path program 18 times [2018-02-04 18:40:40,589 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:40:40,589 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:40:40,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:40:40,590 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:40:40,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:40:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:40:40,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:40:40,612 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:40:40,612 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:40:40,612 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:40:40,613 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:40:40,644 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-02-04 18:40:40,644 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:40:40,649 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:40:40,655 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-02-04 18:40:40,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:40:40,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:40,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:40:40,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:40,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:40,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 18:40:40,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:40:40,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:40,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 18:40:40,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:40:40,675 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 8 treesize of output 7 [2018-02-04 18:40:40,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:40:40,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:40,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:40,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-04 18:40:40,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-02-04 18:40:40,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-02-04 18:40:40,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:40:40,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:40,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:40,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-02-04 18:40:53,610 WARN L146 SmtUtils]: Spent 858ms on a formula simplification. DAG size of input: 97 DAG size of output 85 [2018-02-04 18:40:53,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-02-04 18:40:53,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:40:54,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 140 [2018-02-04 18:40:54,060 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 69 [2018-02-04 18:40:54,066 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,066 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 83 [2018-02-04 18:40:54,086 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 111 [2018-02-04 18:40:54,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 153 [2018-02-04 18:40:54,151 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,157 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,165 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,173 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 209 [2018-02-04 18:40:54,202 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,208 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,210 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,215 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,217 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,223 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,238 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 279 [2018-02-04 18:40:54,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,270 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,276 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,279 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,286 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,290 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,296 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,299 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,306 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,309 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,313 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 363 [2018-02-04 18:40:54,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,330 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,342 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,358 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,367 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,370 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,373 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,377 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,383 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,386 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,389 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,392 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,394 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,400 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,404 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:54,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 465 [2018-02-04 18:40:54,409 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:40:54,543 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:54,627 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:54,705 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:54,771 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:54,833 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:54,888 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:54,937 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:55,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 162 [2018-02-04 18:40:55,049 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,050 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 75 [2018-02-04 18:40:55,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 97 [2018-02-04 18:40:55,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 122 [2018-02-04 18:40:55,079 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,083 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,087 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,094 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 162 [2018-02-04 18:40:55,100 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,106 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,110 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 215 [2018-02-04 18:40:55,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,127 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,127 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 282 [2018-02-04 18:40:55,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,151 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,156 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,157 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 368 [2018-02-04 18:40:55,164 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 18:40:55,199 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:55,221 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:55,237 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:55,251 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:55,264 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:55,277 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:55,298 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:55,319 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:55,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-02-04 18:40:55,359 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 8 variables, input treesize:255, output treesize:231 [2018-02-04 18:40:55,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 204 [2018-02-04 18:40:55,826 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,827 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,827 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,828 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,828 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,831 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,831 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:40:55,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,834 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,834 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,837 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,837 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,838 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 452 [2018-02-04 18:40:55,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:40:55,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,888 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,888 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,890 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,893 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,893 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,894 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,894 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,897 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,897 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,899 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,899 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:40:55,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 394 [2018-02-04 18:40:55,902 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:40:55,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:40:55,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:40:55,938 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:294, output treesize:19 [2018-02-04 18:40:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 58 refuted. 168 times theorem prover too weak. 84 trivial. 0 not checked. [2018-02-04 18:40:56,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:40:56,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 18:40:56,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 18:40:56,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 18:40:56,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1196, Unknown=749, NotChecked=0, Total=2070 [2018-02-04 18:40:56,165 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 46 states. [2018-02-04 18:41:29,643 WARN L143 SmtUtils]: Spent 149ms on a formula simplification that was a NOOP. DAG size: 85 [2018-02-04 18:41:32,203 WARN L143 SmtUtils]: Spent 127ms on a formula simplification that was a NOOP. DAG size: 87 [2018-02-04 18:41:48,841 WARN L146 SmtUtils]: Spent 1967ms on a formula simplification. DAG size of input: 125 DAG size of output 92 Received shutdown request... [2018-02-04 18:41:58,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 18:41:58,747 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 18:41:58,751 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 18:41:58,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 06:41:58 BoogieIcfgContainer [2018-02-04 18:41:58,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 18:41:58,752 INFO L168 Benchmark]: Toolchain (without parser) took 211141.87 ms. Allocated memory was 403.2 MB in the beginning and 748.2 MB in the end (delta: 345.0 MB). Free memory was 360.1 MB in the beginning and 584.8 MB in the end (delta: -224.8 MB). Peak memory consumption was 120.2 MB. Max. memory is 5.3 GB. [2018-02-04 18:41:58,753 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:41:58,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 183.11 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 349.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-04 18:41:58,753 INFO L168 Benchmark]: Boogie Preprocessor took 29.51 ms. Allocated memory is still 403.2 MB. Free memory was 349.4 MB in the beginning and 348.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 18:41:58,753 INFO L168 Benchmark]: RCFGBuilder took 203.02 ms. Allocated memory is still 403.2 MB. Free memory was 348.0 MB in the beginning and 327.4 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-02-04 18:41:58,754 INFO L168 Benchmark]: TraceAbstraction took 210723.19 ms. Allocated memory was 403.2 MB in the beginning and 748.2 MB in the end (delta: 345.0 MB). Free memory was 327.4 MB in the beginning and 584.8 MB in the end (delta: -257.4 MB). Peak memory consumption was 87.5 MB. Max. memory is 5.3 GB. [2018-02-04 18:41:58,755 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.13 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 183.11 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 349.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.51 ms. Allocated memory is still 403.2 MB. Free memory was 349.4 MB in the beginning and 348.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 203.02 ms. Allocated memory is still 403.2 MB. Free memory was 348.0 MB in the beginning and 327.4 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 210723.19 ms. Allocated memory was 403.2 MB in the beginning and 748.2 MB in the end (delta: 345.0 MB). Free memory was 327.4 MB in the beginning and 584.8 MB in the end (delta: -257.4 MB). Peak memory consumption was 87.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 45 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 87 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 45 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 87 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 45 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 87 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 45 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 87 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 45 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 87 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 45 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 87 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 45 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 87 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 45 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 87 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 45 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 87 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 45 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 87 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 45 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 87 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 45 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 87 known predicates. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 45 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 87 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 45 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 87 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 45 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 87 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 45 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 87 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 45 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 87 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 45 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 87 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 45 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 87 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 59 locations, 19 error locations. TIMEOUT Result, 210.6s OverallTime, 38 OverallIterations, 9 TraceHistogramMax, 164.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1343 SDtfs, 4759 SDslu, 7108 SDs, 0 SdLazy, 13239 SolverSat, 1356 SolverUnsat, 3009 SolverUnknown, 0 SolverNotchecked, 77.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2478 GetRequests, 1488 SyntacticMatches, 26 SemanticMatches, 963 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7446 ImplicationChecksByTransitivity, 119.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 354 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 44.4s InterpolantComputationTime, 3760 NumberOfCodeBlocks, 3719 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 2966 ConstructedInterpolants, 252 QuantifiedInterpolants, 3507247 SizeOfPredicates, 159 NumberOfNonLiveVariables, 6220 ConjunctsInSsa, 625 ConjunctsInUnsatCore, 53 InterpolantComputations, 15 PerfectInterpolantSequences, 2322/4145 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_18-41-58-760.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_18-41-58-760.csv Completed graceful shutdown