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/memsafety/960521-1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:53:54,879 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:53:54,880 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:53:54,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:53:54,894 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:53:54,895 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:53:54,896 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:53:54,897 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:53:54,899 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:53:54,900 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:53:54,900 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:53:54,900 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:53:54,901 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:53:54,902 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:53:54,903 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:53:54,905 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:53:54,906 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:53:54,908 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:53:54,909 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:53:54,910 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:53:54,911 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:53:54,912 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:53:54,912 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:53:54,913 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:53:54,913 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:53:54,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:53:54,914 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:53:54,915 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:53:54,915 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:53:54,915 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:53:54,916 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:53:54,916 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 17:53:54,925 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:53:54,925 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:53:54,926 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:53:54,926 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:53:54,927 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:53:54,927 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:53:54,927 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:53:54,927 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:53:54,927 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:53:54,927 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:53:54,927 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:53:54,928 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:53:54,928 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:53:54,928 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:53:54,928 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:53:54,928 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:53:54,928 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:53:54,928 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:53:54,929 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:53:54,929 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:53:54,929 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:53:54,929 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:53:54,929 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:53:54,929 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:53:54,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:53:54,967 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:53:54,970 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:53:54,972 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:53:54,972 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:53:54,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_true-valid-memsafety.i [2018-02-04 17:53:55,114 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:53:55,115 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:53:55,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:53:55,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:53:55,119 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:53:55,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:53:55" (1/1) ... [2018-02-04 17:53:55,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32677a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:55, skipping insertion in model container [2018-02-04 17:53:55,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:53:55" (1/1) ... [2018-02-04 17:53:55,132 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:53:55,161 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:53:55,248 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:53:55,260 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:53:55,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:55 WrapperNode [2018-02-04 17:53:55,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:53:55,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:53:55,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:53:55,267 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:53:55,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:55" (1/1) ... [2018-02-04 17:53:55,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:55" (1/1) ... [2018-02-04 17:53:55,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:55" (1/1) ... [2018-02-04 17:53:55,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:55" (1/1) ... [2018-02-04 17:53:55,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:55" (1/1) ... [2018-02-04 17:53:55,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:55" (1/1) ... [2018-02-04 17:53:55,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:55" (1/1) ... [2018-02-04 17:53:55,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:53:55,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:53:55,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:53:55,296 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:53:55,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:55" (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 17:53:55,336 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:53:55,336 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:53:55,336 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 17:53:55,336 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:53:55,336 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:53:55,336 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:53:55,336 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:53:55,336 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:53:55,336 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:53:55,336 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 17:53:55,336 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 17:53:55,337 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 17:53:55,337 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:53:55,337 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:53:55,337 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:53:55,495 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:53:55,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:53:55 BoogieIcfgContainer [2018-02-04 17:53:55,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:53:55,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:53:55,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:53:55,498 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:53:55,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:53:55" (1/3) ... [2018-02-04 17:53:55,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12696471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:53:55, skipping insertion in model container [2018-02-04 17:53:55,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:55" (2/3) ... [2018-02-04 17:53:55,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12696471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:53:55, skipping insertion in model container [2018-02-04 17:53:55,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:53:55" (3/3) ... [2018-02-04 17:53:55,500 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_true-valid-memsafety.i [2018-02-04 17:53:55,505 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:53:55,509 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 17:53:55,531 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:53:55,531 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:53:55,532 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:53:55,532 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:53:55,532 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:53:55,532 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:53:55,532 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:53:55,532 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:53:55,532 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:53:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-02-04 17:53:55,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 17:53:55,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:55,548 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:55,548 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:53:55,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989713, now seen corresponding path program 1 times [2018-02-04 17:53:55,552 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:55,552 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:55,584 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:55,584 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:55,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:55,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:55,691 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 17:53:55,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:55,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:53:55,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:53:55,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:53:55,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:53:55,703 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-02-04 17:53:55,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:55,816 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-02-04 17:53:55,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:53:55,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-02-04 17:53:55,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:55,875 INFO L225 Difference]: With dead ends: 52 [2018-02-04 17:53:55,875 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 17:53:55,877 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 17:53:55,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 17:53:55,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 17:53:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 17:53:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-02-04 17:53:55,899 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 11 [2018-02-04 17:53:55,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:55,900 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-02-04 17:53:55,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:53:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-02-04 17:53:55,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 17:53:55,900 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:55,900 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:55,900 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:53:55,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989714, now seen corresponding path program 1 times [2018-02-04 17:53:55,901 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:55,901 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:55,901 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:55,902 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:55,902 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:55,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:55,978 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 17:53:55,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:55,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:53:55,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:53:55,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:53:55,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:53:55,981 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 5 states. [2018-02-04 17:53:56,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:56,036 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-02-04 17:53:56,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:53:56,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-04 17:53:56,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:56,037 INFO L225 Difference]: With dead ends: 48 [2018-02-04 17:53:56,037 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 17:53:56,037 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 17:53:56,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 17:53:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 17:53:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 17:53:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-04 17:53:56,040 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2018-02-04 17:53:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:56,041 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-04 17:53:56,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:53:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-04 17:53:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:53:56,041 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:56,041 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:56,041 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:53:56,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525484, now seen corresponding path program 1 times [2018-02-04 17:53:56,041 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:56,042 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:56,042 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:56,042 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:56,043 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:56,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:56,059 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:53:56,059 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:53:56,059 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:53:56,061 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:56,104 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:53:56,128 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 17:53:56,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:56,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:56,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:53:56,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:56,153 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:56,156 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 17:53:56,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:56,164 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 17:53:56,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 17:53:56,182 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 17:53:56,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:56,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:53:56,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:53:56,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:53:56,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:53:56,183 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 5 states. [2018-02-04 17:53:56,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:56,250 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-02-04 17:53:56,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:53:56,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 17:53:56,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:56,252 INFO L225 Difference]: With dead ends: 45 [2018-02-04 17:53:56,252 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 17:53:56,252 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:53:56,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 17:53:56,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 17:53:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 17:53:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-02-04 17:53:56,256 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 17 [2018-02-04 17:53:56,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:56,256 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-02-04 17:53:56,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:53:56,256 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-02-04 17:53:56,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:53:56,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:56,257 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:56,257 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:53:56,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525483, now seen corresponding path program 1 times [2018-02-04 17:53:56,257 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:56,258 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:56,258 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:56,259 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:56,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:56,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:56,276 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:53:56,277 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:53:56,277 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:53:56,277 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:56,309 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:53:56,319 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 17:53:56,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:56,326 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 17:53:56,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:56,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:56,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-02-04 17:53:56,358 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:56,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:56,360 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 17:53:56,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:56,370 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 19 [2018-02-04 17:53:56,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:56,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:53:56,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-02-04 17:53:56,422 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 17:53:56,422 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:56,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:53:56,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:53:56,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:53:56,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:53:56,423 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 7 states. [2018-02-04 17:53:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:56,637 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-02-04 17:53:56,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:53:56,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-02-04 17:53:56,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:56,638 INFO L225 Difference]: With dead ends: 53 [2018-02-04 17:53:56,638 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 17:53:56,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:53:56,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 17:53:56,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-02-04 17:53:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 17:53:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-04 17:53:56,643 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 17 [2018-02-04 17:53:56,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:56,644 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-04 17:53:56,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:53:56,644 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-04 17:53:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 17:53:56,645 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:56,645 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:56,645 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:53:56,645 INFO L82 PathProgramCache]: Analyzing trace with hash -2106816852, now seen corresponding path program 1 times [2018-02-04 17:53:56,645 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:56,645 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:56,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:56,646 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:56,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:56,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:56,664 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:53:56,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:53:56,664 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:53:56,665 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:56,697 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:53:56,704 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 17:53:56,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:56,709 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 17:53:56,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:56,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:56,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-02-04 17:53:56,730 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:56,731 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:56,732 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 17:53:56,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:56,738 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 19 [2018-02-04 17:53:56,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:56,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:53:56,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-02-04 17:53:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:56,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:53:56,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 17:53:56,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:53:56,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:53:56,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:53:56,814 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 9 states. [2018-02-04 17:53:57,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:57,029 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-02-04 17:53:57,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:53:57,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-04 17:53:57,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:57,030 INFO L225 Difference]: With dead ends: 57 [2018-02-04 17:53:57,030 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 17:53:57,030 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:53:57,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 17:53:57,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-02-04 17:53:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 17:53:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-02-04 17:53:57,032 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 21 [2018-02-04 17:53:57,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:57,033 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-02-04 17:53:57,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:53:57,033 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-02-04 17:53:57,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 17:53:57,033 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:57,033 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:57,033 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:53:57,034 INFO L82 PathProgramCache]: Analyzing trace with hash -702775421, now seen corresponding path program 2 times [2018-02-04 17:53:57,034 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:57,034 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:57,034 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:57,034 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:57,034 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:57,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:57,048 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:53:57,049 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:53:57,049 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:53:57,049 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:53:57,078 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:53:57,078 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:53:57,082 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:53:57,090 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 17:53:57,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:57,097 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 17:53:57,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:57,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:57,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-02-04 17:53:57,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:57,126 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 19 [2018-02-04 17:53:57,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:57,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:57,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:57,138 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 17:53:57,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:57,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:53:57,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-02-04 17:53:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:57,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:53:57,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 17:53:57,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:53:57,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:53:57,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:53:57,227 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 9 states. [2018-02-04 17:53:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:57,486 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-02-04 17:53:57,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:53:57,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-02-04 17:53:57,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:57,487 INFO L225 Difference]: With dead ends: 73 [2018-02-04 17:53:57,487 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 17:53:57,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:53:57,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 17:53:57,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2018-02-04 17:53:57,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 17:53:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-02-04 17:53:57,490 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 25 [2018-02-04 17:53:57,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:57,491 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-02-04 17:53:57,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:53:57,491 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-02-04 17:53:57,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 17:53:57,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:57,491 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:57,491 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:53:57,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1827026138, now seen corresponding path program 3 times [2018-02-04 17:53:57,491 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:57,492 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:57,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:57,492 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:53:57,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:57,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:57,507 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:53:57,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:53:57,508 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:53:57,508 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:53:57,529 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 17:53:57,529 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:53:57,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:53:57,542 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 17:53:57,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:57,549 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 17:53:57,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:57,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:57,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-02-04 17:53:57,572 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:57,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-02-04 17:53:57,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:57,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:57,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:57,584 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 17:53:57,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:57,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:53:57,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-02-04 17:53:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 17:53:57,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:53:57,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 17:53:57,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:53:57,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:53:57,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:53:57,672 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 9 states. [2018-02-04 17:53:57,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:57,867 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-02-04 17:53:57,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:53:57,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-02-04 17:53:57,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:57,868 INFO L225 Difference]: With dead ends: 65 [2018-02-04 17:53:57,868 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 17:53:57,868 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:53:57,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 17:53:57,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-02-04 17:53:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 17:53:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-02-04 17:53:57,870 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 29 [2018-02-04 17:53:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:57,871 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-02-04 17:53:57,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:53:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-02-04 17:53:57,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 17:53:57,871 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:57,871 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:57,871 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:53:57,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1186509351, now seen corresponding path program 1 times [2018-02-04 17:53:57,872 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:57,872 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:57,872 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:57,872 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:53:57,872 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:57,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:57,919 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:57,919 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:53:57,919 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:53:57,920 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:57,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:53:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:57,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:53:57,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-02-04 17:53:57,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:53:57,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:53:57,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:53:57,971 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 11 states. [2018-02-04 17:53:58,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:58,028 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-02-04 17:53:58,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:53:58,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-02-04 17:53:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:58,029 INFO L225 Difference]: With dead ends: 82 [2018-02-04 17:53:58,029 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 17:53:58,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:53:58,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 17:53:58,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2018-02-04 17:53:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 17:53:58,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-02-04 17:53:58,033 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 32 [2018-02-04 17:53:58,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:58,033 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-02-04 17:53:58,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:53:58,033 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-02-04 17:53:58,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 17:53:58,033 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:58,033 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:58,034 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:53:58,034 INFO L82 PathProgramCache]: Analyzing trace with hash 547240098, now seen corresponding path program 2 times [2018-02-04 17:53:58,034 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:58,034 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:58,034 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:58,034 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:58,034 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:58,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:58,094 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:53:58,094 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:53:58,094 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:53:58,106 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 17:53:58,106 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:53:58,109 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:53:58,114 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 17:53:58,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:58,119 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 17:53:58,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-02-04 17:53:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 17:53:58,203 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:53:58,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-02-04 17:53:58,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:53:58,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:53:58,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:53:58,204 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 12 states. [2018-02-04 17:53:58,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:58,478 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-02-04 17:53:58,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:53:58,479 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-02-04 17:53:58,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:58,481 INFO L225 Difference]: With dead ends: 91 [2018-02-04 17:53:58,481 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 17:53:58,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:53:58,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 17:53:58,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2018-02-04 17:53:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 17:53:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-04 17:53:58,485 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 36 [2018-02-04 17:53:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:58,486 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-04 17:53:58,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:53:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-04 17:53:58,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 17:53:58,486 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:58,487 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:58,487 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:53:58,487 INFO L82 PathProgramCache]: Analyzing trace with hash -645884182, now seen corresponding path program 1 times [2018-02-04 17:53:58,487 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:58,487 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:58,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:58,488 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:53:58,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:58,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-04 17:53:58,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:58,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:53:58,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:53:58,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:53:58,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:53:58,520 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 4 states. [2018-02-04 17:53:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:58,539 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-02-04 17:53:58,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:53:58,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-02-04 17:53:58,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:58,540 INFO L225 Difference]: With dead ends: 70 [2018-02-04 17:53:58,540 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 17:53:58,540 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 17:53:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 17:53:58,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 17:53:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 17:53:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-02-04 17:53:58,542 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 40 [2018-02-04 17:53:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:58,542 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-02-04 17:53:58,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:53:58,542 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-02-04 17:53:58,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 17:53:58,543 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:58,543 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:58,543 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:53:58,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1747504322, now seen corresponding path program 1 times [2018-02-04 17:53:58,543 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:58,543 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:58,543 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:58,543 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:58,544 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:58,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 17:53:58,589 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:53:58,589 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:53:58,590 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:58,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:53:58,672 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 17:53:58,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:53:58,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-04 17:53:58,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:53:58,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:53:58,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:53:58,673 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 15 states. [2018-02-04 17:53:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:58,759 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-02-04 17:53:58,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:53:58,759 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-02-04 17:53:58,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:58,760 INFO L225 Difference]: With dead ends: 91 [2018-02-04 17:53:58,760 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 17:53:58,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:53:58,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 17:53:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2018-02-04 17:53:58,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 17:53:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-02-04 17:53:58,764 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 44 [2018-02-04 17:53:58,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:58,764 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-02-04 17:53:58,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:53:58,765 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-02-04 17:53:58,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 17:53:58,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:58,765 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:58,765 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:53:58,765 INFO L82 PathProgramCache]: Analyzing trace with hash -2024746485, now seen corresponding path program 2 times [2018-02-04 17:53:58,766 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:58,766 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:58,766 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:58,767 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:58,767 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:58,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:58,849 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 17:53:58,849 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:53:58,849 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:53:58,850 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:53:58,867 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:53:58,867 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:53:58,870 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:53:58,873 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 17:53:58,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:58,878 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 17:53:58,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-02-04 17:53:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 17:53:59,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:53:59,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-02-04 17:53:59,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:53:59,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:53:59,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:53:59,005 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 15 states. [2018-02-04 17:53:59,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:59,418 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-02-04 17:53:59,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:53:59,419 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-02-04 17:53:59,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:59,420 INFO L225 Difference]: With dead ends: 95 [2018-02-04 17:53:59,420 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 17:53:59,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=280, Invalid=712, Unknown=0, NotChecked=0, Total=992 [2018-02-04 17:53:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 17:53:59,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2018-02-04 17:53:59,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 17:53:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-02-04 17:53:59,428 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 48 [2018-02-04 17:53:59,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:59,428 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-02-04 17:53:59,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:53:59,428 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-02-04 17:53:59,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 17:53:59,429 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:59,429 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 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] [2018-02-04 17:53:59,429 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:53:59,430 INFO L82 PathProgramCache]: Analyzing trace with hash 221692532, now seen corresponding path program 1 times [2018-02-04 17:53:59,430 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:59,430 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:59,430 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:59,431 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:53:59,431 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:59,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:59,551 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 17:53:59,551 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:53:59,551 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:53:59,552 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:59,574 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:53:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 17:53:59,668 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:53:59,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-02-04 17:53:59,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:53:59,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:53:59,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:53:59,670 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 20 states. [2018-02-04 17:53:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:59,782 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-02-04 17:53:59,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:53:59,783 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 77 [2018-02-04 17:53:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:59,783 INFO L225 Difference]: With dead ends: 101 [2018-02-04 17:53:59,783 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 17:53:59,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=265, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:53:59,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 17:53:59,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-02-04 17:53:59,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 17:53:59,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-02-04 17:53:59,789 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 77 [2018-02-04 17:53:59,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:59,789 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-02-04 17:53:59,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:53:59,789 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-02-04 17:53:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 17:53:59,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:59,790 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 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 17:53:59,790 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:53:59,791 INFO L82 PathProgramCache]: Analyzing trace with hash -2016762915, now seen corresponding path program 2 times [2018-02-04 17:53:59,791 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:59,791 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:59,792 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:59,792 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:59,792 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:59,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-04 17:53:59,903 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:53:59,903 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:53:59,904 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:53:59,917 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 17:53:59,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:53:59,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:53:59,931 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 17:53:59,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:59,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:59,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:53:59,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:59,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:59,948 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 17:53:59,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:59,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:59,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-04 17:53:59,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:59,985 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 17:53:59,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:54:00,000 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 17:54:00,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2018-02-04 17:54:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-02-04 17:54:00,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:54:00,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2018-02-04 17:54:00,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:54:00,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:54:00,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:54:00,043 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 18 states. [2018-02-04 17:54:00,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:00,451 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-02-04 17:54:00,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 17:54:00,451 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 89 [2018-02-04 17:54:00,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:00,452 INFO L225 Difference]: With dead ends: 107 [2018-02-04 17:54:00,452 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 17:54:00,452 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=812, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 17:54:00,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 17:54:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-02-04 17:54:00,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 17:54:00,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-02-04 17:54:00,456 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 89 [2018-02-04 17:54:00,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:00,456 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-02-04 17:54:00,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:54:00,456 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-02-04 17:54:00,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 17:54:00,458 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:00,458 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 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 17:54:00,458 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:00,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1885333684, now seen corresponding path program 1 times [2018-02-04 17:54:00,458 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:00,458 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:00,459 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:00,459 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:00,459 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:00,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-04 17:54:00,586 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:00,586 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:00,587 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:54:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:00,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-04 17:54:00,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:00,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-02-04 17:54:00,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 17:54:00,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 17:54:00,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=353, Unknown=0, NotChecked=0, Total=552 [2018-02-04 17:54:00,700 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 24 states. [2018-02-04 17:54:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:00,877 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-02-04 17:54:00,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:54:00,877 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 97 [2018-02-04 17:54:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:00,878 INFO L225 Difference]: With dead ends: 115 [2018-02-04 17:54:00,878 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 17:54:00,878 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=222, Invalid=378, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:54:00,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 17:54:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-02-04 17:54:00,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 17:54:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-02-04 17:54:00,881 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 97 [2018-02-04 17:54:00,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:00,882 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-02-04 17:54:00,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 17:54:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-02-04 17:54:00,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 17:54:00,883 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:00,883 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 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 17:54:00,884 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:00,884 INFO L82 PathProgramCache]: Analyzing trace with hash -984574572, now seen corresponding path program 2 times [2018-02-04 17:54:00,884 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:00,884 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:00,884 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:00,885 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:54:00,885 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:00,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 17:54:01,038 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:01,038 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:01,039 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:54:01,063 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:54:01,063 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:01,066 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 17:54:01,081 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:01,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 16 [2018-02-04 17:54:01,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:54:01,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:54:01,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:54:01,082 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 16 states. [2018-02-04 17:54:01,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:01,285 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2018-02-04 17:54:01,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 17:54:01,285 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2018-02-04 17:54:01,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:01,286 INFO L225 Difference]: With dead ends: 123 [2018-02-04 17:54:01,286 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 17:54:01,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=250, Invalid=452, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:54:01,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 17:54:01,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-02-04 17:54:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 17:54:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-02-04 17:54:01,288 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 105 [2018-02-04 17:54:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:01,288 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-02-04 17:54:01,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:54:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-02-04 17:54:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 17:54:01,292 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:01,292 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 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 17:54:01,292 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:01,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1299772556, now seen corresponding path program 3 times [2018-02-04 17:54:01,292 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:01,292 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:01,293 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:01,293 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:01,293 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:01,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-04 17:54:01,488 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:01,488 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:01,488 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:54:01,526 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-02-04 17:54:01,526 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:01,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:01,696 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-04 17:54:01,697 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:01,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2018-02-04 17:54:01,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 17:54:01,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 17:54:01,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=482, Unknown=0, NotChecked=0, Total=756 [2018-02-04 17:54:01,697 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 28 states. [2018-02-04 17:54:01,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:01,837 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2018-02-04 17:54:01,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:54:01,838 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 113 [2018-02-04 17:54:01,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:01,838 INFO L225 Difference]: With dead ends: 131 [2018-02-04 17:54:01,838 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 17:54:01,839 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=301, Invalid=511, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:54:01,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 17:54:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-02-04 17:54:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 17:54:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-02-04 17:54:01,841 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 113 [2018-02-04 17:54:01,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:01,841 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-02-04 17:54:01,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 17:54:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-02-04 17:54:01,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-02-04 17:54:01,843 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:01,843 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 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 17:54:01,843 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:01,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1012020652, now seen corresponding path program 4 times [2018-02-04 17:54:01,843 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:01,843 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:01,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:01,844 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:01,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:01,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:01,974 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-04 17:54:01,974 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:01,974 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:01,975 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:54:01,996 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:54:01,996 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:02,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:02,003 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 17:54:02,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:54:02,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:54:02,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:54:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 288 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:54:02,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:02,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 30] total 45 [2018-02-04 17:54:02,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 17:54:02,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 17:54:02,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=1530, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 17:54:02,656 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 45 states. [2018-02-04 17:54:02,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:02,948 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-02-04 17:54:02,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:54:02,949 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 121 [2018-02-04 17:54:02,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:02,949 INFO L225 Difference]: With dead ends: 139 [2018-02-04 17:54:02,949 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 17:54:02,950 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=790, Invalid=2870, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:54:02,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 17:54:02,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-02-04 17:54:02,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 17:54:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-02-04 17:54:02,951 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 121 [2018-02-04 17:54:02,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:02,952 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-02-04 17:54:02,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 17:54:02,952 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-02-04 17:54:02,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-04 17:54:02,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:02,953 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 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 17:54:02,953 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:02,953 INFO L82 PathProgramCache]: Analyzing trace with hash 70210100, now seen corresponding path program 5 times [2018-02-04 17:54:02,953 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:02,953 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:02,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:02,954 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:02,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:02,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-02-04 17:54:03,102 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:03,102 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:03,103 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:54:03,131 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-02-04 17:54:03,131 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:03,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-02-04 17:54:03,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:03,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 19 [2018-02-04 17:54:03,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 17:54:03,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 17:54:03,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:54:03,168 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 19 states. [2018-02-04 17:54:03,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:03,369 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-02-04 17:54:03,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:54:03,369 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2018-02-04 17:54:03,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:03,370 INFO L225 Difference]: With dead ends: 147 [2018-02-04 17:54:03,370 INFO L226 Difference]: Without dead ends: 147 [2018-02-04 17:54:03,370 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=379, Invalid=677, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 17:54:03,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-04 17:54:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2018-02-04 17:54:03,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-04 17:54:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-02-04 17:54:03,372 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 129 [2018-02-04 17:54:03,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:03,373 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-02-04 17:54:03,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 17:54:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-02-04 17:54:03,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-04 17:54:03,373 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:03,373 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 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 17:54:03,374 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:03,374 INFO L82 PathProgramCache]: Analyzing trace with hash 523641620, now seen corresponding path program 6 times [2018-02-04 17:54:03,374 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:03,374 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:03,374 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:03,374 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:03,374 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:03,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-02-04 17:54:03,507 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:03,507 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:03,508 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:54:03,548 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-02-04 17:54:03,548 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:03,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-02-04 17:54:03,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:03,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 20 [2018-02-04 17:54:03,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:54:03,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:54:03,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:54:03,566 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 20 states. [2018-02-04 17:54:03,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:03,814 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2018-02-04 17:54:03,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 17:54:03,815 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2018-02-04 17:54:03,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:03,815 INFO L225 Difference]: With dead ends: 155 [2018-02-04 17:54:03,815 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 17:54:03,816 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=428, Invalid=762, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:54:03,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 17:54:03,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2018-02-04 17:54:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 17:54:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-02-04 17:54:03,819 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 137 [2018-02-04 17:54:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:03,819 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-02-04 17:54:03,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:54:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-02-04 17:54:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-04 17:54:03,820 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:03,820 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 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 17:54:03,820 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:03,820 INFO L82 PathProgramCache]: Analyzing trace with hash 2142026996, now seen corresponding path program 7 times [2018-02-04 17:54:03,820 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:03,820 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:03,821 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:03,821 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:03,821 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:03,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-02-04 17:54:04,020 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:04,021 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:04,021 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:54:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:04,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-02-04 17:54:04,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:04,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2018-02-04 17:54:04,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 17:54:04,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 17:54:04,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=800, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 17:54:04,175 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 36 states. [2018-02-04 17:54:04,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:04,408 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2018-02-04 17:54:04,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:54:04,409 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 145 [2018-02-04 17:54:04,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:04,410 INFO L225 Difference]: With dead ends: 163 [2018-02-04 17:54:04,410 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 17:54:04,410 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=495, Invalid=837, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:54:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 17:54:04,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-02-04 17:54:04,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-04 17:54:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-02-04 17:54:04,413 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 145 [2018-02-04 17:54:04,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:04,414 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-02-04 17:54:04,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 17:54:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-02-04 17:54:04,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-02-04 17:54:04,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:04,415 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 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 17:54:04,415 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:04,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1883086804, now seen corresponding path program 8 times [2018-02-04 17:54:04,415 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:04,415 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:04,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:04,416 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:54:04,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:04,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-02-04 17:54:04,624 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:04,624 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:04,624 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:54:04,639 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:54:04,639 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:04,642 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:04,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-02-04 17:54:04,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:04,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 22 [2018-02-04 17:54:04,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:54:04,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:54:04,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:54:04,677 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 22 states. [2018-02-04 17:54:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:04,983 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2018-02-04 17:54:04,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:54:04,983 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 153 [2018-02-04 17:54:04,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:04,984 INFO L225 Difference]: With dead ends: 171 [2018-02-04 17:54:04,984 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 17:54:04,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=535, Invalid=947, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 17:54:04,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 17:54:04,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2018-02-04 17:54:04,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-04 17:54:04,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-02-04 17:54:04,988 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 153 [2018-02-04 17:54:04,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:04,988 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-02-04 17:54:04,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:54:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-02-04 17:54:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-02-04 17:54:04,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:04,989 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 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 17:54:04,989 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:04,989 INFO L82 PathProgramCache]: Analyzing trace with hash 995314612, now seen corresponding path program 9 times [2018-02-04 17:54:04,989 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:04,989 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:04,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:04,990 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:04,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:05,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-02-04 17:54:05,200 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:05,200 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:05,201 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:54:05,240 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-02-04 17:54:05,240 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:05,246 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-02-04 17:54:05,271 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:05,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 23 [2018-02-04 17:54:05,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 17:54:05,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 17:54:05,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:54:05,272 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 23 states. [2018-02-04 17:54:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:05,582 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2018-02-04 17:54:05,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:54:05,583 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 161 [2018-02-04 17:54:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:05,583 INFO L225 Difference]: With dead ends: 179 [2018-02-04 17:54:05,583 INFO L226 Difference]: Without dead ends: 179 [2018-02-04 17:54:05,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=593, Invalid=1047, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 17:54:05,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-04 17:54:05,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2018-02-04 17:54:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-04 17:54:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-02-04 17:54:05,587 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 161 [2018-02-04 17:54:05,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:05,588 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-02-04 17:54:05,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 17:54:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-02-04 17:54:05,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 17:54:05,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:05,589 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 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 17:54:05,589 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:05,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1259880596, now seen corresponding path program 10 times [2018-02-04 17:54:05,589 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:05,589 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:05,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:05,590 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:05,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:05,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-02-04 17:54:05,829 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:05,829 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:05,830 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:54:05,857 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:54:05,858 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:05,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:05,867 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 17:54:05,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:54:05,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:54:05,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:54:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 648 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:54:06,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:06,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 42] total 63 [2018-02-04 17:54:06,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 17:54:06,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 17:54:06,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=882, Invalid=3024, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 17:54:06,814 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 63 states. [2018-02-04 17:54:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:07,273 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2018-02-04 17:54:07,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 17:54:07,274 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 169 [2018-02-04 17:54:07,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:07,274 INFO L225 Difference]: With dead ends: 187 [2018-02-04 17:54:07,274 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 17:54:07,275 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2637 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1543, Invalid=5597, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 17:54:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 17:54:07,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-02-04 17:54:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 17:54:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-02-04 17:54:07,277 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 169 [2018-02-04 17:54:07,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:07,277 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-02-04 17:54:07,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 17:54:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-02-04 17:54:07,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-04 17:54:07,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:07,278 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 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 17:54:07,278 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:07,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1232535156, now seen corresponding path program 11 times [2018-02-04 17:54:07,279 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:07,279 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:07,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:07,279 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:07,280 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:07,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-02-04 17:54:07,557 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:07,557 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:07,557 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:54:07,588 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2018-02-04 17:54:07,588 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:07,592 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-02-04 17:54:07,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:07,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 25 [2018-02-04 17:54:07,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 17:54:07,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 17:54:07,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:54:07,620 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 25 states. [2018-02-04 17:54:07,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:07,957 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2018-02-04 17:54:07,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 17:54:07,958 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 177 [2018-02-04 17:54:07,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:07,958 INFO L225 Difference]: With dead ends: 195 [2018-02-04 17:54:07,958 INFO L226 Difference]: Without dead ends: 195 [2018-02-04 17:54:07,959 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=718, Invalid=1262, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 17:54:07,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-04 17:54:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2018-02-04 17:54:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 17:54:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-02-04 17:54:07,963 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 177 [2018-02-04 17:54:07,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:07,963 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-02-04 17:54:07,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 17:54:07,963 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-02-04 17:54:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-02-04 17:54:07,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:07,964 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 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 17:54:07,964 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:07,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1075447124, now seen corresponding path program 12 times [2018-02-04 17:54:07,964 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:07,964 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:07,965 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:07,965 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:07,965 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:07,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-02-04 17:54:08,228 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:08,228 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:08,229 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:54:08,272 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-02-04 17:54:08,272 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:08,281 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-02-04 17:54:08,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:08,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 26 [2018-02-04 17:54:08,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 17:54:08,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 17:54:08,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2018-02-04 17:54:08,346 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 26 states. [2018-02-04 17:54:08,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:08,693 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2018-02-04 17:54:08,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 17:54:08,693 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 185 [2018-02-04 17:54:08,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:08,694 INFO L225 Difference]: With dead ends: 203 [2018-02-04 17:54:08,694 INFO L226 Difference]: Without dead ends: 203 [2018-02-04 17:54:08,694 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=785, Invalid=1377, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 17:54:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-04 17:54:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2018-02-04 17:54:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 17:54:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-02-04 17:54:08,696 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 185 [2018-02-04 17:54:08,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:08,696 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-02-04 17:54:08,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 17:54:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-02-04 17:54:08,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-04 17:54:08,697 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:08,697 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 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 17:54:08,697 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:08,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1200892620, now seen corresponding path program 13 times [2018-02-04 17:54:08,697 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:08,697 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:08,698 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:08,698 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:08,698 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:08,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-02-04 17:54:08,918 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:08,918 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:08,919 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:54:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:08,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-02-04 17:54:09,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:09,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-02-04 17:54:09,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 17:54:09,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 17:54:09,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=829, Invalid=1427, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 17:54:09,145 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 48 states. [2018-02-04 17:54:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:09,342 INFO L93 Difference]: Finished difference Result 211 states and 212 transitions. [2018-02-04 17:54:09,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 17:54:09,342 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 193 [2018-02-04 17:54:09,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:09,343 INFO L225 Difference]: With dead ends: 211 [2018-02-04 17:54:09,343 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 17:54:09,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=876, Invalid=1476, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 17:54:09,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 17:54:09,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2018-02-04 17:54:09,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-04 17:54:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-02-04 17:54:09,345 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 193 [2018-02-04 17:54:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:09,345 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-02-04 17:54:09,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 17:54:09,345 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-02-04 17:54:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-02-04 17:54:09,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:09,346 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 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 17:54:09,346 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:09,346 INFO L82 PathProgramCache]: Analyzing trace with hash -610865644, now seen corresponding path program 14 times [2018-02-04 17:54:09,346 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:09,346 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:09,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:09,347 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:54:09,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:09,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:09,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-02-04 17:54:09,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:09,677 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:09,677 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:54:09,702 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:54:09,702 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:09,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-02-04 17:54:09,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:09,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 28 [2018-02-04 17:54:09,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 17:54:09,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 17:54:09,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2018-02-04 17:54:09,751 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 28 states. [2018-02-04 17:54:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:10,080 INFO L93 Difference]: Finished difference Result 219 states and 220 transitions. [2018-02-04 17:54:10,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 17:54:10,080 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 201 [2018-02-04 17:54:10,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:10,081 INFO L225 Difference]: With dead ends: 219 [2018-02-04 17:54:10,081 INFO L226 Difference]: Without dead ends: 219 [2018-02-04 17:54:10,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=928, Invalid=1622, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 17:54:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-04 17:54:10,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2018-02-04 17:54:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-04 17:54:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-02-04 17:54:10,084 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 201 [2018-02-04 17:54:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:10,084 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-02-04 17:54:10,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 17:54:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-02-04 17:54:10,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-02-04 17:54:10,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:10,084 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 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 17:54:10,084 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1836724236, now seen corresponding path program 15 times [2018-02-04 17:54:10,085 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:10,085 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:10,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:10,085 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:10,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:10,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2018-02-04 17:54:10,341 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:10,341 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:10,341 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:54:10,368 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-02-04 17:54:10,368 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:10,372 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2018-02-04 17:54:10,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:10,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 52 [2018-02-04 17:54:10,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 17:54:10,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 17:54:10,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1676, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 17:54:10,628 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 52 states. [2018-02-04 17:54:10,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:10,904 INFO L93 Difference]: Finished difference Result 227 states and 228 transitions. [2018-02-04 17:54:10,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 17:54:10,904 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 209 [2018-02-04 17:54:10,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:10,905 INFO L225 Difference]: With dead ends: 227 [2018-02-04 17:54:10,905 INFO L226 Difference]: Without dead ends: 227 [2018-02-04 17:54:10,906 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1027, Invalid=1729, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 17:54:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-04 17:54:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2018-02-04 17:54:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-04 17:54:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-02-04 17:54:10,909 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 209 [2018-02-04 17:54:10,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:10,909 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-02-04 17:54:10,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 17:54:10,909 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-02-04 17:54:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-02-04 17:54:10,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:10,909 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 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 17:54:10,910 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:10,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1511851308, now seen corresponding path program 16 times [2018-02-04 17:54:10,910 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:10,910 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:10,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:10,910 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:10,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:10,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2018-02-04 17:54:11,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:11,232 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:11,233 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:54:11,266 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:54:11,267 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:11,280 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:11,284 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 17:54:11,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:54:11,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:54:11,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:54:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1152 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:54:12,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:12,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 54] total 81 [2018-02-04 17:54:12,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-02-04 17:54:12,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-02-04 17:54:12,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1458, Invalid=5022, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 17:54:12,260 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 81 states. [2018-02-04 17:54:12,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:12,828 INFO L93 Difference]: Finished difference Result 235 states and 236 transitions. [2018-02-04 17:54:12,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 17:54:12,829 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 217 [2018-02-04 17:54:12,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:12,829 INFO L225 Difference]: With dead ends: 235 [2018-02-04 17:54:12,829 INFO L226 Difference]: Without dead ends: 235 [2018-02-04 17:54:12,830 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4521 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2548, Invalid=9224, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 17:54:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-04 17:54:12,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2018-02-04 17:54:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 17:54:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-02-04 17:54:12,832 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 217 [2018-02-04 17:54:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:12,832 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-02-04 17:54:12,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-02-04 17:54:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-02-04 17:54:12,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-02-04 17:54:12,833 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:12,833 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 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 17:54:12,833 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:12,833 INFO L82 PathProgramCache]: Analyzing trace with hash -568791372, now seen corresponding path program 17 times [2018-02-04 17:54:12,833 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:12,833 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:12,834 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:12,834 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:12,834 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:12,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:13,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2018-02-04 17:54:13,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:13,106 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:13,106 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:54:13,130 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2018-02-04 17:54:13,130 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:13,134 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2018-02-04 17:54:13,182 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:13,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 31 [2018-02-04 17:54:13,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 17:54:13,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 17:54:13,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=520, Unknown=0, NotChecked=0, Total=930 [2018-02-04 17:54:13,183 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 31 states. [2018-02-04 17:54:13,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:13,593 INFO L93 Difference]: Finished difference Result 243 states and 244 transitions. [2018-02-04 17:54:13,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 17:54:13,593 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 225 [2018-02-04 17:54:13,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:13,594 INFO L225 Difference]: With dead ends: 243 [2018-02-04 17:54:13,595 INFO L226 Difference]: Without dead ends: 243 [2018-02-04 17:54:13,595 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1165, Invalid=2027, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 17:54:13,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-04 17:54:13,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2018-02-04 17:54:13,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 17:54:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2018-02-04 17:54:13,598 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 225 [2018-02-04 17:54:13,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:13,599 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2018-02-04 17:54:13,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 17:54:13,599 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2018-02-04 17:54:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-02-04 17:54:13,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:13,600 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 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 17:54:13,600 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:13,600 INFO L82 PathProgramCache]: Analyzing trace with hash 592587668, now seen corresponding path program 18 times [2018-02-04 17:54:13,600 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:13,600 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:13,601 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:13,601 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:13,601 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:13,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2018-02-04 17:54:14,065 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:14,065 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:14,066 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:54:14,111 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-02-04 17:54:14,111 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:14,122 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2018-02-04 17:54:14,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:14,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 33 [2018-02-04 17:54:14,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 17:54:14,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 17:54:14,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=615, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 17:54:14,175 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 33 states. [2018-02-04 17:54:14,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:14,582 INFO L93 Difference]: Finished difference Result 251 states and 252 transitions. [2018-02-04 17:54:14,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 17:54:14,582 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 233 [2018-02-04 17:54:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:14,583 INFO L225 Difference]: With dead ends: 251 [2018-02-04 17:54:14,583 INFO L226 Difference]: Without dead ends: 251 [2018-02-04 17:54:14,583 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1256, Invalid=2404, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:54:14,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-04 17:54:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2018-02-04 17:54:14,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-04 17:54:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-02-04 17:54:14,586 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 233 [2018-02-04 17:54:14,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:14,587 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-02-04 17:54:14,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 17:54:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-02-04 17:54:14,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-02-04 17:54:14,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:14,588 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 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 17:54:14,588 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:14,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1653001868, now seen corresponding path program 19 times [2018-02-04 17:54:14,588 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:14,588 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:14,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:14,589 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:14,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:14,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2018-02-04 17:54:15,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:15,000 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:15,000 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:54:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:15,016 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2018-02-04 17:54:15,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:15,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 60 [2018-02-04 17:54:15,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 17:54:15,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 17:54:15,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1306, Invalid=2234, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 17:54:15,316 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 60 states. [2018-02-04 17:54:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:15,541 INFO L93 Difference]: Finished difference Result 259 states and 260 transitions. [2018-02-04 17:54:15,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 17:54:15,542 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 241 [2018-02-04 17:54:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:15,542 INFO L225 Difference]: With dead ends: 259 [2018-02-04 17:54:15,542 INFO L226 Difference]: Without dead ends: 259 [2018-02-04 17:54:15,543 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1365, Invalid=2295, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:54:15,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-02-04 17:54:15,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2018-02-04 17:54:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-04 17:54:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-02-04 17:54:15,545 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 241 [2018-02-04 17:54:15,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:15,545 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-02-04 17:54:15,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 17:54:15,545 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-02-04 17:54:15,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-02-04 17:54:15,546 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:15,546 INFO L351 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 28, 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 17:54:15,546 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:15,546 INFO L82 PathProgramCache]: Analyzing trace with hash -734494636, now seen corresponding path program 20 times [2018-02-04 17:54:15,546 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:15,546 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:15,547 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:15,547 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:54:15,547 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:15,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-02-04 17:54:15,908 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:15,908 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:15,909 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:54:15,925 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:54:15,925 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:15,929 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-02-04 17:54:15,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:15,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 34 [2018-02-04 17:54:15,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 17:54:15,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 17:54:15,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=622, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 17:54:15,965 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 34 states. [2018-02-04 17:54:16,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:16,393 INFO L93 Difference]: Finished difference Result 267 states and 268 transitions. [2018-02-04 17:54:16,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 17:54:16,394 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 249 [2018-02-04 17:54:16,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:16,394 INFO L225 Difference]: With dead ends: 267 [2018-02-04 17:54:16,394 INFO L226 Difference]: Without dead ends: 267 [2018-02-04 17:54:16,395 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1429, Invalid=2477, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 17:54:16,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-04 17:54:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 263. [2018-02-04 17:54:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-04 17:54:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2018-02-04 17:54:16,397 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 249 [2018-02-04 17:54:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:16,397 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2018-02-04 17:54:16,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 17:54:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2018-02-04 17:54:16,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-02-04 17:54:16,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:16,398 INFO L351 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 29, 29, 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 17:54:16,398 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:16,398 INFO L82 PathProgramCache]: Analyzing trace with hash -822437836, now seen corresponding path program 21 times [2018-02-04 17:54:16,398 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:16,398 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:16,398 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:16,398 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:16,398 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:16,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2018-02-04 17:54:16,754 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:16,754 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:16,755 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:54:16,788 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-02-04 17:54:16,788 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:16,795 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2018-02-04 17:54:16,945 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:16,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32] total 35 [2018-02-04 17:54:16,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 17:54:16,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 17:54:16,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=658, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:54:16,946 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 35 states. [2018-02-04 17:54:17,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:17,332 INFO L93 Difference]: Finished difference Result 275 states and 276 transitions. [2018-02-04 17:54:17,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 17:54:17,332 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 257 [2018-02-04 17:54:17,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:17,333 INFO L225 Difference]: With dead ends: 275 [2018-02-04 17:54:17,333 INFO L226 Difference]: Without dead ends: 275 [2018-02-04 17:54:17,334 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1523, Invalid=2637, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 17:54:17,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-04 17:54:17,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2018-02-04 17:54:17,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-02-04 17:54:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-02-04 17:54:17,336 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 257 [2018-02-04 17:54:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:17,336 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-02-04 17:54:17,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 17:54:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-02-04 17:54:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-02-04 17:54:17,336 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:17,337 INFO L351 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 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 17:54:17,337 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:17,337 INFO L82 PathProgramCache]: Analyzing trace with hash 887748884, now seen corresponding path program 22 times [2018-02-04 17:54:17,337 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:17,337 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:17,337 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:17,337 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:17,337 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:17,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2018-02-04 17:54:17,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:17,707 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:17,707 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:54:17,764 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:54:17,765 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:17,777 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:17,784 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 17:54:17,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:54:17,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:54:17,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:54:19,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1800 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:54:19,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:19,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 66] total 99 [2018-02-04 17:54:19,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-02-04 17:54:19,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-02-04 17:54:19,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2178, Invalid=7524, Unknown=0, NotChecked=0, Total=9702 [2018-02-04 17:54:19,209 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 99 states. [2018-02-04 17:54:20,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:20,012 INFO L93 Difference]: Finished difference Result 283 states and 284 transitions. [2018-02-04 17:54:20,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 17:54:20,012 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 265 [2018-02-04 17:54:20,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:20,013 INFO L225 Difference]: With dead ends: 283 [2018-02-04 17:54:20,013 INFO L226 Difference]: Without dead ends: 283 [2018-02-04 17:54:20,015 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6909 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3805, Invalid=13751, Unknown=0, NotChecked=0, Total=17556 [2018-02-04 17:54:20,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-04 17:54:20,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2018-02-04 17:54:20,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-02-04 17:54:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2018-02-04 17:54:20,018 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 265 [2018-02-04 17:54:20,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:20,019 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2018-02-04 17:54:20,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-02-04 17:54:20,019 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2018-02-04 17:54:20,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-02-04 17:54:20,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:20,020 INFO L351 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 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 17:54:20,020 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:20,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1827742452, now seen corresponding path program 23 times [2018-02-04 17:54:20,021 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:20,021 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:20,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:20,021 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:20,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:20,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:20,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2018-02-04 17:54:20,642 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:20,642 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:20,642 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:54:20,674 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2018-02-04 17:54:20,674 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:20,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2018-02-04 17:54:20,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:20,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34] total 37 [2018-02-04 17:54:20,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 17:54:20,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 17:54:20,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=733, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:54:20,742 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 37 states. [2018-02-04 17:54:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:21,186 INFO L93 Difference]: Finished difference Result 291 states and 292 transitions. [2018-02-04 17:54:21,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 17:54:21,187 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 273 [2018-02-04 17:54:21,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:21,188 INFO L225 Difference]: With dead ends: 291 [2018-02-04 17:54:21,188 INFO L226 Difference]: Without dead ends: 291 [2018-02-04 17:54:21,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1720, Invalid=2972, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 17:54:21,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-04 17:54:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2018-02-04 17:54:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-02-04 17:54:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-02-04 17:54:21,192 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 273 [2018-02-04 17:54:21,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:21,193 INFO L432 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-02-04 17:54:21,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 17:54:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-02-04 17:54:21,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-02-04 17:54:21,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:21,194 INFO L351 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 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 17:54:21,194 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:21,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1111845420, now seen corresponding path program 24 times [2018-02-04 17:54:21,195 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:21,195 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:21,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:21,195 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:21,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:21,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2018-02-04 17:54:21,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:21,694 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:21,694 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:54:21,750 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2018-02-04 17:54:21,750 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:21,758 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2018-02-04 17:54:22,150 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:22,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 70 [2018-02-04 17:54:22,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-04 17:54:22,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-04 17:54:22,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1786, Invalid=3044, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 17:54:22,151 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 70 states. [2018-02-04 17:54:22,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:22,387 INFO L93 Difference]: Finished difference Result 299 states and 300 transitions. [2018-02-04 17:54:22,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 17:54:22,387 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 281 [2018-02-04 17:54:22,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:22,388 INFO L225 Difference]: With dead ends: 299 [2018-02-04 17:54:22,388 INFO L226 Difference]: Without dead ends: 299 [2018-02-04 17:54:22,388 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1855, Invalid=3115, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 17:54:22,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-04 17:54:22,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2018-02-04 17:54:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-04 17:54:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-02-04 17:54:22,391 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 281 [2018-02-04 17:54:22,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:22,391 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-02-04 17:54:22,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-04 17:54:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-02-04 17:54:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-02-04 17:54:22,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:22,392 INFO L351 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 33, 33, 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 17:54:22,392 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:22,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1840304564, now seen corresponding path program 25 times [2018-02-04 17:54:22,392 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:22,392 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:22,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:22,392 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:22,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:22,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2018-02-04 17:54:22,864 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:22,864 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:22,865 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:54:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:22,885 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:23,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2018-02-04 17:54:23,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:23,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 72 [2018-02-04 17:54:23,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-02-04 17:54:23,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-02-04 17:54:23,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=3221, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 17:54:23,252 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 72 states. [2018-02-04 17:54:23,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:23,539 INFO L93 Difference]: Finished difference Result 307 states and 308 transitions. [2018-02-04 17:54:23,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 17:54:23,540 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 289 [2018-02-04 17:54:23,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:23,540 INFO L225 Difference]: With dead ends: 307 [2018-02-04 17:54:23,540 INFO L226 Difference]: Without dead ends: 307 [2018-02-04 17:54:23,541 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2275 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1962, Invalid=3294, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 17:54:23,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-02-04 17:54:23,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2018-02-04 17:54:23,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-04 17:54:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-02-04 17:54:23,544 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 289 [2018-02-04 17:54:23,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:23,544 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-02-04 17:54:23,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-02-04 17:54:23,544 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-02-04 17:54:23,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-02-04 17:54:23,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:23,545 INFO L351 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 34, 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 17:54:23,546 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:23,546 INFO L82 PathProgramCache]: Analyzing trace with hash -486648172, now seen corresponding path program 26 times [2018-02-04 17:54:23,546 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:23,546 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:23,547 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:23,547 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:54:23,547 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:23,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2018-02-04 17:54:24,087 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:24,087 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:24,087 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:54:24,108 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:54:24,108 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:24,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2018-02-04 17:54:24,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:24,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37] total 40 [2018-02-04 17:54:24,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 17:54:24,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 17:54:24,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=707, Invalid=853, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 17:54:24,178 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 40 states. [2018-02-04 17:54:24,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:24,657 INFO L93 Difference]: Finished difference Result 315 states and 316 transitions. [2018-02-04 17:54:24,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 17:54:24,657 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 297 [2018-02-04 17:54:24,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:24,658 INFO L225 Difference]: With dead ends: 315 [2018-02-04 17:54:24,658 INFO L226 Difference]: Without dead ends: 315 [2018-02-04 17:54:24,658 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2038, Invalid=3512, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 17:54:24,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-04 17:54:24,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2018-02-04 17:54:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-02-04 17:54:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2018-02-04 17:54:24,661 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 297 [2018-02-04 17:54:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:24,661 INFO L432 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2018-02-04 17:54:24,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 17:54:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2018-02-04 17:54:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-02-04 17:54:24,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:24,662 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 35, 35, 35, 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 17:54:24,662 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:24,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1014127500, now seen corresponding path program 27 times [2018-02-04 17:54:24,662 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:24,662 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:24,662 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:24,663 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:24,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:24,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-02-04 17:54:25,234 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:25,234 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:25,234 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:54:25,274 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-02-04 17:54:25,274 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:25,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-02-04 17:54:25,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:25,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39] total 76 [2018-02-04 17:54:25,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-02-04 17:54:25,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-02-04 17:54:25,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2110, Invalid=3590, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 17:54:25,819 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 76 states. [2018-02-04 17:54:26,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:26,116 INFO L93 Difference]: Finished difference Result 323 states and 324 transitions. [2018-02-04 17:54:26,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 17:54:26,116 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 305 [2018-02-04 17:54:26,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:26,117 INFO L225 Difference]: With dead ends: 323 [2018-02-04 17:54:26,117 INFO L226 Difference]: Without dead ends: 323 [2018-02-04 17:54:26,117 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2553 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2185, Invalid=3667, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 17:54:26,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-02-04 17:54:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2018-02-04 17:54:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-02-04 17:54:26,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2018-02-04 17:54:26,120 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 305 [2018-02-04 17:54:26,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:26,120 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2018-02-04 17:54:26,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-02-04 17:54:26,120 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2018-02-04 17:54:26,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-02-04 17:54:26,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:26,121 INFO L351 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 36, 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 17:54:26,121 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:26,121 INFO L82 PathProgramCache]: Analyzing trace with hash 352926548, now seen corresponding path program 28 times [2018-02-04 17:54:26,121 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:26,121 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:26,122 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:26,122 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:26,122 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:26,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2018-02-04 17:54:26,632 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:26,632 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:26,632 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:54:26,677 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:54:26,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:26,693 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:26,695 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 17:54:26,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:54:26,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:54:26,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:54:28,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2592 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:54:28,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:28,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 78] total 117 [2018-02-04 17:54:28,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-02-04 17:54:28,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-02-04 17:54:28,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3042, Invalid=10530, Unknown=0, NotChecked=0, Total=13572 [2018-02-04 17:54:28,642 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 117 states. [2018-02-04 17:54:29,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:29,665 INFO L93 Difference]: Finished difference Result 331 states and 332 transitions. [2018-02-04 17:54:29,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 17:54:29,665 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 313 [2018-02-04 17:54:29,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:29,666 INFO L225 Difference]: With dead ends: 331 [2018-02-04 17:54:29,666 INFO L226 Difference]: Without dead ends: 331 [2018-02-04 17:54:29,667 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9801 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=5314, Invalid=19178, Unknown=0, NotChecked=0, Total=24492 [2018-02-04 17:54:29,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-04 17:54:29,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2018-02-04 17:54:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-04 17:54:29,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2018-02-04 17:54:29,669 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 313 [2018-02-04 17:54:29,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:29,669 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2018-02-04 17:54:29,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-02-04 17:54:29,669 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2018-02-04 17:54:29,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-02-04 17:54:29,670 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:29,670 INFO L351 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 37, 37, 37, 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 17:54:29,670 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:29,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1557895988, now seen corresponding path program 29 times [2018-02-04 17:54:29,670 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:29,670 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:29,671 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:29,671 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:29,671 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:29,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2018-02-04 17:54:30,220 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:30,220 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:30,220 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:54:30,257 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2018-02-04 17:54:30,258 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:30,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2018-02-04 17:54:30,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:30,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 40] total 43 [2018-02-04 17:54:30,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 17:54:30,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 17:54:30,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=824, Invalid=982, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 17:54:30,327 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 43 states. [2018-02-04 17:54:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:30,886 INFO L93 Difference]: Finished difference Result 339 states and 340 transitions. [2018-02-04 17:54:30,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 17:54:30,886 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 321 [2018-02-04 17:54:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:30,887 INFO L225 Difference]: With dead ends: 339 [2018-02-04 17:54:30,887 INFO L226 Difference]: Without dead ends: 339 [2018-02-04 17:54:30,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2383, Invalid=4097, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 17:54:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-02-04 17:54:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2018-02-04 17:54:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-02-04 17:54:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2018-02-04 17:54:30,889 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 321 [2018-02-04 17:54:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:30,889 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2018-02-04 17:54:30,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 17:54:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2018-02-04 17:54:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-02-04 17:54:30,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:30,890 INFO L351 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 38, 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 17:54:30,890 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:30,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1070644204, now seen corresponding path program 30 times [2018-02-04 17:54:30,890 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:30,890 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:30,891 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:30,891 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:30,891 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:30,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2018-02-04 17:54:31,597 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:31,597 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:31,598 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:54:31,671 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2018-02-04 17:54:31,671 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:31,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:32,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2018-02-04 17:54:32,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:32,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42] total 82 [2018-02-04 17:54:32,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-02-04 17:54:32,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-02-04 17:54:32,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2461, Invalid=4181, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 17:54:32,217 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 82 states. [2018-02-04 17:54:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:32,550 INFO L93 Difference]: Finished difference Result 347 states and 348 transitions. [2018-02-04 17:54:32,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 17:54:32,550 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 329 [2018-02-04 17:54:32,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:32,551 INFO L225 Difference]: With dead ends: 347 [2018-02-04 17:54:32,551 INFO L226 Difference]: Without dead ends: 347 [2018-02-04 17:54:32,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3000 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2542, Invalid=4264, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 17:54:32,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-04 17:54:32,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2018-02-04 17:54:32,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-04 17:54:32,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2018-02-04 17:54:32,554 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 329 [2018-02-04 17:54:32,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:32,555 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2018-02-04 17:54:32,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-02-04 17:54:32,555 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2018-02-04 17:54:32,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-02-04 17:54:32,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:32,557 INFO L351 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 39, 39, 39, 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 17:54:32,557 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:32,557 INFO L82 PathProgramCache]: Analyzing trace with hash 602846708, now seen corresponding path program 31 times [2018-02-04 17:54:32,557 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:32,557 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:32,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:32,558 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:32,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:32,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2018-02-04 17:54:33,174 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:33,174 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:33,175 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:54:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:33,195 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:33,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2018-02-04 17:54:33,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:33,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 84 [2018-02-04 17:54:33,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-02-04 17:54:33,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-02-04 17:54:33,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2584, Invalid=4388, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 17:54:33,723 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 84 states. [2018-02-04 17:54:34,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:34,058 INFO L93 Difference]: Finished difference Result 355 states and 356 transitions. [2018-02-04 17:54:34,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 17:54:34,058 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 337 [2018-02-04 17:54:34,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:34,059 INFO L225 Difference]: With dead ends: 355 [2018-02-04 17:54:34,059 INFO L226 Difference]: Without dead ends: 355 [2018-02-04 17:54:34,059 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3157 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2667, Invalid=4473, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 17:54:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-02-04 17:54:34,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2018-02-04 17:54:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-02-04 17:54:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2018-02-04 17:54:34,061 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 337 [2018-02-04 17:54:34,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:34,061 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2018-02-04 17:54:34,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-02-04 17:54:34,061 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2018-02-04 17:54:34,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-02-04 17:54:34,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:34,062 INFO L351 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 40, 40, 40, 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 17:54:34,063 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:34,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1287942356, now seen corresponding path program 32 times [2018-02-04 17:54:34,063 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:34,063 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:34,063 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:34,063 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:54:34,063 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:34,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 3200 trivial. 0 not checked. [2018-02-04 17:54:34,721 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:34,722 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:34,722 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:54:34,749 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:54:34,749 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:34,756 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 3200 trivial. 0 not checked. [2018-02-04 17:54:34,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:34,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 43] total 46 [2018-02-04 17:54:34,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 17:54:34,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 17:54:34,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=950, Invalid=1120, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 17:54:34,833 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 46 states. [2018-02-04 17:54:35,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:35,600 INFO L93 Difference]: Finished difference Result 363 states and 364 transitions. [2018-02-04 17:54:35,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 17:54:35,600 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 345 [2018-02-04 17:54:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:35,601 INFO L225 Difference]: With dead ends: 363 [2018-02-04 17:54:35,601 INFO L226 Difference]: Without dead ends: 363 [2018-02-04 17:54:35,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2755, Invalid=4727, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 17:54:35,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-02-04 17:54:35,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2018-02-04 17:54:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-04 17:54:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2018-02-04 17:54:35,604 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 345 [2018-02-04 17:54:35,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:35,604 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2018-02-04 17:54:35,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 17:54:35,604 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2018-02-04 17:54:35,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-02-04 17:54:35,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:35,605 INFO L351 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 41, 41, 41, 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 17:54:35,606 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:35,606 INFO L82 PathProgramCache]: Analyzing trace with hash -15010636, now seen corresponding path program 33 times [2018-02-04 17:54:35,606 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:35,606 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:35,606 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:35,606 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:35,606 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:35,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2018-02-04 17:54:36,302 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:36,303 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:36,303 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:54:36,360 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-02-04 17:54:36,360 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:36,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:36,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2018-02-04 17:54:36,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:36,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 44] total 47 [2018-02-04 17:54:36,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 17:54:36,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 17:54:36,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=1168, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 17:54:36,428 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 47 states. [2018-02-04 17:54:37,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:37,075 INFO L93 Difference]: Finished difference Result 371 states and 372 transitions. [2018-02-04 17:54:37,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 17:54:37,075 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 353 [2018-02-04 17:54:37,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:37,076 INFO L225 Difference]: With dead ends: 371 [2018-02-04 17:54:37,076 INFO L226 Difference]: Without dead ends: 371 [2018-02-04 17:54:37,077 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2885, Invalid=4947, Unknown=0, NotChecked=0, Total=7832 [2018-02-04 17:54:37,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-02-04 17:54:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 367. [2018-02-04 17:54:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-02-04 17:54:37,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2018-02-04 17:54:37,079 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 353 [2018-02-04 17:54:37,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:37,079 INFO L432 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2018-02-04 17:54:37,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 17:54:37,079 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2018-02-04 17:54:37,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-02-04 17:54:37,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:37,081 INFO L351 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 42, 42, 42, 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 17:54:37,081 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:37,081 INFO L82 PathProgramCache]: Analyzing trace with hash 521978260, now seen corresponding path program 34 times [2018-02-04 17:54:37,081 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:37,081 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:37,082 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:37,082 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:37,082 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:37,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:37,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2018-02-04 17:54:37,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:37,823 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:37,824 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:54:37,887 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:54:37,887 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:37,908 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:37,914 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 17:54:37,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:54:37,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:54:37,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:54:40,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 3528 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:54:40,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:40,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 90] total 135 [2018-02-04 17:54:40,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-02-04 17:54:40,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-02-04 17:54:40,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4050, Invalid=14040, Unknown=0, NotChecked=0, Total=18090 [2018-02-04 17:54:40,246 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 135 states. [2018-02-04 17:54:41,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:41,561 INFO L93 Difference]: Finished difference Result 379 states and 380 transitions. [2018-02-04 17:54:41,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 17:54:41,561 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 361 [2018-02-04 17:54:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:41,562 INFO L225 Difference]: With dead ends: 379 [2018-02-04 17:54:41,562 INFO L226 Difference]: Without dead ends: 379 [2018-02-04 17:54:41,562 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13197 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=7075, Invalid=25505, Unknown=0, NotChecked=0, Total=32580 [2018-02-04 17:54:41,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-02-04 17:54:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 375. [2018-02-04 17:54:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-04 17:54:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 376 transitions. [2018-02-04 17:54:41,565 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 376 transitions. Word has length 361 [2018-02-04 17:54:41,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:41,565 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 376 transitions. [2018-02-04 17:54:41,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-02-04 17:54:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 376 transitions. [2018-02-04 17:54:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-02-04 17:54:41,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:41,566 INFO L351 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 43, 43, 43, 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 17:54:41,566 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:41,566 INFO L82 PathProgramCache]: Analyzing trace with hash -793487500, now seen corresponding path program 35 times [2018-02-04 17:54:41,567 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:41,567 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:41,567 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:41,567 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:41,567 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:41,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2018-02-04 17:54:42,283 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:42,283 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:42,284 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:54:42,334 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 44 check-sat command(s) [2018-02-04 17:54:42,334 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:42,341 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2018-02-04 17:54:42,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:42,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 46] total 49 [2018-02-04 17:54:42,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 17:54:42,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 17:54:42,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1085, Invalid=1267, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 17:54:42,390 INFO L87 Difference]: Start difference. First operand 375 states and 376 transitions. Second operand 49 states. [2018-02-04 17:54:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:43,042 INFO L93 Difference]: Finished difference Result 387 states and 388 transitions. [2018-02-04 17:54:43,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 17:54:43,042 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 369 [2018-02-04 17:54:43,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:43,043 INFO L225 Difference]: With dead ends: 387 [2018-02-04 17:54:43,043 INFO L226 Difference]: Without dead ends: 387 [2018-02-04 17:54:43,043 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=3154, Invalid=5402, Unknown=0, NotChecked=0, Total=8556 [2018-02-04 17:54:43,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-04 17:54:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2018-02-04 17:54:43,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-04 17:54:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2018-02-04 17:54:43,045 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 369 [2018-02-04 17:54:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:43,046 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2018-02-04 17:54:43,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 17:54:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2018-02-04 17:54:43,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-02-04 17:54:43,047 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:43,047 INFO L351 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 44, 44, 44, 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 17:54:43,047 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:43,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1752418732, now seen corresponding path program 36 times [2018-02-04 17:54:43,047 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:43,047 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:43,047 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:43,048 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:43,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:43,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2018-02-04 17:54:43,830 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:43,830 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:43,831 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:54:43,890 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 45 check-sat command(s) [2018-02-04 17:54:43,891 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:43,904 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2018-02-04 17:54:43,954 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:43,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 47] total 50 [2018-02-04 17:54:43,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 17:54:43,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 17:54:43,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1132, Invalid=1318, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 17:54:43,955 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 50 states. [2018-02-04 17:54:44,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:44,633 INFO L93 Difference]: Finished difference Result 395 states and 396 transitions. [2018-02-04 17:54:44,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 17:54:44,633 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 377 [2018-02-04 17:54:44,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:44,634 INFO L225 Difference]: With dead ends: 395 [2018-02-04 17:54:44,634 INFO L226 Difference]: Without dead ends: 395 [2018-02-04 17:54:44,634 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3293, Invalid=5637, Unknown=0, NotChecked=0, Total=8930 [2018-02-04 17:54:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-02-04 17:54:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2018-02-04 17:54:44,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-02-04 17:54:44,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 392 transitions. [2018-02-04 17:54:44,636 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 392 transitions. Word has length 377 [2018-02-04 17:54:44,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:44,637 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 392 transitions. [2018-02-04 17:54:44,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 17:54:44,637 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 392 transitions. [2018-02-04 17:54:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-02-04 17:54:44,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:44,638 INFO L351 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 45, 45, 45, 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 17:54:44,638 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:44,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1997463092, now seen corresponding path program 37 times [2018-02-04 17:54:44,638 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:44,638 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:44,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:44,638 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:44,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:44,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:45,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2018-02-04 17:54:45,438 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:45,438 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:45,438 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:54:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:45,462 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2018-02-04 17:54:46,102 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:46,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49] total 96 [2018-02-04 17:54:46,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-02-04 17:54:46,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-02-04 17:54:46,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3385, Invalid=5735, Unknown=0, NotChecked=0, Total=9120 [2018-02-04 17:54:46,104 INFO L87 Difference]: Start difference. First operand 391 states and 392 transitions. Second operand 96 states. [2018-02-04 17:54:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:46,507 INFO L93 Difference]: Finished difference Result 403 states and 404 transitions. [2018-02-04 17:54:46,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 17:54:46,507 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 385 [2018-02-04 17:54:46,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:46,508 INFO L225 Difference]: With dead ends: 403 [2018-02-04 17:54:46,508 INFO L226 Difference]: Without dead ends: 403 [2018-02-04 17:54:46,508 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 339 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4183 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3480, Invalid=5832, Unknown=0, NotChecked=0, Total=9312 [2018-02-04 17:54:46,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-02-04 17:54:46,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 399. [2018-02-04 17:54:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-04 17:54:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2018-02-04 17:54:46,511 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 385 [2018-02-04 17:54:46,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:46,511 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2018-02-04 17:54:46,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-02-04 17:54:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2018-02-04 17:54:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-02-04 17:54:46,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:46,513 INFO L351 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 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 17:54:46,513 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:46,513 INFO L82 PathProgramCache]: Analyzing trace with hash 308727572, now seen corresponding path program 38 times [2018-02-04 17:54:46,513 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:46,513 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:46,514 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:46,514 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:54:46,514 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:46,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:47,319 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2018-02-04 17:54:47,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:47,319 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:47,320 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:54:47,351 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:54:47,352 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:47,359 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:47,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2018-02-04 17:54:47,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:47,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 49] total 52 [2018-02-04 17:54:47,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 17:54:47,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 17:54:47,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1229, Invalid=1423, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 17:54:47,424 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 52 states. [2018-02-04 17:54:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:48,179 INFO L93 Difference]: Finished difference Result 411 states and 412 transitions. [2018-02-04 17:54:48,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 17:54:48,179 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 393 [2018-02-04 17:54:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:48,180 INFO L225 Difference]: With dead ends: 411 [2018-02-04 17:54:48,180 INFO L226 Difference]: Without dead ends: 411 [2018-02-04 17:54:48,180 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3580, Invalid=6122, Unknown=0, NotChecked=0, Total=9702 [2018-02-04 17:54:48,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-02-04 17:54:48,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2018-02-04 17:54:48,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-02-04 17:54:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 408 transitions. [2018-02-04 17:54:48,182 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 408 transitions. Word has length 393 [2018-02-04 17:54:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:48,182 INFO L432 AbstractCegarLoop]: Abstraction has 407 states and 408 transitions. [2018-02-04 17:54:48,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 17:54:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 408 transitions. [2018-02-04 17:54:48,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-02-04 17:54:48,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:48,183 INFO L351 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 47, 47, 47, 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 17:54:48,184 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:48,184 INFO L82 PathProgramCache]: Analyzing trace with hash -864122636, now seen corresponding path program 39 times [2018-02-04 17:54:48,184 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:48,184 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:48,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:48,184 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:48,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:48,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:49,070 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2018-02-04 17:54:49,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:49,070 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:49,070 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:54:49,130 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-02-04 17:54:49,131 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:49,144 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:49,847 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2018-02-04 17:54:49,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:49,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51] total 100 [2018-02-04 17:54:49,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-02-04 17:54:49,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-02-04 17:54:49,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3676, Invalid=6224, Unknown=0, NotChecked=0, Total=9900 [2018-02-04 17:54:49,848 INFO L87 Difference]: Start difference. First operand 407 states and 408 transitions. Second operand 100 states. [2018-02-04 17:54:50,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:50,227 INFO L93 Difference]: Finished difference Result 419 states and 420 transitions. [2018-02-04 17:54:50,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 17:54:50,227 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 401 [2018-02-04 17:54:50,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:50,228 INFO L225 Difference]: With dead ends: 419 [2018-02-04 17:54:50,228 INFO L226 Difference]: Without dead ends: 419 [2018-02-04 17:54:50,228 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 353 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4557 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3775, Invalid=6325, Unknown=0, NotChecked=0, Total=10100 [2018-02-04 17:54:50,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-02-04 17:54:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 415. [2018-02-04 17:54:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-02-04 17:54:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2018-02-04 17:54:50,230 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 401 [2018-02-04 17:54:50,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:50,230 INFO L432 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2018-02-04 17:54:50,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-02-04 17:54:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2018-02-04 17:54:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-02-04 17:54:50,231 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:50,231 INFO L351 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 48, 48, 48, 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 17:54:50,231 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:50,231 INFO L82 PathProgramCache]: Analyzing trace with hash -402617388, now seen corresponding path program 40 times [2018-02-04 17:54:50,231 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:50,231 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:50,232 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:50,232 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:50,232 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:50,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:51,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2018-02-04 17:54:51,150 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:51,150 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:51,150 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:54:51,228 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:54:51,228 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:51,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:51,259 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 17:54:51,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:54:51,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:54:51,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:54:54,131 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 4608 proven. 4608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:54:54,132 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:54,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 102] total 153 [2018-02-04 17:54:54,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-02-04 17:54:54,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-02-04 17:54:54,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5202, Invalid=18054, Unknown=0, NotChecked=0, Total=23256 [2018-02-04 17:54:54,133 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 153 states. [2018-02-04 17:54:55,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:55,703 INFO L93 Difference]: Finished difference Result 427 states and 428 transitions. [2018-02-04 17:54:55,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 17:54:55,704 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 409 [2018-02-04 17:54:55,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:55,704 INFO L225 Difference]: With dead ends: 427 [2018-02-04 17:54:55,704 INFO L226 Difference]: Without dead ends: 427 [2018-02-04 17:54:55,705 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17097 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=9088, Invalid=32732, Unknown=0, NotChecked=0, Total=41820 [2018-02-04 17:54:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-02-04 17:54:55,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 423. [2018-02-04 17:54:55,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-02-04 17:54:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 424 transitions. [2018-02-04 17:54:55,707 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 424 transitions. Word has length 409 [2018-02-04 17:54:55,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:55,707 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 424 transitions. [2018-02-04 17:54:55,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-02-04 17:54:55,707 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 424 transitions. [2018-02-04 17:54:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-02-04 17:54:55,708 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:55,708 INFO L351 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 49, 49, 49, 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 17:54:55,708 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:55,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1487448140, now seen corresponding path program 41 times [2018-02-04 17:54:55,709 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:55,709 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:55,709 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:55,709 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:55,709 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:55,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 4802 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2018-02-04 17:54:56,655 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:56,655 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:56,656 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:54:56,712 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2018-02-04 17:54:56,712 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:56,719 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 4802 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2018-02-04 17:54:56,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:56,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 52] total 55 [2018-02-04 17:54:56,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 17:54:56,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 17:54:56,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1382, Invalid=1588, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 17:54:56,799 INFO L87 Difference]: Start difference. First operand 423 states and 424 transitions. Second operand 55 states. [2018-02-04 17:54:57,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:54:57,651 INFO L93 Difference]: Finished difference Result 435 states and 436 transitions. [2018-02-04 17:54:57,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 17:54:57,651 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 417 [2018-02-04 17:54:57,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:54:57,652 INFO L225 Difference]: With dead ends: 435 [2018-02-04 17:54:57,652 INFO L226 Difference]: Without dead ends: 435 [2018-02-04 17:54:57,653 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=4033, Invalid=6887, Unknown=0, NotChecked=0, Total=10920 [2018-02-04 17:54:57,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-02-04 17:54:57,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2018-02-04 17:54:57,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-02-04 17:54:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2018-02-04 17:54:57,654 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 417 [2018-02-04 17:54:57,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:54:57,655 INFO L432 AbstractCegarLoop]: Abstraction has 431 states and 432 transitions. [2018-02-04 17:54:57,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 17:54:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 432 transitions. [2018-02-04 17:54:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-02-04 17:54:57,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:54:57,656 INFO L351 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 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 17:54:57,656 INFO L371 AbstractCegarLoop]: === Iteration 56 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:54:57,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1823304852, now seen corresponding path program 42 times [2018-02-04 17:54:57,656 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:54:57,656 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:54:57,656 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:57,657 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:54:57,657 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:54:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:54:57,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:54:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2018-02-04 17:54:58,633 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:54:58,633 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:54:58,634 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:54:58,703 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2018-02-04 17:54:58,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:54:58,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:54:59,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2018-02-04 17:54:59,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:54:59,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54] total 106 [2018-02-04 17:54:59,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-02-04 17:54:59,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-02-04 17:54:59,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4135, Invalid=6995, Unknown=0, NotChecked=0, Total=11130 [2018-02-04 17:54:59,532 INFO L87 Difference]: Start difference. First operand 431 states and 432 transitions. Second operand 106 states. [2018-02-04 17:55:00,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:55:00,067 INFO L93 Difference]: Finished difference Result 443 states and 444 transitions. [2018-02-04 17:55:00,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 17:55:00,067 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 425 [2018-02-04 17:55:00,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:55:00,068 INFO L225 Difference]: With dead ends: 443 [2018-02-04 17:55:00,068 INFO L226 Difference]: Without dead ends: 443 [2018-02-04 17:55:00,069 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5148 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=4240, Invalid=7102, Unknown=0, NotChecked=0, Total=11342 [2018-02-04 17:55:00,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-02-04 17:55:00,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2018-02-04 17:55:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-02-04 17:55:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2018-02-04 17:55:00,071 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 425 [2018-02-04 17:55:00,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:55:00,071 INFO L432 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2018-02-04 17:55:00,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-02-04 17:55:00,071 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2018-02-04 17:55:00,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-02-04 17:55:00,072 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:55:00,073 INFO L351 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 51, 51, 51, 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 17:55:00,073 INFO L371 AbstractCegarLoop]: === Iteration 57 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:55:00,073 INFO L82 PathProgramCache]: Analyzing trace with hash -638760332, now seen corresponding path program 43 times [2018-02-04 17:55:00,073 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:55:00,073 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:55:00,073 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:00,073 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:55:00,074 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:55:00,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:55:01,170 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 5202 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2018-02-04 17:55:01,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:55:01,170 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:55:01,171 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:55:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:55:01,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:55:02,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 5202 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2018-02-04 17:55:02,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:55:02,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55] total 108 [2018-02-04 17:55:02,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-02-04 17:55:02,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-02-04 17:55:02,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4294, Invalid=7262, Unknown=0, NotChecked=0, Total=11556 [2018-02-04 17:55:02,127 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 108 states. [2018-02-04 17:55:02,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:55:02,693 INFO L93 Difference]: Finished difference Result 451 states and 452 transitions. [2018-02-04 17:55:02,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 17:55:02,693 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 433 [2018-02-04 17:55:02,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:55:02,694 INFO L225 Difference]: With dead ends: 451 [2018-02-04 17:55:02,694 INFO L226 Difference]: Without dead ends: 451 [2018-02-04 17:55:02,695 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 381 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5353 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4401, Invalid=7371, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 17:55:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-04 17:55:02,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 447. [2018-02-04 17:55:02,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-02-04 17:55:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 448 transitions. [2018-02-04 17:55:02,697 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 448 transitions. Word has length 433 [2018-02-04 17:55:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:55:02,697 INFO L432 AbstractCegarLoop]: Abstraction has 447 states and 448 transitions. [2018-02-04 17:55:02,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-02-04 17:55:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 448 transitions. [2018-02-04 17:55:02,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-02-04 17:55:02,698 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:55:02,699 INFO L351 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 52, 52, 52, 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 17:55:02,699 INFO L371 AbstractCegarLoop]: === Iteration 58 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:55:02,699 INFO L82 PathProgramCache]: Analyzing trace with hash -255757996, now seen corresponding path program 44 times [2018-02-04 17:55:02,699 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:55:02,699 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:55:02,699 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:02,699 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:55:02,699 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:55:02,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:55:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 5408 refuted. 0 times theorem prover too weak. 5408 trivial. 0 not checked. [2018-02-04 17:55:03,789 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:55:03,789 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:55:03,790 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:55:03,826 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:55:03,826 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:55:03,833 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:55:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 5408 refuted. 0 times theorem prover too weak. 5408 trivial. 0 not checked. [2018-02-04 17:55:03,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:55:03,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 55] total 58 [2018-02-04 17:55:03,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 17:55:03,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 17:55:03,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1544, Invalid=1762, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 17:55:03,900 INFO L87 Difference]: Start difference. First operand 447 states and 448 transitions. Second operand 58 states. [2018-02-04 17:55:04,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:55:04,820 INFO L93 Difference]: Finished difference Result 459 states and 460 transitions. [2018-02-04 17:55:04,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 17:55:04,820 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 441 [2018-02-04 17:55:04,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:55:04,821 INFO L225 Difference]: With dead ends: 459 [2018-02-04 17:55:04,821 INFO L226 Difference]: Without dead ends: 459 [2018-02-04 17:55:04,821 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 494 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1583 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=4513, Invalid=7697, Unknown=0, NotChecked=0, Total=12210 [2018-02-04 17:55:04,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-02-04 17:55:04,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2018-02-04 17:55:04,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-02-04 17:55:04,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 456 transitions. [2018-02-04 17:55:04,824 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 456 transitions. Word has length 441 [2018-02-04 17:55:04,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:55:04,824 INFO L432 AbstractCegarLoop]: Abstraction has 455 states and 456 transitions. [2018-02-04 17:55:04,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 17:55:04,824 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 456 transitions. [2018-02-04 17:55:04,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-02-04 17:55:04,825 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:55:04,825 INFO L351 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 53, 53, 53, 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 17:55:04,825 INFO L371 AbstractCegarLoop]: === Iteration 59 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:55:04,825 INFO L82 PathProgramCache]: Analyzing trace with hash 848585012, now seen corresponding path program 45 times [2018-02-04 17:55:04,825 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:55:04,825 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:55:04,826 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:04,826 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:55:04,826 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:55:04,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:55:05,935 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2018-02-04 17:55:05,936 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:55:05,936 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:55:05,936 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:55:06,009 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-02-04 17:55:06,009 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:55:06,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:55:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2018-02-04 17:55:06,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:55:06,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 56] total 59 [2018-02-04 17:55:06,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 17:55:06,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 17:55:06,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1600, Invalid=1822, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 17:55:06,106 INFO L87 Difference]: Start difference. First operand 455 states and 456 transitions. Second operand 59 states. [2018-02-04 17:55:07,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:55:07,069 INFO L93 Difference]: Finished difference Result 467 states and 468 transitions. [2018-02-04 17:55:07,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 17:55:07,069 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 449 [2018-02-04 17:55:07,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:55:07,070 INFO L225 Difference]: With dead ends: 467 [2018-02-04 17:55:07,070 INFO L226 Difference]: Without dead ends: 467 [2018-02-04 17:55:07,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=4679, Invalid=7977, Unknown=0, NotChecked=0, Total=12656 [2018-02-04 17:55:07,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-02-04 17:55:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 463. [2018-02-04 17:55:07,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-02-04 17:55:07,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 464 transitions. [2018-02-04 17:55:07,073 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 464 transitions. Word has length 449 [2018-02-04 17:55:07,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:55:07,073 INFO L432 AbstractCegarLoop]: Abstraction has 463 states and 464 transitions. [2018-02-04 17:55:07,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 17:55:07,073 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 464 transitions. [2018-02-04 17:55:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-02-04 17:55:07,075 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:55:07,075 INFO L351 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 54, 54, 54, 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 17:55:07,075 INFO L371 AbstractCegarLoop]: === Iteration 60 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:55:07,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1064265196, now seen corresponding path program 46 times [2018-02-04 17:55:07,075 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:55:07,075 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:55:07,076 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:07,076 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:55:07,076 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:55:07,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:55:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2018-02-04 17:55:08,251 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:55:08,251 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:55:08,251 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:55:08,356 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:55:08,356 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:55:08,399 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:55:08,401 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 17:55:08,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:55:08,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:55:08,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:55:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 5832 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:55:11,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:55:11,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 114] total 171 [2018-02-04 17:55:11,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-02-04 17:55:11,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-02-04 17:55:11,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6498, Invalid=22572, Unknown=0, NotChecked=0, Total=29070 [2018-02-04 17:55:11,948 INFO L87 Difference]: Start difference. First operand 463 states and 464 transitions. Second operand 171 states. [2018-02-04 17:55:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:55:13,854 INFO L93 Difference]: Finished difference Result 475 states and 476 transitions. [2018-02-04 17:55:13,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 17:55:13,855 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 457 [2018-02-04 17:55:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:55:13,855 INFO L225 Difference]: With dead ends: 475 [2018-02-04 17:55:13,855 INFO L226 Difference]: Without dead ends: 475 [2018-02-04 17:55:13,856 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21501 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=11353, Invalid=40859, Unknown=0, NotChecked=0, Total=52212 [2018-02-04 17:55:13,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-02-04 17:55:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 471. [2018-02-04 17:55:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-02-04 17:55:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 472 transitions. [2018-02-04 17:55:13,858 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 472 transitions. Word has length 457 [2018-02-04 17:55:13,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:55:13,858 INFO L432 AbstractCegarLoop]: Abstraction has 471 states and 472 transitions. [2018-02-04 17:55:13,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-02-04 17:55:13,858 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 472 transitions. [2018-02-04 17:55:13,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-02-04 17:55:13,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:55:13,860 INFO L351 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 55, 55, 55, 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 17:55:13,860 INFO L371 AbstractCegarLoop]: === Iteration 61 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:55:13,860 INFO L82 PathProgramCache]: Analyzing trace with hash 2074123252, now seen corresponding path program 47 times [2018-02-04 17:55:13,860 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:55:13,860 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:55:13,861 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:13,861 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:55:13,861 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:55:13,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:55:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 6050 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2018-02-04 17:55:15,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:55:15,085 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:55:15,085 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:55:15,174 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 56 check-sat command(s) [2018-02-04 17:55:15,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:55:15,183 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:55:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 6050 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2018-02-04 17:55:15,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:55:15,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 58] total 61 [2018-02-04 17:55:15,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 17:55:15,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 17:55:15,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1715, Invalid=1945, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:55:15,275 INFO L87 Difference]: Start difference. First operand 471 states and 472 transitions. Second operand 61 states. [2018-02-04 17:55:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:55:16,273 INFO L93 Difference]: Finished difference Result 483 states and 484 transitions. [2018-02-04 17:55:16,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 17:55:16,273 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 465 [2018-02-04 17:55:16,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:55:16,274 INFO L225 Difference]: With dead ends: 483 [2018-02-04 17:55:16,274 INFO L226 Difference]: Without dead ends: 483 [2018-02-04 17:55:16,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1757 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=5020, Invalid=8552, Unknown=0, NotChecked=0, Total=13572 [2018-02-04 17:55:16,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-02-04 17:55:16,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 479. [2018-02-04 17:55:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-02-04 17:55:16,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 480 transitions. [2018-02-04 17:55:16,276 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 480 transitions. Word has length 465 [2018-02-04 17:55:16,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:55:16,277 INFO L432 AbstractCegarLoop]: Abstraction has 479 states and 480 transitions. [2018-02-04 17:55:16,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 17:55:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 480 transitions. [2018-02-04 17:55:16,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2018-02-04 17:55:16,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:55:16,278 INFO L351 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 56, 56, 56, 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 17:55:16,278 INFO L371 AbstractCegarLoop]: === Iteration 62 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:55:16,278 INFO L82 PathProgramCache]: Analyzing trace with hash 611247828, now seen corresponding path program 48 times [2018-02-04 17:55:16,278 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:55:16,278 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:55:16,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:16,279 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:55:16,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:55:16,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:55:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2018-02-04 17:55:17,514 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:55:17,514 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:55:17,515 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:55:17,611 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 57 check-sat command(s) [2018-02-04 17:55:17,611 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:55:17,629 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:55:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2018-02-04 17:55:17,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:55:17,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 59] total 62 [2018-02-04 17:55:17,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 17:55:17,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 17:55:17,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1774, Invalid=2008, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 17:55:17,702 INFO L87 Difference]: Start difference. First operand 479 states and 480 transitions. Second operand 62 states. [2018-02-04 17:55:18,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:55:18,746 INFO L93 Difference]: Finished difference Result 491 states and 492 transitions. [2018-02-04 17:55:18,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 17:55:18,746 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 473 [2018-02-04 17:55:18,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:55:18,747 INFO L225 Difference]: With dead ends: 491 [2018-02-04 17:55:18,747 INFO L226 Difference]: Without dead ends: 491 [2018-02-04 17:55:18,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=5195, Invalid=8847, Unknown=0, NotChecked=0, Total=14042 [2018-02-04 17:55:18,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-02-04 17:55:18,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 487. [2018-02-04 17:55:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-02-04 17:55:18,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 488 transitions. [2018-02-04 17:55:18,750 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 488 transitions. Word has length 473 [2018-02-04 17:55:18,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:55:18,750 INFO L432 AbstractCegarLoop]: Abstraction has 487 states and 488 transitions. [2018-02-04 17:55:18,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 17:55:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 488 transitions. [2018-02-04 17:55:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-02-04 17:55:18,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:55:18,752 INFO L351 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 57, 57, 57, 57, 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 17:55:18,752 INFO L371 AbstractCegarLoop]: === Iteration 63 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:55:18,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2070280884, now seen corresponding path program 49 times [2018-02-04 17:55:18,752 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:55:18,752 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:55:18,752 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:18,752 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:55:18,752 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:55:18,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:55:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 6498 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2018-02-04 17:55:20,080 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:55:20,080 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:55:20,081 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:55:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:55:20,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:55:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 6498 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2018-02-04 17:55:21,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:55:21,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61] total 120 [2018-02-04 17:55:21,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-02-04 17:55:21,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-02-04 17:55:21,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5311, Invalid=8969, Unknown=0, NotChecked=0, Total=14280 [2018-02-04 17:55:21,149 INFO L87 Difference]: Start difference. First operand 487 states and 488 transitions. Second operand 120 states. [2018-02-04 17:55:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:55:21,776 INFO L93 Difference]: Finished difference Result 499 states and 500 transitions. [2018-02-04 17:55:21,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 17:55:21,776 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 481 [2018-02-04 17:55:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:55:21,777 INFO L225 Difference]: With dead ends: 499 [2018-02-04 17:55:21,777 INFO L226 Difference]: Without dead ends: 499 [2018-02-04 17:55:21,778 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 423 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6667 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5430, Invalid=9090, Unknown=0, NotChecked=0, Total=14520 [2018-02-04 17:55:21,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-02-04 17:55:21,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 495. [2018-02-04 17:55:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2018-02-04 17:55:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 496 transitions. [2018-02-04 17:55:21,780 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 496 transitions. Word has length 481 [2018-02-04 17:55:21,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:55:21,780 INFO L432 AbstractCegarLoop]: Abstraction has 495 states and 496 transitions. [2018-02-04 17:55:21,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-02-04 17:55:21,780 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 496 transitions. [2018-02-04 17:55:21,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2018-02-04 17:55:21,781 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:55:21,782 INFO L351 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 58, 58, 58, 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 17:55:21,782 INFO L371 AbstractCegarLoop]: === Iteration 64 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:55:21,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1622169492, now seen corresponding path program 50 times [2018-02-04 17:55:21,782 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:55:21,782 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:55:21,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:21,782 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:55:21,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:55:21,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:55:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 0 proven. 6728 refuted. 0 times theorem prover too weak. 6728 trivial. 0 not checked. [2018-02-04 17:55:23,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:55:23,154 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:55:23,155 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:55:23,197 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:55:23,197 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:55:23,210 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:55:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 0 proven. 6728 refuted. 0 times theorem prover too weak. 6728 trivial. 0 not checked. [2018-02-04 17:55:23,289 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:55:23,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 61] total 64 [2018-02-04 17:55:23,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-04 17:55:23,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-04 17:55:23,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1895, Invalid=2137, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 17:55:23,290 INFO L87 Difference]: Start difference. First operand 495 states and 496 transitions. Second operand 64 states. [2018-02-04 17:55:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:55:24,384 INFO L93 Difference]: Finished difference Result 507 states and 508 transitions. [2018-02-04 17:55:24,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 17:55:24,384 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 489 [2018-02-04 17:55:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:55:24,385 INFO L225 Difference]: With dead ends: 507 [2018-02-04 17:55:24,386 INFO L226 Difference]: Without dead ends: 507 [2018-02-04 17:55:24,386 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 548 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1940 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=5554, Invalid=9452, Unknown=0, NotChecked=0, Total=15006 [2018-02-04 17:55:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-02-04 17:55:24,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 503. [2018-02-04 17:55:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-02-04 17:55:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 504 transitions. [2018-02-04 17:55:24,389 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 504 transitions. Word has length 489 [2018-02-04 17:55:24,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:55:24,389 INFO L432 AbstractCegarLoop]: Abstraction has 503 states and 504 transitions. [2018-02-04 17:55:24,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-02-04 17:55:24,389 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 504 transitions. [2018-02-04 17:55:24,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-02-04 17:55:24,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:55:24,390 INFO L351 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 59, 59, 59, 59, 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 17:55:24,390 INFO L371 AbstractCegarLoop]: === Iteration 65 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:55:24,391 INFO L82 PathProgramCache]: Analyzing trace with hash -197624460, now seen corresponding path program 51 times [2018-02-04 17:55:24,391 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:55:24,391 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:55:24,391 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:24,391 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:55:24,391 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:55:24,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:55:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 13924 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2018-02-04 17:55:25,760 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:55:25,760 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:55:25,760 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:55:25,843 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-02-04 17:55:25,843 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:55:25,879 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:55:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 13924 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2018-02-04 17:55:26,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:55:26,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63] total 124 [2018-02-04 17:55:26,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-02-04 17:55:26,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-02-04 17:55:26,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5674, Invalid=9578, Unknown=0, NotChecked=0, Total=15252 [2018-02-04 17:55:26,949 INFO L87 Difference]: Start difference. First operand 503 states and 504 transitions. Second operand 124 states. [2018-02-04 17:55:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:55:27,575 INFO L93 Difference]: Finished difference Result 515 states and 516 transitions. [2018-02-04 17:55:27,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 17:55:27,575 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 497 [2018-02-04 17:55:27,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:55:27,576 INFO L225 Difference]: With dead ends: 515 [2018-02-04 17:55:27,576 INFO L226 Difference]: Without dead ends: 515 [2018-02-04 17:55:27,577 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 437 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7137 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5797, Invalid=9703, Unknown=0, NotChecked=0, Total=15500 [2018-02-04 17:55:27,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-02-04 17:55:27,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 511. [2018-02-04 17:55:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-02-04 17:55:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 512 transitions. [2018-02-04 17:55:27,579 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 512 transitions. Word has length 497 [2018-02-04 17:55:27,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:55:27,579 INFO L432 AbstractCegarLoop]: Abstraction has 511 states and 512 transitions. [2018-02-04 17:55:27,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-02-04 17:55:27,579 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 512 transitions. [2018-02-04 17:55:27,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-02-04 17:55:27,581 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:55:27,581 INFO L351 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 60, 60, 60, 60, 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 17:55:27,581 INFO L371 AbstractCegarLoop]: === Iteration 66 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:55:27,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1247220652, now seen corresponding path program 52 times [2018-02-04 17:55:27,581 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:55:27,581 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:55:27,582 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:27,582 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:55:27,582 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:55:27,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:55:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 14400 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2018-02-04 17:55:29,014 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:55:29,014 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:55:29,015 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:55:29,137 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:55:29,137 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:55:29,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:55:29,191 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 17:55:29,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:55:29,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:55:29,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:55:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 14400 backedges. 7200 proven. 7200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:55:33,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:55:33,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 126] total 189 [2018-02-04 17:55:33,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-02-04 17:55:33,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-02-04 17:55:33,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7938, Invalid=27594, Unknown=0, NotChecked=0, Total=35532 [2018-02-04 17:55:33,614 INFO L87 Difference]: Start difference. First operand 511 states and 512 transitions. Second operand 189 states. [2018-02-04 17:55:35,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:55:35,891 INFO L93 Difference]: Finished difference Result 523 states and 524 transitions. [2018-02-04 17:55:35,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 17:55:35,891 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 505 [2018-02-04 17:55:35,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:55:35,892 INFO L225 Difference]: With dead ends: 523 [2018-02-04 17:55:35,893 INFO L226 Difference]: Without dead ends: 523 [2018-02-04 17:55:35,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 382 SyntacticMatches, 1 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26409 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=13870, Invalid=49886, Unknown=0, NotChecked=0, Total=63756 [2018-02-04 17:55:35,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-02-04 17:55:35,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 519. [2018-02-04 17:55:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-02-04 17:55:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 520 transitions. [2018-02-04 17:55:35,897 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 520 transitions. Word has length 505 [2018-02-04 17:55:35,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:55:35,897 INFO L432 AbstractCegarLoop]: Abstraction has 519 states and 520 transitions. [2018-02-04 17:55:35,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-02-04 17:55:35,897 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 520 transitions. [2018-02-04 17:55:35,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2018-02-04 17:55:35,899 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:55:35,899 INFO L351 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 61, 61, 61, 61, 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 17:55:35,899 INFO L371 AbstractCegarLoop]: === Iteration 67 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:55:35,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1536416716, now seen corresponding path program 53 times [2018-02-04 17:55:35,899 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:55:35,899 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:55:35,899 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:35,899 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:55:35,900 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:55:35,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:55:37,520 INFO L134 CoverageAnalysis]: Checked inductivity of 14884 backedges. 0 proven. 7442 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2018-02-04 17:55:37,521 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:55:37,521 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:55:37,521 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:55:37,665 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 62 check-sat command(s) [2018-02-04 17:55:37,665 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:55:37,675 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:55:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 14884 backedges. 0 proven. 7442 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2018-02-04 17:55:37,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:55:37,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 64] total 67 [2018-02-04 17:55:37,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 17:55:37,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 17:55:37,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2084, Invalid=2338, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 17:55:37,764 INFO L87 Difference]: Start difference. First operand 519 states and 520 transitions. Second operand 67 states. [2018-02-04 17:55:38,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:55:38,993 INFO L93 Difference]: Finished difference Result 531 states and 532 transitions. [2018-02-04 17:55:38,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 17:55:38,993 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 513 [2018-02-04 17:55:38,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:55:38,994 INFO L225 Difference]: With dead ends: 531 [2018-02-04 17:55:38,994 INFO L226 Difference]: Without dead ends: 531 [2018-02-04 17:55:38,995 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 702 GetRequests, 575 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=6115, Invalid=10397, Unknown=0, NotChecked=0, Total=16512 [2018-02-04 17:55:38,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-02-04 17:55:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 527. [2018-02-04 17:55:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-02-04 17:55:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 528 transitions. [2018-02-04 17:55:38,997 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 528 transitions. Word has length 513 [2018-02-04 17:55:38,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:55:38,997 INFO L432 AbstractCegarLoop]: Abstraction has 527 states and 528 transitions. [2018-02-04 17:55:38,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 17:55:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 528 transitions. [2018-02-04 17:55:38,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2018-02-04 17:55:38,999 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:55:38,999 INFO L351 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 62, 62, 62, 62, 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 17:55:38,999 INFO L371 AbstractCegarLoop]: === Iteration 68 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:55:38,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1605149972, now seen corresponding path program 54 times [2018-02-04 17:55:39,000 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:55:39,000 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:55:39,000 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:39,000 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:55:39,000 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:55:39,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:55:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2018-02-04 17:55:40,615 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:55:40,615 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:55:40,616 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:55:40,748 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 63 check-sat command(s) [2018-02-04 17:55:40,748 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:55:40,816 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:55:42,007 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2018-02-04 17:55:42,008 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:55:42,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66] total 130 [2018-02-04 17:55:42,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-02-04 17:55:42,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-02-04 17:55:42,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6241, Invalid=10529, Unknown=0, NotChecked=0, Total=16770 [2018-02-04 17:55:42,009 INFO L87 Difference]: Start difference. First operand 527 states and 528 transitions. Second operand 130 states. [2018-02-04 17:55:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:55:42,830 INFO L93 Difference]: Finished difference Result 539 states and 540 transitions. [2018-02-04 17:55:42,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 17:55:42,830 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 521 [2018-02-04 17:55:42,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:55:42,831 INFO L225 Difference]: With dead ends: 539 [2018-02-04 17:55:42,831 INFO L226 Difference]: Without dead ends: 539 [2018-02-04 17:55:42,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 458 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7872 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=6370, Invalid=10660, Unknown=0, NotChecked=0, Total=17030 [2018-02-04 17:55:42,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-02-04 17:55:42,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 535. [2018-02-04 17:55:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-02-04 17:55:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 536 transitions. [2018-02-04 17:55:42,834 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 536 transitions. Word has length 521 [2018-02-04 17:55:42,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:55:42,834 INFO L432 AbstractCegarLoop]: Abstraction has 535 states and 536 transitions. [2018-02-04 17:55:42,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-02-04 17:55:42,834 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 536 transitions. [2018-02-04 17:55:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2018-02-04 17:55:42,836 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:55:42,836 INFO L351 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 63, 63, 63, 63, 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 17:55:42,836 INFO L371 AbstractCegarLoop]: === Iteration 69 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:55:42,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1179971316, now seen corresponding path program 55 times [2018-02-04 17:55:42,836 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:55:42,836 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:55:42,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:42,837 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:55:42,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:55:42,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:55:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15876 backedges. 0 proven. 7938 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2018-02-04 17:55:44,540 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:55:44,540 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:55:44,541 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:55:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:55:44,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:55:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 15876 backedges. 0 proven. 7938 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2018-02-04 17:55:45,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:55:45,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67] total 132 [2018-02-04 17:55:45,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-02-04 17:55:45,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-02-04 17:55:45,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6436, Invalid=10856, Unknown=0, NotChecked=0, Total=17292 [2018-02-04 17:55:45,793 INFO L87 Difference]: Start difference. First operand 535 states and 536 transitions. Second operand 132 states. [2018-02-04 17:55:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:55:46,595 INFO L93 Difference]: Finished difference Result 547 states and 548 transitions. [2018-02-04 17:55:46,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 17:55:46,595 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 529 [2018-02-04 17:55:46,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:55:46,597 INFO L225 Difference]: With dead ends: 547 [2018-02-04 17:55:46,597 INFO L226 Difference]: Without dead ends: 547 [2018-02-04 17:55:46,597 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 465 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8125 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=6567, Invalid=10989, Unknown=0, NotChecked=0, Total=17556 [2018-02-04 17:55:46,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-02-04 17:55:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 543. [2018-02-04 17:55:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-02-04 17:55:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 544 transitions. [2018-02-04 17:55:46,600 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 544 transitions. Word has length 529 [2018-02-04 17:55:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:55:46,600 INFO L432 AbstractCegarLoop]: Abstraction has 543 states and 544 transitions. [2018-02-04 17:55:46,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-02-04 17:55:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 544 transitions. [2018-02-04 17:55:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2018-02-04 17:55:46,601 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:55:46,602 INFO L351 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 64, 64, 64, 64, 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 17:55:46,602 INFO L371 AbstractCegarLoop]: === Iteration 70 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:55:46,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1760591404, now seen corresponding path program 56 times [2018-02-04 17:55:46,602 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:55:46,602 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:55:46,602 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:46,602 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:55:46,602 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:55:46,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:55:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 0 proven. 8192 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2018-02-04 17:55:48,252 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:55:48,252 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:55:48,253 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:55:48,303 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:55:48,303 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:55:48,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:55:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 0 proven. 8192 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2018-02-04 17:55:48,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:55:48,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 67] total 70 [2018-02-04 17:55:48,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-04 17:55:48,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-04 17:55:48,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2282, Invalid=2548, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 17:55:48,404 INFO L87 Difference]: Start difference. First operand 543 states and 544 transitions. Second operand 70 states. [2018-02-04 17:55:49,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:55:49,670 INFO L93 Difference]: Finished difference Result 555 states and 556 transitions. [2018-02-04 17:55:49,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-04 17:55:49,670 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 537 [2018-02-04 17:55:49,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:55:49,671 INFO L225 Difference]: With dead ends: 555 [2018-02-04 17:55:49,671 INFO L226 Difference]: Without dead ends: 555 [2018-02-04 17:55:49,672 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2333 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=6703, Invalid=11387, Unknown=0, NotChecked=0, Total=18090 [2018-02-04 17:55:49,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-02-04 17:55:49,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 551. [2018-02-04 17:55:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-02-04 17:55:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 552 transitions. [2018-02-04 17:55:49,675 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 552 transitions. Word has length 537 [2018-02-04 17:55:49,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:55:49,675 INFO L432 AbstractCegarLoop]: Abstraction has 551 states and 552 transitions. [2018-02-04 17:55:49,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-04 17:55:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 552 transitions. [2018-02-04 17:55:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-02-04 17:55:49,676 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:55:49,676 INFO L351 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 65, 65, 65, 65, 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 17:55:49,676 INFO L371 AbstractCegarLoop]: === Iteration 71 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:55:49,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1874403916, now seen corresponding path program 57 times [2018-02-04 17:55:49,677 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:55:49,677 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:55:49,677 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:49,677 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:55:49,677 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:55:49,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:55:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 16900 backedges. 0 proven. 8450 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2018-02-04 17:55:51,402 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:55:51,402 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:55:51,402 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:55:51,511 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-02-04 17:55:51,511 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:55:51,544 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:55:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 16900 backedges. 0 proven. 8450 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2018-02-04 17:55:51,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:55:51,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 68] total 71 [2018-02-04 17:55:51,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-04 17:55:51,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-04 17:55:51,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2350, Invalid=2620, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 17:55:51,641 INFO L87 Difference]: Start difference. First operand 551 states and 552 transitions. Second operand 71 states. [2018-02-04 17:55:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:55:52,939 INFO L93 Difference]: Finished difference Result 563 states and 564 transitions. [2018-02-04 17:55:52,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-02-04 17:55:52,939 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 545 [2018-02-04 17:55:52,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:55:52,940 INFO L225 Difference]: With dead ends: 563 [2018-02-04 17:55:52,940 INFO L226 Difference]: Without dead ends: 563 [2018-02-04 17:55:52,940 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=6905, Invalid=11727, Unknown=0, NotChecked=0, Total=18632 [2018-02-04 17:55:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-02-04 17:55:52,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 559. [2018-02-04 17:55:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2018-02-04 17:55:52,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 560 transitions. [2018-02-04 17:55:52,943 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 560 transitions. Word has length 545 [2018-02-04 17:55:52,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:55:52,943 INFO L432 AbstractCegarLoop]: Abstraction has 559 states and 560 transitions. [2018-02-04 17:55:52,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-04 17:55:52,943 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 560 transitions. [2018-02-04 17:55:52,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2018-02-04 17:55:52,944 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:55:52,945 INFO L351 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 66, 66, 66, 66, 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 17:55:52,945 INFO L371 AbstractCegarLoop]: === Iteration 72 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:55:52,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1876589932, now seen corresponding path program 58 times [2018-02-04 17:55:52,945 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:55:52,945 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:55:52,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:52,945 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:55:52,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:55:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:55:52,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:55:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 17424 backedges. 0 proven. 8712 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2018-02-04 17:55:54,679 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:55:54,679 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:55:54,679 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:55:54,823 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:55:54,823 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:55:54,865 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:55:54,866 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 17:55:54,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:55:54,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:55:54,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:55:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 17424 backedges. 8712 proven. 8712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:55:59,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:55:59,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 138] total 207 [2018-02-04 17:55:59,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 207 states [2018-02-04 17:55:59,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 207 interpolants. [2018-02-04 17:55:59,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9522, Invalid=33120, Unknown=0, NotChecked=0, Total=42642 [2018-02-04 17:55:59,843 INFO L87 Difference]: Start difference. First operand 559 states and 560 transitions. Second operand 207 states. [2018-02-04 17:56:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:02,793 INFO L93 Difference]: Finished difference Result 571 states and 572 transitions. [2018-02-04 17:56:02,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-02-04 17:56:02,793 INFO L78 Accepts]: Start accepts. Automaton has 207 states. Word has length 553 [2018-02-04 17:56:02,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:02,794 INFO L225 Difference]: With dead ends: 571 [2018-02-04 17:56:02,794 INFO L226 Difference]: Without dead ends: 571 [2018-02-04 17:56:02,796 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 418 SyntacticMatches, 1 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31821 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=16639, Invalid=59813, Unknown=0, NotChecked=0, Total=76452 [2018-02-04 17:56:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-02-04 17:56:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 567. [2018-02-04 17:56:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-02-04 17:56:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 568 transitions. [2018-02-04 17:56:02,798 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 568 transitions. Word has length 553 [2018-02-04 17:56:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:02,799 INFO L432 AbstractCegarLoop]: Abstraction has 567 states and 568 transitions. [2018-02-04 17:56:02,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 207 states. [2018-02-04 17:56:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 568 transitions. [2018-02-04 17:56:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2018-02-04 17:56:02,800 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:02,800 INFO L351 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 67, 67, 67, 67, 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 17:56:02,800 INFO L371 AbstractCegarLoop]: === Iteration 73 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:56:02,801 INFO L82 PathProgramCache]: Analyzing trace with hash 882241652, now seen corresponding path program 59 times [2018-02-04 17:56:02,801 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:02,801 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:02,801 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:02,801 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:56:02,801 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:02,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 0 proven. 8978 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2018-02-04 17:56:04,634 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:04,634 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:04,635 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:56:04,770 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 68 check-sat command(s) [2018-02-04 17:56:04,770 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:56:04,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:04,878 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 0 proven. 8978 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2018-02-04 17:56:04,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:04,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 70] total 73 [2018-02-04 17:56:04,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-02-04 17:56:04,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-02-04 17:56:04,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2489, Invalid=2767, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 17:56:04,880 INFO L87 Difference]: Start difference. First operand 567 states and 568 transitions. Second operand 73 states. [2018-02-04 17:56:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:06,290 INFO L93 Difference]: Finished difference Result 579 states and 580 transitions. [2018-02-04 17:56:06,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-04 17:56:06,291 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 561 [2018-02-04 17:56:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:06,291 INFO L225 Difference]: With dead ends: 579 [2018-02-04 17:56:06,291 INFO L226 Difference]: Without dead ends: 579 [2018-02-04 17:56:06,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2543 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=7318, Invalid=12422, Unknown=0, NotChecked=0, Total=19740 [2018-02-04 17:56:06,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-02-04 17:56:06,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 575. [2018-02-04 17:56:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-02-04 17:56:06,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 576 transitions. [2018-02-04 17:56:06,294 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 576 transitions. Word has length 561 [2018-02-04 17:56:06,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:06,294 INFO L432 AbstractCegarLoop]: Abstraction has 575 states and 576 transitions. [2018-02-04 17:56:06,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-02-04 17:56:06,295 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 576 transitions. [2018-02-04 17:56:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2018-02-04 17:56:06,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:06,296 INFO L351 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 68, 68, 68, 68, 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 17:56:06,296 INFO L371 AbstractCegarLoop]: === Iteration 74 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:56:06,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2067965780, now seen corresponding path program 60 times [2018-02-04 17:56:06,297 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:06,297 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:06,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:06,297 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:56:06,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:06,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 18496 backedges. 0 proven. 9248 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2018-02-04 17:56:08,209 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:08,209 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:08,210 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:56:08,332 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 69 check-sat command(s) [2018-02-04 17:56:08,332 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:56:08,367 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:09,750 INFO L134 CoverageAnalysis]: Checked inductivity of 18496 backedges. 0 proven. 9248 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2018-02-04 17:56:09,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:09,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 72] total 142 [2018-02-04 17:56:09,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-02-04 17:56:09,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-02-04 17:56:09,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7456, Invalid=12566, Unknown=0, NotChecked=0, Total=20022 [2018-02-04 17:56:09,752 INFO L87 Difference]: Start difference. First operand 575 states and 576 transitions. Second operand 142 states. [2018-02-04 17:56:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:10,610 INFO L93 Difference]: Finished difference Result 587 states and 588 transitions. [2018-02-04 17:56:10,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 17:56:10,610 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 569 [2018-02-04 17:56:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:10,611 INFO L225 Difference]: With dead ends: 587 [2018-02-04 17:56:10,611 INFO L226 Difference]: Without dead ends: 587 [2018-02-04 17:56:10,612 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 500 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9450 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=7597, Invalid=12709, Unknown=0, NotChecked=0, Total=20306 [2018-02-04 17:56:10,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-02-04 17:56:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 583. [2018-02-04 17:56:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-02-04 17:56:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 584 transitions. [2018-02-04 17:56:10,615 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 584 transitions. Word has length 569 [2018-02-04 17:56:10,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:10,615 INFO L432 AbstractCegarLoop]: Abstraction has 583 states and 584 transitions. [2018-02-04 17:56:10,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-02-04 17:56:10,615 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 584 transitions. [2018-02-04 17:56:10,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2018-02-04 17:56:10,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:10,617 INFO L351 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 69, 69, 69, 69, 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 17:56:10,617 INFO L371 AbstractCegarLoop]: === Iteration 75 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:56:10,617 INFO L82 PathProgramCache]: Analyzing trace with hash -510253260, now seen corresponding path program 61 times [2018-02-04 17:56:10,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:10,617 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:10,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:10,617 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:56:10,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:10,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 19044 backedges. 0 proven. 9522 refuted. 0 times theorem prover too weak. 9522 trivial. 0 not checked. [2018-02-04 17:56:12,608 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:12,608 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:12,609 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:12,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:14,057 INFO L134 CoverageAnalysis]: Checked inductivity of 19044 backedges. 0 proven. 9522 refuted. 0 times theorem prover too weak. 9522 trivial. 0 not checked. [2018-02-04 17:56:14,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:14,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 73] total 144 [2018-02-04 17:56:14,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-02-04 17:56:14,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-02-04 17:56:14,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7669, Invalid=12923, Unknown=0, NotChecked=0, Total=20592 [2018-02-04 17:56:14,060 INFO L87 Difference]: Start difference. First operand 583 states and 584 transitions. Second operand 144 states. [2018-02-04 17:56:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:14,902 INFO L93 Difference]: Finished difference Result 595 states and 596 transitions. [2018-02-04 17:56:14,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-02-04 17:56:14,902 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 577 [2018-02-04 17:56:14,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:14,903 INFO L225 Difference]: With dead ends: 595 [2018-02-04 17:56:14,903 INFO L226 Difference]: Without dead ends: 595 [2018-02-04 17:56:14,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 507 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9727 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=7812, Invalid=13068, Unknown=0, NotChecked=0, Total=20880 [2018-02-04 17:56:14,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-02-04 17:56:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 591. [2018-02-04 17:56:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-02-04 17:56:14,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 592 transitions. [2018-02-04 17:56:14,906 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 592 transitions. Word has length 577 [2018-02-04 17:56:14,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:14,906 INFO L432 AbstractCegarLoop]: Abstraction has 591 states and 592 transitions. [2018-02-04 17:56:14,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-02-04 17:56:14,906 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 592 transitions. [2018-02-04 17:56:14,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2018-02-04 17:56:14,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:14,908 INFO L351 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 70, 70, 70, 70, 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 17:56:14,908 INFO L371 AbstractCegarLoop]: === Iteration 76 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:56:14,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2068123628, now seen corresponding path program 62 times [2018-02-04 17:56:14,909 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:14,909 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:14,909 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:14,909 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:14,909 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:14,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 19600 backedges. 0 proven. 9800 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2018-02-04 17:56:16,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:16,911 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:16,911 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:56:16,971 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:56:16,971 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:56:16,982 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 19600 backedges. 0 proven. 9800 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2018-02-04 17:56:17,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:17,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 73] total 76 [2018-02-04 17:56:17,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-02-04 17:56:17,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-02-04 17:56:17,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2705, Invalid=2995, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 17:56:17,090 INFO L87 Difference]: Start difference. First operand 591 states and 592 transitions. Second operand 76 states. [2018-02-04 17:56:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:18,614 INFO L93 Difference]: Finished difference Result 603 states and 604 transitions. [2018-02-04 17:56:18,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-02-04 17:56:18,614 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 585 [2018-02-04 17:56:18,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:18,616 INFO L225 Difference]: With dead ends: 603 [2018-02-04 17:56:18,616 INFO L226 Difference]: Without dead ends: 603 [2018-02-04 17:56:18,616 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 656 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2762 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=7960, Invalid=13502, Unknown=0, NotChecked=0, Total=21462 [2018-02-04 17:56:18,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-02-04 17:56:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 599. [2018-02-04 17:56:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-02-04 17:56:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 600 transitions. [2018-02-04 17:56:18,619 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 600 transitions. Word has length 585 [2018-02-04 17:56:18,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:18,620 INFO L432 AbstractCegarLoop]: Abstraction has 599 states and 600 transitions. [2018-02-04 17:56:18,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-02-04 17:56:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 600 transitions. [2018-02-04 17:56:18,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2018-02-04 17:56:18,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:18,622 INFO L351 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 71, 71, 71, 71, 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 17:56:18,622 INFO L371 AbstractCegarLoop]: === Iteration 77 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:56:18,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1100710388, now seen corresponding path program 63 times [2018-02-04 17:56:18,622 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:18,622 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:18,622 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:18,622 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:56:18,623 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:18,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 20164 backedges. 0 proven. 10082 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2018-02-04 17:56:20,714 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:20,714 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:20,715 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:56:20,835 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2018-02-04 17:56:20,835 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:56:20,867 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 20164 backedges. 0 proven. 10082 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2018-02-04 17:56:22,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:22,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 75] total 148 [2018-02-04 17:56:22,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-02-04 17:56:22,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-02-04 17:56:22,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8104, Invalid=13652, Unknown=0, NotChecked=0, Total=21756 [2018-02-04 17:56:22,346 INFO L87 Difference]: Start difference. First operand 599 states and 600 transitions. Second operand 148 states. [2018-02-04 17:56:23,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:23,605 INFO L93 Difference]: Finished difference Result 611 states and 612 transitions. [2018-02-04 17:56:23,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-02-04 17:56:23,606 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 593 [2018-02-04 17:56:23,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:23,607 INFO L225 Difference]: With dead ends: 611 [2018-02-04 17:56:23,607 INFO L226 Difference]: Without dead ends: 611 [2018-02-04 17:56:23,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 521 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10293 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=8251, Invalid=13801, Unknown=0, NotChecked=0, Total=22052 [2018-02-04 17:56:23,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-02-04 17:56:23,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 607. [2018-02-04 17:56:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-02-04 17:56:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 608 transitions. [2018-02-04 17:56:23,611 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 608 transitions. Word has length 593 [2018-02-04 17:56:23,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:23,611 INFO L432 AbstractCegarLoop]: Abstraction has 607 states and 608 transitions. [2018-02-04 17:56:23,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-02-04 17:56:23,612 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 608 transitions. [2018-02-04 17:56:23,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2018-02-04 17:56:23,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:23,614 INFO L351 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 72, 72, 72, 72, 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 17:56:23,614 INFO L371 AbstractCegarLoop]: === Iteration 78 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:56:23,614 INFO L82 PathProgramCache]: Analyzing trace with hash -723362604, now seen corresponding path program 64 times [2018-02-04 17:56:23,614 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:23,614 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:23,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:23,615 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:56:23,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:23,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:25,932 INFO L134 CoverageAnalysis]: Checked inductivity of 20736 backedges. 0 proven. 10368 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2018-02-04 17:56:25,932 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:25,932 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:25,932 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:56:26,155 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:56:26,155 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:56:26,182 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:26,184 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 17:56:26,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:26,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:26,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:56:32,766 INFO L134 CoverageAnalysis]: Checked inductivity of 20736 backedges. 10368 proven. 10368 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:56:32,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:32,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 150] total 225 [2018-02-04 17:56:32,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 225 states [2018-02-04 17:56:32,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 225 interpolants. [2018-02-04 17:56:32,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11250, Invalid=39150, Unknown=0, NotChecked=0, Total=50400 [2018-02-04 17:56:32,769 INFO L87 Difference]: Start difference. First operand 607 states and 608 transitions. Second operand 225 states. [2018-02-04 17:56:36,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:36,099 INFO L93 Difference]: Finished difference Result 619 states and 620 transitions. [2018-02-04 17:56:36,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-02-04 17:56:36,099 INFO L78 Accepts]: Start accepts. Automaton has 225 states. Word has length 601 [2018-02-04 17:56:36,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:36,100 INFO L225 Difference]: With dead ends: 619 [2018-02-04 17:56:36,101 INFO L226 Difference]: Without dead ends: 619 [2018-02-04 17:56:36,103 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 454 SyntacticMatches, 1 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37737 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=19660, Invalid=70640, Unknown=0, NotChecked=0, Total=90300 [2018-02-04 17:56:36,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-02-04 17:56:36,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 615. [2018-02-04 17:56:36,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2018-02-04 17:56:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 616 transitions. [2018-02-04 17:56:36,106 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 616 transitions. Word has length 601 [2018-02-04 17:56:36,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:36,107 INFO L432 AbstractCegarLoop]: Abstraction has 615 states and 616 transitions. [2018-02-04 17:56:36,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 225 states. [2018-02-04 17:56:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 616 transitions. [2018-02-04 17:56:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2018-02-04 17:56:36,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:36,109 INFO L351 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 73, 73, 73, 73, 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 17:56:36,109 INFO L371 AbstractCegarLoop]: === Iteration 79 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:56:36,109 INFO L82 PathProgramCache]: Analyzing trace with hash -84279116, now seen corresponding path program 65 times [2018-02-04 17:56:36,109 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:36,109 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:36,110 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:36,110 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:56:36,110 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:36,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 21316 backedges. 0 proven. 10658 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2018-02-04 17:56:38,386 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:38,386 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:38,386 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:56:38,533 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 74 check-sat command(s) [2018-02-04 17:56:38,533 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:56:38,548 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 21316 backedges. 0 proven. 10658 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2018-02-04 17:56:38,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:38,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 76] total 79 [2018-02-04 17:56:38,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-02-04 17:56:38,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-02-04 17:56:38,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2930, Invalid=3232, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 17:56:38,666 INFO L87 Difference]: Start difference. First operand 615 states and 616 transitions. Second operand 79 states. [2018-02-04 17:56:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:40,432 INFO L93 Difference]: Finished difference Result 627 states and 628 transitions. [2018-02-04 17:56:40,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-02-04 17:56:40,433 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 609 [2018-02-04 17:56:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:40,434 INFO L225 Difference]: With dead ends: 627 [2018-02-04 17:56:40,434 INFO L226 Difference]: Without dead ends: 627 [2018-02-04 17:56:40,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 834 GetRequests, 683 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2990 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=8629, Invalid=14627, Unknown=0, NotChecked=0, Total=23256 [2018-02-04 17:56:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-02-04 17:56:40,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 623. [2018-02-04 17:56:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-02-04 17:56:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 624 transitions. [2018-02-04 17:56:40,437 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 624 transitions. Word has length 609 [2018-02-04 17:56:40,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:40,437 INFO L432 AbstractCegarLoop]: Abstraction has 623 states and 624 transitions. [2018-02-04 17:56:40,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-02-04 17:56:40,437 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 624 transitions. [2018-02-04 17:56:40,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2018-02-04 17:56:40,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:40,440 INFO L351 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 74, 74, 74, 74, 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 17:56:40,440 INFO L371 AbstractCegarLoop]: === Iteration 80 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:56:40,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1878200940, now seen corresponding path program 66 times [2018-02-04 17:56:40,440 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:40,440 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:40,440 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:40,440 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:56:40,440 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:40,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 21904 backedges. 0 proven. 10952 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2018-02-04 17:56:42,855 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:42,855 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:42,856 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:56:42,972 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 75 check-sat command(s) [2018-02-04 17:56:42,972 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:56:43,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 21904 backedges. 0 proven. 10952 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2018-02-04 17:56:43,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:43,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78] total 81 [2018-02-04 17:56:43,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-02-04 17:56:43,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-02-04 17:56:43,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3009, Invalid=3471, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 17:56:43,190 INFO L87 Difference]: Start difference. First operand 623 states and 624 transitions. Second operand 81 states. [2018-02-04 17:56:44,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:44,952 INFO L93 Difference]: Finished difference Result 635 states and 636 transitions. [2018-02-04 17:56:44,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-02-04 17:56:44,953 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 617 [2018-02-04 17:56:44,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:44,954 INFO L225 Difference]: With dead ends: 635 [2018-02-04 17:56:44,954 INFO L226 Difference]: Without dead ends: 635 [2018-02-04 17:56:44,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 692 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3218 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=8864, Invalid=15628, Unknown=0, NotChecked=0, Total=24492 [2018-02-04 17:56:44,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-02-04 17:56:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 631. [2018-02-04 17:56:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-02-04 17:56:44,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 632 transitions. [2018-02-04 17:56:44,957 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 632 transitions. Word has length 617 [2018-02-04 17:56:44,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:44,957 INFO L432 AbstractCegarLoop]: Abstraction has 631 states and 632 transitions. [2018-02-04 17:56:44,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-02-04 17:56:44,958 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 632 transitions. [2018-02-04 17:56:44,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2018-02-04 17:56:44,960 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:44,960 INFO L351 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 75, 75, 75, 75, 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 17:56:44,960 INFO L371 AbstractCegarLoop]: === Iteration 81 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:56:44,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1341807756, now seen corresponding path program 67 times [2018-02-04 17:56:44,960 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:44,960 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:44,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:44,960 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:56:44,961 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:45,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:47,426 INFO L134 CoverageAnalysis]: Checked inductivity of 22500 backedges. 0 proven. 11250 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2018-02-04 17:56:47,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:47,427 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:47,427 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:47,476 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 22500 backedges. 0 proven. 11250 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2018-02-04 17:56:49,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:49,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 79] total 156 [2018-02-04 17:56:49,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-02-04 17:56:49,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-02-04 17:56:49,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9010, Invalid=15170, Unknown=0, NotChecked=0, Total=24180 [2018-02-04 17:56:49,266 INFO L87 Difference]: Start difference. First operand 631 states and 632 transitions. Second operand 156 states. Received shutdown request... [2018-02-04 17:56:50,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-02-04 17:56:50,297 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 17:56:50,301 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 17:56:50,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:56:50 BoogieIcfgContainer [2018-02-04 17:56:50,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:56:50,302 INFO L168 Benchmark]: Toolchain (without parser) took 175187.69 ms. Allocated memory was 401.6 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 358.5 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 923.5 MB. Max. memory is 5.3 GB. [2018-02-04 17:56:50,303 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:56:50,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.91 ms. Allocated memory is still 401.6 MB. Free memory was 358.5 MB in the beginning and 347.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:56:50,303 INFO L168 Benchmark]: Boogie Preprocessor took 29.27 ms. Allocated memory is still 401.6 MB. Free memory was 347.8 MB in the beginning and 346.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:56:50,303 INFO L168 Benchmark]: RCFGBuilder took 199.67 ms. Allocated memory is still 401.6 MB. Free memory was 346.5 MB in the beginning and 327.2 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 5.3 GB. [2018-02-04 17:56:50,303 INFO L168 Benchmark]: TraceAbstraction took 174805.27 ms. Allocated memory was 401.6 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 327.2 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 892.2 MB. Max. memory is 5.3 GB. [2018-02-04 17:56:50,304 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.14 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 150.91 ms. Allocated memory is still 401.6 MB. Free memory was 358.5 MB in the beginning and 347.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.27 ms. Allocated memory is still 401.6 MB. Free memory was 347.8 MB in the beginning and 346.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 199.67 ms. Allocated memory is still 401.6 MB. Free memory was 346.5 MB in the beginning and 327.2 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 174805.27 ms. Allocated memory was 401.6 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 327.2 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 892.2 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 625). Cancelled while BasicCegarLoop was constructing difference of abstraction (631states) and interpolant automaton (currently 80 states, 156 states before enhancement), while ReachableStatesComputation was computing reachable states (543 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was constructing difference of abstraction (631states) and interpolant automaton (currently 80 states, 156 states before enhancement), while ReachableStatesComputation was computing reachable states (543 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (631states) and interpolant automaton (currently 80 states, 156 states before enhancement), while ReachableStatesComputation was computing reachable states (543 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (631states) and interpolant automaton (currently 80 states, 156 states before enhancement), while ReachableStatesComputation was computing reachable states (543 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (631states) and interpolant automaton (currently 80 states, 156 states before enhancement), while ReachableStatesComputation was computing reachable states (543 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (631states) and interpolant automaton (currently 80 states, 156 states before enhancement), while ReachableStatesComputation was computing reachable states (543 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (631states) and interpolant automaton (currently 80 states, 156 states before enhancement), while ReachableStatesComputation was computing reachable states (543 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (631states) and interpolant automaton (currently 80 states, 156 states before enhancement), while ReachableStatesComputation was computing reachable states (543 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (631states) and interpolant automaton (currently 80 states, 156 states before enhancement), while ReachableStatesComputation was computing reachable states (543 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (631states) and interpolant automaton (currently 80 states, 156 states before enhancement), while ReachableStatesComputation was computing reachable states (543 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (631states) and interpolant automaton (currently 80 states, 156 states before enhancement), while ReachableStatesComputation was computing reachable states (543 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (631states) and interpolant automaton (currently 80 states, 156 states before enhancement), while ReachableStatesComputation was computing reachable states (543 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (631states) and interpolant automaton (currently 80 states, 156 states before enhancement), while ReachableStatesComputation was computing reachable states (543 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (631states) and interpolant automaton (currently 80 states, 156 states before enhancement), while ReachableStatesComputation was computing reachable states (543 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (631states) and interpolant automaton (currently 80 states, 156 states before enhancement), while ReachableStatesComputation was computing reachable states (543 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (631states) and interpolant automaton (currently 80 states, 156 states before enhancement), while ReachableStatesComputation was computing reachable states (543 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 629]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 629). Cancelled while BasicCegarLoop was constructing difference of abstraction (631states) and interpolant automaton (currently 80 states, 156 states before enhancement), while ReachableStatesComputation was computing reachable states (543 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 17 error locations. TIMEOUT Result, 174.7s OverallTime, 81 OverallIterations, 76 TraceHistogramMax, 55.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2139 SDtfs, 40530 SDslu, 48934 SDs, 0 SdLazy, 36957 SolverSat, 10253 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31151 GetRequests, 23970 SyntacticMatches, 35 SemanticMatches, 7146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321170 ImplicationChecksByTransitivity, 103.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=631occurred in iteration=80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 80 MinimizatonAttempts, 344 StatesRemovedByMinimization, 76 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 5.4s SatisfiabilityAnalysisTime, 108.5s InterpolantComputationTime, 49306 NumberOfCodeBlocks, 48734 NumberOfCodeBlocksAsserted, 1581 NumberOfCheckSat, 49043 ConstructedInterpolants, 131 QuantifiedInterpolants, 79722456 SizeOfPredicates, 167 NumberOfNonLiveVariables, 60998 ConjunctsInSsa, 3691 ConjunctsInUnsatCore, 154 InterpolantComputations, 8 PerfectInterpolantSequences, 573696/1147260 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_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-56-50-311.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-56-50-311.csv Completed graceful shutdown