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_Camel.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 13:04:06,838 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 13:04:06,839 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 13:04:06,849 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 13:04:06,850 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 13:04:06,850 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 13:04:06,851 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 13:04:06,853 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 13:04:06,854 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 13:04:06,855 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 13:04:06,855 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 13:04:06,856 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 13:04:06,856 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 13:04:06,857 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 13:04:06,858 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 13:04:06,860 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 13:04:06,862 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 13:04:06,863 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 13:04:06,864 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 13:04:06,865 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 13:04:06,866 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 13:04:06,867 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 13:04:06,867 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 13:04:06,868 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 13:04:06,868 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 13:04:06,869 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 13:04:06,869 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 13:04:06,870 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 13:04:06,870 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 13:04:06,870 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 13:04:06,870 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 13:04:06,871 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 13:04:06,880 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 13:04:06,880 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 13:04:06,881 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 13:04:06,881 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 13:04:06,881 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 13:04:06,881 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 13:04:06,881 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 13:04:06,882 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 13:04:06,882 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 13:04:06,882 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 13:04:06,882 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 13:04:06,882 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 13:04:06,882 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 13:04:06,883 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 13:04:06,883 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 13:04:06,883 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 13:04:06,883 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 13:04:06,883 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 13:04:06,883 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 13:04:06,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:04:06,884 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 13:04:06,884 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 13:04:06,884 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 13:04:06,884 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 13:04:06,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 13:04:06,922 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 13:04:06,926 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 13:04:06,927 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 13:04:06,927 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 13:04:06,928 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i [2018-02-04 13:04:07,061 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 13:04:07,062 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 13:04:07,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 13:04:07,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 13:04:07,068 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 13:04:07,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:04:07" (1/1) ... [2018-02-04 13:04:07,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c55627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07, skipping insertion in model container [2018-02-04 13:04:07,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:04:07" (1/1) ... [2018-02-04 13:04:07,085 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:04:07,113 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:04:07,202 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:04:07,215 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:04:07,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07 WrapperNode [2018-02-04 13:04:07,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 13:04:07,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 13:04:07,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 13:04:07,220 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 13:04:07,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07" (1/1) ... [2018-02-04 13:04:07,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07" (1/1) ... [2018-02-04 13:04:07,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07" (1/1) ... [2018-02-04 13:04:07,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07" (1/1) ... [2018-02-04 13:04:07,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07" (1/1) ... [2018-02-04 13:04:07,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07" (1/1) ... [2018-02-04 13:04:07,247 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07" (1/1) ... [2018-02-04 13:04:07,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 13:04:07,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 13:04:07,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 13:04:07,248 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 13:04:07,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07" (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 13:04:07,280 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 13:04:07,281 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 13:04:07,281 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 13:04:07,281 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 13:04:07,281 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 13:04:07,281 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 13:04:07,281 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 13:04:07,281 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 13:04:07,281 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 13:04:07,281 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 13:04:07,281 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 13:04:07,281 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 13:04:07,281 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 13:04:07,282 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 13:04:07,620 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 13:04:07,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:04:07 BoogieIcfgContainer [2018-02-04 13:04:07,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 13:04:07,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 13:04:07,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 13:04:07,625 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 13:04:07,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:04:07" (1/3) ... [2018-02-04 13:04:07,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eba27ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:04:07, skipping insertion in model container [2018-02-04 13:04:07,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:07" (2/3) ... [2018-02-04 13:04:07,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eba27ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:04:07, skipping insertion in model container [2018-02-04 13:04:07,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:04:07" (3/3) ... [2018-02-04 13:04:07,628 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_stack_true-valid-memsafety_false-termination.i [2018-02-04 13:04:07,634 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 13:04:07,641 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-02-04 13:04:07,671 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 13:04:07,672 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 13:04:07,672 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 13:04:07,672 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 13:04:07,672 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 13:04:07,672 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 13:04:07,672 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 13:04:07,673 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 13:04:07,673 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 13:04:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2018-02-04 13:04:07,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 13:04:07,701 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:07,702 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:07,702 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:07,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1338247859, now seen corresponding path program 1 times [2018-02-04 13:04:07,711 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:07,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:07,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:07,760 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:07,760 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:07,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:07,840 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 13:04:07,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:07,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:04:07,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:04:07,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:04:07,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:04:07,852 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 4 states. [2018-02-04 13:04:08,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:08,038 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2018-02-04 13:04:08,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:04:08,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 13:04:08,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:08,045 INFO L225 Difference]: With dead ends: 162 [2018-02-04 13:04:08,045 INFO L226 Difference]: Without dead ends: 158 [2018-02-04 13:04:08,046 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 13:04:08,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-04 13:04:08,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 142. [2018-02-04 13:04:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 13:04:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-02-04 13:04:08,072 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 8 [2018-02-04 13:04:08,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:08,072 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-02-04 13:04:08,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:04:08,072 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-02-04 13:04:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 13:04:08,072 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:08,072 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:08,073 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:08,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1338247858, now seen corresponding path program 1 times [2018-02-04 13:04:08,073 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:08,073 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:08,074 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:08,074 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:08,074 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:08,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:08,125 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 13:04:08,125 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:08,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:04:08,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:04:08,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:04:08,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:04:08,127 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand 4 states. [2018-02-04 13:04:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:08,227 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2018-02-04 13:04:08,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:04:08,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 13:04:08,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:08,228 INFO L225 Difference]: With dead ends: 140 [2018-02-04 13:04:08,229 INFO L226 Difference]: Without dead ends: 140 [2018-02-04 13:04:08,229 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 13:04:08,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-04 13:04:08,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-02-04 13:04:08,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 13:04:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-02-04 13:04:08,236 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 8 [2018-02-04 13:04:08,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:08,237 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-02-04 13:04:08,237 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:04:08,237 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-02-04 13:04:08,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:04:08,237 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:08,237 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:08,238 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:08,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1963213562, now seen corresponding path program 1 times [2018-02-04 13:04:08,238 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:08,238 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:08,243 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:08,243 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:08,243 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:08,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:08,280 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 13:04:08,280 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:08,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:04:08,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:04:08,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:04:08,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:04:08,281 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 4 states. [2018-02-04 13:04:08,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:08,404 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2018-02-04 13:04:08,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:04:08,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 13:04:08,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:08,405 INFO L225 Difference]: With dead ends: 148 [2018-02-04 13:04:08,405 INFO L226 Difference]: Without dead ends: 148 [2018-02-04 13:04:08,405 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 13:04:08,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-04 13:04:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2018-02-04 13:04:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 13:04:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2018-02-04 13:04:08,409 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 14 [2018-02-04 13:04:08,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:08,409 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2018-02-04 13:04:08,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:04:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2018-02-04 13:04:08,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:04:08,409 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:08,409 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:08,410 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:08,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1963213563, now seen corresponding path program 1 times [2018-02-04 13:04:08,410 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:08,410 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:08,410 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:08,410 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:08,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:08,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:08,457 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 13:04:08,457 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:08,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:04:08,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:04:08,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:04:08,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:04:08,458 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand 5 states. [2018-02-04 13:04:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:08,601 INFO L93 Difference]: Finished difference Result 173 states and 191 transitions. [2018-02-04 13:04:08,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:04:08,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 13:04:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:08,603 INFO L225 Difference]: With dead ends: 173 [2018-02-04 13:04:08,603 INFO L226 Difference]: Without dead ends: 173 [2018-02-04 13:04:08,603 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 13:04:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-04 13:04:08,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 157. [2018-02-04 13:04:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-04 13:04:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2018-02-04 13:04:08,610 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 14 [2018-02-04 13:04:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:08,611 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2018-02-04 13:04:08,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:04:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2018-02-04 13:04:08,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 13:04:08,611 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:08,611 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:08,611 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:08,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1159097560, now seen corresponding path program 1 times [2018-02-04 13:04:08,611 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:08,611 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:08,612 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:08,612 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:08,612 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:08,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:08,648 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 13:04:08,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:08,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:04:08,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:04:08,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:04:08,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:04:08,649 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand 4 states. [2018-02-04 13:04:08,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:08,708 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2018-02-04 13:04:08,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:04:08,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 13:04:08,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:08,709 INFO L225 Difference]: With dead ends: 170 [2018-02-04 13:04:08,709 INFO L226 Difference]: Without dead ends: 170 [2018-02-04 13:04:08,709 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 13:04:08,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-04 13:04:08,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 158. [2018-02-04 13:04:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 13:04:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2018-02-04 13:04:08,714 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 16 [2018-02-04 13:04:08,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:08,714 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2018-02-04 13:04:08,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:04:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2018-02-04 13:04:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 13:04:08,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:08,715 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:08,715 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:08,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1159097561, now seen corresponding path program 1 times [2018-02-04 13:04:08,715 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:08,715 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:08,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:08,716 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:08,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:08,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:08,768 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 13:04:08,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:08,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:04:08,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:04:08,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:04:08,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:04:08,769 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand 4 states. [2018-02-04 13:04:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:08,859 INFO L93 Difference]: Finished difference Result 160 states and 183 transitions. [2018-02-04 13:04:08,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:04:08,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 13:04:08,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:08,860 INFO L225 Difference]: With dead ends: 160 [2018-02-04 13:04:08,860 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 13:04:08,860 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 13:04:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 13:04:08,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2018-02-04 13:04:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-04 13:04:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 180 transitions. [2018-02-04 13:04:08,864 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 180 transitions. Word has length 16 [2018-02-04 13:04:08,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:08,865 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 180 transitions. [2018-02-04 13:04:08,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:04:08,865 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2018-02-04 13:04:08,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 13:04:08,866 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:08,866 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:08,866 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:08,866 INFO L82 PathProgramCache]: Analyzing trace with hash 990226269, now seen corresponding path program 1 times [2018-02-04 13:04:08,866 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:08,866 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:08,867 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:08,867 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:08,867 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:08,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:08,896 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 13:04:08,896 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:08,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:04:08,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:04:08,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:04:08,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:04:08,897 INFO L87 Difference]: Start difference. First operand 156 states and 180 transitions. Second operand 4 states. [2018-02-04 13:04:08,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:08,910 INFO L93 Difference]: Finished difference Result 157 states and 180 transitions. [2018-02-04 13:04:08,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:04:08,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-04 13:04:08,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:08,911 INFO L225 Difference]: With dead ends: 157 [2018-02-04 13:04:08,912 INFO L226 Difference]: Without dead ends: 157 [2018-02-04 13:04:08,912 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 13:04:08,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-04 13:04:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-02-04 13:04:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-04 13:04:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 179 transitions. [2018-02-04 13:04:08,916 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 179 transitions. Word has length 21 [2018-02-04 13:04:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:08,916 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 179 transitions. [2018-02-04 13:04:08,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:04:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 179 transitions. [2018-02-04 13:04:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 13:04:08,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:08,917 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:08,917 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:08,917 INFO L82 PathProgramCache]: Analyzing trace with hash 632244512, now seen corresponding path program 1 times [2018-02-04 13:04:08,917 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:08,917 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:08,918 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:08,918 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:08,918 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:08,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:08,947 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 13:04:08,947 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:08,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:04:08,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:04:08,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:04:08,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:04:08,948 INFO L87 Difference]: Start difference. First operand 156 states and 179 transitions. Second operand 5 states. [2018-02-04 13:04:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:09,031 INFO L93 Difference]: Finished difference Result 171 states and 195 transitions. [2018-02-04 13:04:09,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:04:09,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-04 13:04:09,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:09,032 INFO L225 Difference]: With dead ends: 171 [2018-02-04 13:04:09,032 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 13:04:09,032 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:04:09,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 13:04:09,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 155. [2018-02-04 13:04:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 13:04:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 179 transitions. [2018-02-04 13:04:09,035 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 179 transitions. Word has length 22 [2018-02-04 13:04:09,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:09,035 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 179 transitions. [2018-02-04 13:04:09,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:04:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 179 transitions. [2018-02-04 13:04:09,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 13:04:09,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:09,036 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:09,036 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:09,036 INFO L82 PathProgramCache]: Analyzing trace with hash 632244513, now seen corresponding path program 1 times [2018-02-04 13:04:09,037 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:09,037 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:09,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:09,037 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:09,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:09,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:09,089 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 13:04:09,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:09,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:04:09,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:04:09,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:04:09,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:04:09,090 INFO L87 Difference]: Start difference. First operand 155 states and 179 transitions. Second operand 5 states. [2018-02-04 13:04:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:09,202 INFO L93 Difference]: Finished difference Result 175 states and 200 transitions. [2018-02-04 13:04:09,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:04:09,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-04 13:04:09,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:09,202 INFO L225 Difference]: With dead ends: 175 [2018-02-04 13:04:09,202 INFO L226 Difference]: Without dead ends: 175 [2018-02-04 13:04:09,203 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:04:09,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-04 13:04:09,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 157. [2018-02-04 13:04:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-04 13:04:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2018-02-04 13:04:09,205 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 22 [2018-02-04 13:04:09,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:09,205 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2018-02-04 13:04:09,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:04:09,205 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2018-02-04 13:04:09,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 13:04:09,206 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:09,206 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:09,206 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:09,206 INFO L82 PathProgramCache]: Analyzing trace with hash -733762389, now seen corresponding path program 1 times [2018-02-04 13:04:09,206 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:09,206 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:09,207 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:09,207 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:09,207 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:09,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:09,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:04:09,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:09,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:04:09,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:04:09,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:04:09,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:04:09,232 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand 3 states. [2018-02-04 13:04:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:09,237 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2018-02-04 13:04:09,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:04:09,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-02-04 13:04:09,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:09,240 INFO L225 Difference]: With dead ends: 159 [2018-02-04 13:04:09,240 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 13:04:09,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:04:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 13:04:09,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-02-04 13:04:09,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-04 13:04:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 182 transitions. [2018-02-04 13:04:09,243 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 182 transitions. Word has length 22 [2018-02-04 13:04:09,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:09,243 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 182 transitions. [2018-02-04 13:04:09,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:04:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 182 transitions. [2018-02-04 13:04:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 13:04:09,244 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:09,244 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:09,244 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:09,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1797349272, now seen corresponding path program 1 times [2018-02-04 13:04:09,245 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:09,245 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:09,245 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:09,245 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:09,246 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:09,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:04:09,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:09,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:04:09,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:04:09,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:04:09,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:04:09,339 INFO L87 Difference]: Start difference. First operand 159 states and 182 transitions. Second operand 6 states. [2018-02-04 13:04:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:09,499 INFO L93 Difference]: Finished difference Result 202 states and 232 transitions. [2018-02-04 13:04:09,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 13:04:09,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 13:04:09,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:09,503 INFO L225 Difference]: With dead ends: 202 [2018-02-04 13:04:09,503 INFO L226 Difference]: Without dead ends: 202 [2018-02-04 13:04:09,503 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:04:09,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-04 13:04:09,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 175. [2018-02-04 13:04:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-04 13:04:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 203 transitions. [2018-02-04 13:04:09,508 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 203 transitions. Word has length 24 [2018-02-04 13:04:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:09,508 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 203 transitions. [2018-02-04 13:04:09,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:04:09,508 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 203 transitions. [2018-02-04 13:04:09,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 13:04:09,509 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:09,509 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:09,509 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:09,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1764795143, now seen corresponding path program 1 times [2018-02-04 13:04:09,509 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:09,509 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:09,510 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:09,510 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:09,510 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:09,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:09,690 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 13:04:09,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:09,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 13:04:09,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 13:04:09,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 13:04:09,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-04 13:04:09,691 INFO L87 Difference]: Start difference. First operand 175 states and 203 transitions. Second operand 12 states. [2018-02-04 13:04:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:10,080 INFO L93 Difference]: Finished difference Result 191 states and 222 transitions. [2018-02-04 13:04:10,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 13:04:10,080 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-02-04 13:04:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:10,080 INFO L225 Difference]: With dead ends: 191 [2018-02-04 13:04:10,081 INFO L226 Difference]: Without dead ends: 191 [2018-02-04 13:04:10,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2018-02-04 13:04:10,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-04 13:04:10,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 176. [2018-02-04 13:04:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-04 13:04:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 205 transitions. [2018-02-04 13:04:10,084 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 205 transitions. Word has length 25 [2018-02-04 13:04:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:10,084 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 205 transitions. [2018-02-04 13:04:10,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 13:04:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 205 transitions. [2018-02-04 13:04:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 13:04:10,085 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:10,085 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:10,086 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:10,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1764795144, now seen corresponding path program 1 times [2018-02-04 13:04:10,086 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:10,086 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:10,087 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:10,087 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:10,087 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:10,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:10,276 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 13:04:10,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:10,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 13:04:10,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 13:04:10,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 13:04:10,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:04:10,277 INFO L87 Difference]: Start difference. First operand 176 states and 205 transitions. Second operand 11 states. [2018-02-04 13:04:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:10,680 INFO L93 Difference]: Finished difference Result 240 states and 267 transitions. [2018-02-04 13:04:10,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 13:04:10,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-02-04 13:04:10,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:10,682 INFO L225 Difference]: With dead ends: 240 [2018-02-04 13:04:10,682 INFO L226 Difference]: Without dead ends: 240 [2018-02-04 13:04:10,682 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2018-02-04 13:04:10,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-04 13:04:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 192. [2018-02-04 13:04:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-04 13:04:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 228 transitions. [2018-02-04 13:04:10,686 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 228 transitions. Word has length 25 [2018-02-04 13:04:10,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:10,686 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 228 transitions. [2018-02-04 13:04:10,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 13:04:10,687 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 228 transitions. [2018-02-04 13:04:10,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 13:04:10,687 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:10,687 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:10,687 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:10,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2572345, now seen corresponding path program 1 times [2018-02-04 13:04:10,688 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:10,688 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:10,689 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:10,689 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:10,689 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:10,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:10,718 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 13:04:10,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:10,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:04:10,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:04:10,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:04:10,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:04:10,719 INFO L87 Difference]: Start difference. First operand 192 states and 228 transitions. Second operand 5 states. [2018-02-04 13:04:10,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:10,862 INFO L93 Difference]: Finished difference Result 276 states and 328 transitions. [2018-02-04 13:04:10,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:04:10,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-04 13:04:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:10,864 INFO L225 Difference]: With dead ends: 276 [2018-02-04 13:04:10,864 INFO L226 Difference]: Without dead ends: 276 [2018-02-04 13:04:10,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:04:10,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-04 13:04:10,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 191. [2018-02-04 13:04:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 13:04:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 226 transitions. [2018-02-04 13:04:10,867 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 226 transitions. Word has length 25 [2018-02-04 13:04:10,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:10,867 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 226 transitions. [2018-02-04 13:04:10,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:04:10,867 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 226 transitions. [2018-02-04 13:04:10,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 13:04:10,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:10,868 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:10,868 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:10,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2572346, now seen corresponding path program 1 times [2018-02-04 13:04:10,868 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:10,868 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:10,869 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:10,869 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:10,869 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:10,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:10,907 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 13:04:10,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:10,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:04:10,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:04:10,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:04:10,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:04:10,908 INFO L87 Difference]: Start difference. First operand 191 states and 226 transitions. Second operand 5 states. [2018-02-04 13:04:11,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:11,087 INFO L93 Difference]: Finished difference Result 336 states and 397 transitions. [2018-02-04 13:04:11,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:04:11,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-04 13:04:11,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:11,088 INFO L225 Difference]: With dead ends: 336 [2018-02-04 13:04:11,088 INFO L226 Difference]: Without dead ends: 336 [2018-02-04 13:04:11,088 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:04:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-04 13:04:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 190. [2018-02-04 13:04:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-04 13:04:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 224 transitions. [2018-02-04 13:04:11,091 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 224 transitions. Word has length 25 [2018-02-04 13:04:11,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:11,091 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 224 transitions. [2018-02-04 13:04:11,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:04:11,091 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 224 transitions. [2018-02-04 13:04:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 13:04:11,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:11,092 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:11,092 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:11,092 INFO L82 PathProgramCache]: Analyzing trace with hash -676623804, now seen corresponding path program 1 times [2018-02-04 13:04:11,092 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:11,092 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:11,093 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:11,093 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:11,093 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:11,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:11,157 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 13:04:11,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:11,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:04:11,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:04:11,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:04:11,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:04:11,157 INFO L87 Difference]: Start difference. First operand 190 states and 224 transitions. Second operand 9 states. [2018-02-04 13:04:11,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:11,430 INFO L93 Difference]: Finished difference Result 227 states and 268 transitions. [2018-02-04 13:04:11,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:04:11,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-04 13:04:11,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:11,430 INFO L225 Difference]: With dead ends: 227 [2018-02-04 13:04:11,431 INFO L226 Difference]: Without dead ends: 227 [2018-02-04 13:04:11,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:04:11,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-04 13:04:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 189. [2018-02-04 13:04:11,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-04 13:04:11,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 222 transitions. [2018-02-04 13:04:11,433 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 222 transitions. Word has length 28 [2018-02-04 13:04:11,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:11,433 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 222 transitions. [2018-02-04 13:04:11,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:04:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 222 transitions. [2018-02-04 13:04:11,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 13:04:11,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:11,433 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:11,433 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:11,434 INFO L82 PathProgramCache]: Analyzing trace with hash -676623803, now seen corresponding path program 1 times [2018-02-04 13:04:11,434 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:11,434 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:11,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:11,434 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:11,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:11,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:04:11,514 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:11,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:04:11,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:04:11,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:04:11,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:04:11,514 INFO L87 Difference]: Start difference. First operand 189 states and 222 transitions. Second operand 9 states. [2018-02-04 13:04:11,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:11,763 INFO L93 Difference]: Finished difference Result 226 states and 266 transitions. [2018-02-04 13:04:11,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:04:11,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-04 13:04:11,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:11,764 INFO L225 Difference]: With dead ends: 226 [2018-02-04 13:04:11,764 INFO L226 Difference]: Without dead ends: 226 [2018-02-04 13:04:11,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:04:11,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-04 13:04:11,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 188. [2018-02-04 13:04:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 13:04:11,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 220 transitions. [2018-02-04 13:04:11,768 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 220 transitions. Word has length 28 [2018-02-04 13:04:11,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:11,768 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 220 transitions. [2018-02-04 13:04:11,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:04:11,768 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 220 transitions. [2018-02-04 13:04:11,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 13:04:11,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:11,768 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:11,769 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:11,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1254885066, now seen corresponding path program 1 times [2018-02-04 13:04:11,769 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:11,769 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:11,770 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:11,770 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:11,770 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:11,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:11,819 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 13:04:11,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:11,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:04:11,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:04:11,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:04:11,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:04:11,820 INFO L87 Difference]: Start difference. First operand 188 states and 220 transitions. Second operand 4 states. [2018-02-04 13:04:11,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:11,922 INFO L93 Difference]: Finished difference Result 243 states and 280 transitions. [2018-02-04 13:04:11,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:04:11,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 13:04:11,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:11,923 INFO L225 Difference]: With dead ends: 243 [2018-02-04 13:04:11,924 INFO L226 Difference]: Without dead ends: 243 [2018-02-04 13:04:11,924 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 13:04:11,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-04 13:04:11,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 186. [2018-02-04 13:04:11,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 13:04:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 216 transitions. [2018-02-04 13:04:11,927 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 216 transitions. Word has length 29 [2018-02-04 13:04:11,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:11,927 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 216 transitions. [2018-02-04 13:04:11,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:04:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 216 transitions. [2018-02-04 13:04:11,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 13:04:11,928 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:11,928 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:11,928 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:11,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1254885065, now seen corresponding path program 1 times [2018-02-04 13:04:11,928 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:11,929 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:11,929 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:11,929 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:11,929 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:11,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:11,950 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 13:04:11,951 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:11,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:04:11,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:04:11,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:04:11,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:04:11,951 INFO L87 Difference]: Start difference. First operand 186 states and 216 transitions. Second operand 4 states. [2018-02-04 13:04:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:12,044 INFO L93 Difference]: Finished difference Result 212 states and 246 transitions. [2018-02-04 13:04:12,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:04:12,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 13:04:12,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:12,045 INFO L225 Difference]: With dead ends: 212 [2018-02-04 13:04:12,045 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 13:04:12,045 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 13:04:12,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 13:04:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 185. [2018-02-04 13:04:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-04 13:04:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 214 transitions. [2018-02-04 13:04:12,049 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 214 transitions. Word has length 29 [2018-02-04 13:04:12,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:12,049 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 214 transitions. [2018-02-04 13:04:12,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:04:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 214 transitions. [2018-02-04 13:04:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 13:04:12,050 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:12,050 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:12,050 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:12,050 INFO L82 PathProgramCache]: Analyzing trace with hash 570395414, now seen corresponding path program 1 times [2018-02-04 13:04:12,050 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:12,050 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:12,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:12,051 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:12,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:12,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:12,079 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 13:04:12,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:12,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:04:12,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:04:12,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:04:12,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:04:12,081 INFO L87 Difference]: Start difference. First operand 185 states and 214 transitions. Second operand 5 states. [2018-02-04 13:04:12,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:12,208 INFO L93 Difference]: Finished difference Result 267 states and 310 transitions. [2018-02-04 13:04:12,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:04:12,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-04 13:04:12,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:12,209 INFO L225 Difference]: With dead ends: 267 [2018-02-04 13:04:12,209 INFO L226 Difference]: Without dead ends: 267 [2018-02-04 13:04:12,209 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:04:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-04 13:04:12,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 184. [2018-02-04 13:04:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-04 13:04:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 212 transitions. [2018-02-04 13:04:12,211 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 212 transitions. Word has length 29 [2018-02-04 13:04:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:12,211 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 212 transitions. [2018-02-04 13:04:12,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:04:12,211 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 212 transitions. [2018-02-04 13:04:12,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 13:04:12,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:12,212 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:12,212 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:12,212 INFO L82 PathProgramCache]: Analyzing trace with hash 570395415, now seen corresponding path program 1 times [2018-02-04 13:04:12,212 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:12,212 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:12,212 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:12,212 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:12,213 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:12,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:12,243 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 13:04:12,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:12,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:04:12,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:04:12,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:04:12,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:04:12,244 INFO L87 Difference]: Start difference. First operand 184 states and 212 transitions. Second operand 5 states. [2018-02-04 13:04:12,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:12,486 INFO L93 Difference]: Finished difference Result 324 states and 373 transitions. [2018-02-04 13:04:12,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:04:12,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-04 13:04:12,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:12,487 INFO L225 Difference]: With dead ends: 324 [2018-02-04 13:04:12,487 INFO L226 Difference]: Without dead ends: 324 [2018-02-04 13:04:12,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:04:12,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-02-04 13:04:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 183. [2018-02-04 13:04:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 13:04:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 210 transitions. [2018-02-04 13:04:12,491 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 210 transitions. Word has length 29 [2018-02-04 13:04:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:12,491 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 210 transitions. [2018-02-04 13:04:12,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:04:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 210 transitions. [2018-02-04 13:04:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 13:04:12,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:12,492 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:12,492 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:12,492 INFO L82 PathProgramCache]: Analyzing trace with hash -526012245, now seen corresponding path program 1 times [2018-02-04 13:04:12,492 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:12,492 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:12,493 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:12,493 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:12,493 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:12,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:12,516 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 13:04:12,517 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:12,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:04:12,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:04:12,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:04:12,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:04:12,517 INFO L87 Difference]: Start difference. First operand 183 states and 210 transitions. Second operand 4 states. [2018-02-04 13:04:12,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:12,606 INFO L93 Difference]: Finished difference Result 197 states and 225 transitions. [2018-02-04 13:04:12,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:04:12,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-02-04 13:04:12,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:12,609 INFO L225 Difference]: With dead ends: 197 [2018-02-04 13:04:12,609 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 13:04:12,610 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 13:04:12,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 13:04:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 182. [2018-02-04 13:04:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 13:04:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 208 transitions. [2018-02-04 13:04:12,613 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 208 transitions. Word has length 31 [2018-02-04 13:04:12,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:12,613 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 208 transitions. [2018-02-04 13:04:12,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:04:12,613 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 208 transitions. [2018-02-04 13:04:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 13:04:12,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:12,614 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:12,614 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:12,614 INFO L82 PathProgramCache]: Analyzing trace with hash -526012244, now seen corresponding path program 1 times [2018-02-04 13:04:12,614 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:12,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:12,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:12,615 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:12,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:12,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:12,650 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 13:04:12,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:12,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:04:12,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:04:12,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:04:12,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:04:12,651 INFO L87 Difference]: Start difference. First operand 182 states and 208 transitions. Second operand 4 states. [2018-02-04 13:04:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:12,758 INFO L93 Difference]: Finished difference Result 220 states and 246 transitions. [2018-02-04 13:04:12,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:04:12,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-02-04 13:04:12,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:12,759 INFO L225 Difference]: With dead ends: 220 [2018-02-04 13:04:12,759 INFO L226 Difference]: Without dead ends: 220 [2018-02-04 13:04:12,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 13:04:12,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-04 13:04:12,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 180. [2018-02-04 13:04:12,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 13:04:12,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 204 transitions. [2018-02-04 13:04:12,763 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 204 transitions. Word has length 31 [2018-02-04 13:04:12,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:12,763 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 204 transitions. [2018-02-04 13:04:12,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:04:12,763 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 204 transitions. [2018-02-04 13:04:12,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 13:04:12,763 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:12,763 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:12,764 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:12,764 INFO L82 PathProgramCache]: Analyzing trace with hash 886820396, now seen corresponding path program 1 times [2018-02-04 13:04:12,764 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:12,764 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:12,765 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:12,765 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:12,765 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:12,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:04:12,817 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:04:12,818 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:04:12,829 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:12,870 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:04:12,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:04:12,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:04:12,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:04:12,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:12,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:04:12,930 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 13:04:12,930 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:04:12,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:12,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:12,935 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-02-04 13:04:12,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-02-04 13:04:12,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:04:12,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 13:04:12,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:04:12,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:12,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-02-04 13:04:12,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:04:12,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 13:04:12,981 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:04:12,985 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:13,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:13,027 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-02-04 13:04:13,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-04 13:04:13,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 13:04:13,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:04:13,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:13,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-04 13:04:13,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 13:04:13,071 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:04:13,072 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:13,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:13,075 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-02-04 13:04:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:04:13,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:04:13,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-02-04 13:04:13,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:04:13,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:04:13,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:04:13,114 INFO L87 Difference]: Start difference. First operand 180 states and 204 transitions. Second operand 5 states. [2018-02-04 13:04:13,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:13,185 INFO L93 Difference]: Finished difference Result 191 states and 216 transitions. [2018-02-04 13:04:13,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:04:13,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-04 13:04:13,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:13,186 INFO L225 Difference]: With dead ends: 191 [2018-02-04 13:04:13,186 INFO L226 Difference]: Without dead ends: 191 [2018-02-04 13:04:13,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:04:13,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-04 13:04:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2018-02-04 13:04:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-04 13:04:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 210 transitions. [2018-02-04 13:04:13,189 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 210 transitions. Word has length 32 [2018-02-04 13:04:13,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:13,190 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 210 transitions. [2018-02-04 13:04:13,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:04:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 210 transitions. [2018-02-04 13:04:13,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 13:04:13,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:13,190 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:13,190 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:13,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1759246890, now seen corresponding path program 1 times [2018-02-04 13:04:13,191 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:13,191 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:13,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:13,191 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:13,192 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:13,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:13,286 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 13:04:13,286 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:13,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:04:13,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:04:13,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:04:13,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:04:13,287 INFO L87 Difference]: Start difference. First operand 185 states and 210 transitions. Second operand 9 states. [2018-02-04 13:04:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:13,576 INFO L93 Difference]: Finished difference Result 192 states and 219 transitions. [2018-02-04 13:04:13,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:04:13,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 13:04:13,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:13,577 INFO L225 Difference]: With dead ends: 192 [2018-02-04 13:04:13,577 INFO L226 Difference]: Without dead ends: 192 [2018-02-04 13:04:13,577 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:04:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-04 13:04:13,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 184. [2018-02-04 13:04:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-04 13:04:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 209 transitions. [2018-02-04 13:04:13,581 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 209 transitions. Word has length 32 [2018-02-04 13:04:13,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:13,581 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 209 transitions. [2018-02-04 13:04:13,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:04:13,581 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 209 transitions. [2018-02-04 13:04:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 13:04:13,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:13,582 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:13,582 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:13,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1759246889, now seen corresponding path program 1 times [2018-02-04 13:04:13,582 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:13,582 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:13,583 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:13,583 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:13,583 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:13,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:13,662 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 13:04:13,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:13,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:04:13,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:04:13,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:04:13,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:04:13,663 INFO L87 Difference]: Start difference. First operand 184 states and 209 transitions. Second operand 9 states. [2018-02-04 13:04:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:13,939 INFO L93 Difference]: Finished difference Result 191 states and 218 transitions. [2018-02-04 13:04:13,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:04:13,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 13:04:13,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:13,940 INFO L225 Difference]: With dead ends: 191 [2018-02-04 13:04:13,940 INFO L226 Difference]: Without dead ends: 191 [2018-02-04 13:04:13,941 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:04:13,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-04 13:04:13,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 183. [2018-02-04 13:04:13,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 13:04:13,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 208 transitions. [2018-02-04 13:04:13,943 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 208 transitions. Word has length 32 [2018-02-04 13:04:13,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:13,943 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 208 transitions. [2018-02-04 13:04:13,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:04:13,944 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2018-02-04 13:04:13,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 13:04:13,944 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:13,944 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:13,944 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:13,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1721628592, now seen corresponding path program 1 times [2018-02-04 13:04:13,944 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:13,944 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:13,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:13,945 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:13,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:13,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:04:14,289 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:04:14,289 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:04:14,294 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:14,322 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:04:14,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 13:04:14,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 13:04:14,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:04:14,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:14,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:14,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:57 [2018-02-04 13:04:14,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-02-04 13:04:14,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2018-02-04 13:04:14,563 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:04:14,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:04:14,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:04:14,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:72 [2018-02-04 13:04:14,786 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int) (main_~n~0.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~n~0.base 1))) (and (not (= 0 main_~n~0.base)) (= 0 (select .cse0 v_prenex_2)) (not (= v_prenex_2 0)) (= (select |c_old(#valid)| main_~n~0.base) 0) (= |c_#valid| (store (store .cse0 v_prenex_2 0) main_~n~0.base 0))))) is different from true [2018-02-04 13:04:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-04 13:04:14,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:04:14,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2018-02-04 13:04:14,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 13:04:14,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 13:04:14,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=4, NotChecked=48, Total=702 [2018-02-04 13:04:14,814 INFO L87 Difference]: Start difference. First operand 183 states and 208 transitions. Second operand 27 states. [2018-02-04 13:04:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:16,338 INFO L93 Difference]: Finished difference Result 212 states and 239 transitions. [2018-02-04 13:04:16,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 13:04:16,338 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2018-02-04 13:04:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:16,339 INFO L225 Difference]: With dead ends: 212 [2018-02-04 13:04:16,339 INFO L226 Difference]: Without dead ends: 207 [2018-02-04 13:04:16,339 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=217, Invalid=1417, Unknown=10, NotChecked=78, Total=1722 [2018-02-04 13:04:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-04 13:04:16,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199. [2018-02-04 13:04:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 13:04:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 225 transitions. [2018-02-04 13:04:16,342 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 225 transitions. Word has length 33 [2018-02-04 13:04:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:16,343 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 225 transitions. [2018-02-04 13:04:16,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 13:04:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 225 transitions. [2018-02-04 13:04:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 13:04:16,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:16,343 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:16,343 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:16,344 INFO L82 PathProgramCache]: Analyzing trace with hash 583502853, now seen corresponding path program 1 times [2018-02-04 13:04:16,344 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:16,344 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:16,344 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:16,345 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:16,345 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:16,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:04:16,411 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:16,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:04:16,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:04:16,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:04:16,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:04:16,412 INFO L87 Difference]: Start difference. First operand 199 states and 225 transitions. Second operand 7 states. [2018-02-04 13:04:16,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:16,623 INFO L93 Difference]: Finished difference Result 217 states and 244 transitions. [2018-02-04 13:04:16,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:04:16,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-02-04 13:04:16,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:16,624 INFO L225 Difference]: With dead ends: 217 [2018-02-04 13:04:16,624 INFO L226 Difference]: Without dead ends: 217 [2018-02-04 13:04:16,624 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-02-04 13:04:16,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-04 13:04:16,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 206. [2018-02-04 13:04:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-04 13:04:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2018-02-04 13:04:16,626 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 38 [2018-02-04 13:04:16,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:16,626 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2018-02-04 13:04:16,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:04:16,626 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2018-02-04 13:04:16,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 13:04:16,626 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:16,626 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:16,626 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:16,627 INFO L82 PathProgramCache]: Analyzing trace with hash 583502854, now seen corresponding path program 1 times [2018-02-04 13:04:16,627 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:16,627 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:16,627 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:16,628 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:16,628 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:16,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:04:16,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:16,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:04:16,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:04:16,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:04:16,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:04:16,691 INFO L87 Difference]: Start difference. First operand 206 states and 236 transitions. Second operand 5 states. [2018-02-04 13:04:16,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:16,835 INFO L93 Difference]: Finished difference Result 262 states and 292 transitions. [2018-02-04 13:04:16,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:04:16,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-04 13:04:16,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:16,836 INFO L225 Difference]: With dead ends: 262 [2018-02-04 13:04:16,836 INFO L226 Difference]: Without dead ends: 262 [2018-02-04 13:04:16,836 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 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 13:04:16,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-04 13:04:16,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 208. [2018-02-04 13:04:16,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 13:04:16,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 236 transitions. [2018-02-04 13:04:16,840 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 236 transitions. Word has length 38 [2018-02-04 13:04:16,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:16,840 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 236 transitions. [2018-02-04 13:04:16,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:04:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 236 transitions. [2018-02-04 13:04:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 13:04:16,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:16,840 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:16,841 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:16,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1439020069, now seen corresponding path program 1 times [2018-02-04 13:04:16,841 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:16,841 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:16,842 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:16,842 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:16,842 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:16,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:16,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:04:16,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:16,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:04:16,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:04:16,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:04:16,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:04:16,904 INFO L87 Difference]: Start difference. First operand 208 states and 236 transitions. Second operand 7 states. [2018-02-04 13:04:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:17,116 INFO L93 Difference]: Finished difference Result 253 states and 283 transitions. [2018-02-04 13:04:17,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 13:04:17,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-02-04 13:04:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:17,117 INFO L225 Difference]: With dead ends: 253 [2018-02-04 13:04:17,117 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 13:04:17,118 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-02-04 13:04:17,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 13:04:17,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 216. [2018-02-04 13:04:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 13:04:17,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 250 transitions. [2018-02-04 13:04:17,120 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 250 transitions. Word has length 38 [2018-02-04 13:04:17,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:17,120 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 250 transitions. [2018-02-04 13:04:17,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:04:17,120 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 250 transitions. [2018-02-04 13:04:17,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 13:04:17,120 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:17,120 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:17,120 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:17,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1439020070, now seen corresponding path program 1 times [2018-02-04 13:04:17,121 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:17,121 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:17,121 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:17,121 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:17,121 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:17,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:04:17,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:17,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:04:17,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:04:17,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:04:17,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:04:17,178 INFO L87 Difference]: Start difference. First operand 216 states and 250 transitions. Second operand 5 states. [2018-02-04 13:04:17,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:17,295 INFO L93 Difference]: Finished difference Result 295 states and 330 transitions. [2018-02-04 13:04:17,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:04:17,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-04 13:04:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:17,296 INFO L225 Difference]: With dead ends: 295 [2018-02-04 13:04:17,296 INFO L226 Difference]: Without dead ends: 295 [2018-02-04 13:04:17,296 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:04:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-02-04 13:04:17,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 209. [2018-02-04 13:04:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-04 13:04:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 239 transitions. [2018-02-04 13:04:17,300 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 239 transitions. Word has length 38 [2018-02-04 13:04:17,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:17,300 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 239 transitions. [2018-02-04 13:04:17,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:04:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 239 transitions. [2018-02-04 13:04:17,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 13:04:17,301 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:17,301 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:17,301 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:17,301 INFO L82 PathProgramCache]: Analyzing trace with hash 908719351, now seen corresponding path program 1 times [2018-02-04 13:04:17,301 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:17,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:17,302 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:17,302 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:17,302 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:17,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:04:17,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:17,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:04:17,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:04:17,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:04:17,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:04:17,346 INFO L87 Difference]: Start difference. First operand 209 states and 239 transitions. Second operand 5 states. [2018-02-04 13:04:17,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:17,378 INFO L93 Difference]: Finished difference Result 279 states and 317 transitions. [2018-02-04 13:04:17,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:04:17,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-04 13:04:17,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:17,378 INFO L225 Difference]: With dead ends: 279 [2018-02-04 13:04:17,378 INFO L226 Difference]: Without dead ends: 279 [2018-02-04 13:04:17,379 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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 13:04:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-04 13:04:17,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 213. [2018-02-04 13:04:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-04 13:04:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 244 transitions. [2018-02-04 13:04:17,382 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 244 transitions. Word has length 39 [2018-02-04 13:04:17,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:17,382 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 244 transitions. [2018-02-04 13:04:17,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:04:17,382 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 244 transitions. [2018-02-04 13:04:17,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 13:04:17,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:17,382 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:17,383 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:17,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1659949271, now seen corresponding path program 1 times [2018-02-04 13:04:17,383 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:17,383 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:17,383 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:17,383 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:17,383 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:17,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:04:17,417 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:17,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:04:17,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:04:17,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:04:17,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:04:17,417 INFO L87 Difference]: Start difference. First operand 213 states and 244 transitions. Second operand 5 states. [2018-02-04 13:04:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:17,472 INFO L93 Difference]: Finished difference Result 292 states and 325 transitions. [2018-02-04 13:04:17,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:04:17,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-04 13:04:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:17,473 INFO L225 Difference]: With dead ends: 292 [2018-02-04 13:04:17,473 INFO L226 Difference]: Without dead ends: 292 [2018-02-04 13:04:17,474 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:04:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-04 13:04:17,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 209. [2018-02-04 13:04:17,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-04 13:04:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 238 transitions. [2018-02-04 13:04:17,477 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 238 transitions. Word has length 39 [2018-02-04 13:04:17,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:17,477 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 238 transitions. [2018-02-04 13:04:17,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:04:17,478 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 238 transitions. [2018-02-04 13:04:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 13:04:17,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:17,478 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:17,478 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:17,478 INFO L82 PathProgramCache]: Analyzing trace with hash 2011206561, now seen corresponding path program 1 times [2018-02-04 13:04:17,478 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:17,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:17,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:17,479 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:17,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:17,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:04:17,936 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:17,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-04 13:04:17,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:04:17,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:04:17,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:04:17,936 INFO L87 Difference]: Start difference. First operand 209 states and 238 transitions. Second operand 19 states. [2018-02-04 13:04:18,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:18,944 INFO L93 Difference]: Finished difference Result 243 states and 275 transitions. [2018-02-04 13:04:18,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 13:04:18,944 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-02-04 13:04:18,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:18,945 INFO L225 Difference]: With dead ends: 243 [2018-02-04 13:04:18,945 INFO L226 Difference]: Without dead ends: 234 [2018-02-04 13:04:18,945 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=349, Invalid=1543, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 13:04:18,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-04 13:04:18,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 207. [2018-02-04 13:04:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-04 13:04:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 235 transitions. [2018-02-04 13:04:18,947 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 235 transitions. Word has length 43 [2018-02-04 13:04:18,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:18,947 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 235 transitions. [2018-02-04 13:04:18,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:04:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 235 transitions. [2018-02-04 13:04:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 13:04:18,948 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:18,948 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:18,948 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:18,948 INFO L82 PathProgramCache]: Analyzing trace with hash -334069887, now seen corresponding path program 1 times [2018-02-04 13:04:18,948 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:18,948 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:18,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:18,949 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:18,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:18,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:19,202 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:04:19,202 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:04:19,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 13:04:19,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 13:04:19,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 13:04:19,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-02-04 13:04:19,203 INFO L87 Difference]: Start difference. First operand 207 states and 235 transitions. Second operand 14 states. [2018-02-04 13:04:19,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:04:19,763 INFO L93 Difference]: Finished difference Result 215 states and 243 transitions. [2018-02-04 13:04:19,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 13:04:19,763 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-02-04 13:04:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:04:19,764 INFO L225 Difference]: With dead ends: 215 [2018-02-04 13:04:19,764 INFO L226 Difference]: Without dead ends: 200 [2018-02-04 13:04:19,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2018-02-04 13:04:19,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-04 13:04:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 193. [2018-02-04 13:04:19,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 13:04:19,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 220 transitions. [2018-02-04 13:04:19,766 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 220 transitions. Word has length 43 [2018-02-04 13:04:19,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:04:19,766 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 220 transitions. [2018-02-04 13:04:19,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 13:04:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 220 transitions. [2018-02-04 13:04:19,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 13:04:19,766 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:04:19,766 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:04:19,766 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:04:19,766 INFO L82 PathProgramCache]: Analyzing trace with hash -507539475, now seen corresponding path program 1 times [2018-02-04 13:04:19,767 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:04:19,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:04:19,767 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:19,767 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:19,767 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:04:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:19,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:04:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:04:20,092 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:04:20,093 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:04:20,097 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:04:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:04:20,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:04:20,204 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:04:20,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:04:20,205 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 13:04:20,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:04:20,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:20,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-02-04 13:04:20,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-04 13:04:20,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:04:20,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 13:04:20,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:04:20,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:20,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-04 13:04:20,290 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:04:20,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 13:04:20,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:04:20,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:20,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:20,308 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:56 [2018-02-04 13:04:20,383 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:04:20,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 72 [2018-02-04 13:04:20,391 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 14 treesize of output 13 [2018-02-04 13:04:20,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:04:20,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:20,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-02-04 13:04:20,432 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 14 treesize of output 13 [2018-02-04 13:04:20,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:04:20,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:20,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:04:20,449 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:82 [2018-02-04 13:04:20,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2018-02-04 13:04:20,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-02-04 13:04:20,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:04:20,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:20,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 81 [2018-02-04 13:04:20,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-02-04 13:04:20,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:04:20,555 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:20,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:04:20,565 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:126, output treesize:106 [2018-02-04 13:04:26,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-02-04 13:04:26,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:04:26,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-02-04 13:04:26,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:04:26,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 13:04:26,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:04:26,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:04:26,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:04:26,676 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:94, output treesize:59 [2018-02-04 13:04:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:04:26,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:04:26,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 33 [2018-02-04 13:04:26,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 13:04:26,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 13:04:26,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=890, Unknown=3, NotChecked=0, Total=1056 [2018-02-04 13:04:26,750 INFO L87 Difference]: Start difference. First operand 193 states and 220 transitions. Second operand 33 states. [2018-02-04 13:04:53,635 WARN L146 SmtUtils]: Spent 2044ms on a formula simplification. DAG size of input: 96 DAG size of output 54 [2018-02-04 13:05:01,371 WARN L146 SmtUtils]: Spent 2042ms on a formula simplification. DAG size of input: 88 DAG size of output 51 [2018-02-04 13:05:08,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:05:08,011 INFO L93 Difference]: Finished difference Result 258 states and 296 transitions. [2018-02-04 13:05:08,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 13:05:08,011 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 48 [2018-02-04 13:05:08,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:05:08,012 INFO L225 Difference]: With dead ends: 258 [2018-02-04 13:05:08,012 INFO L226 Difference]: Without dead ends: 258 [2018-02-04 13:05:08,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 36.4s TimeCoverageRelationStatistics Valid=566, Invalid=2070, Unknown=16, NotChecked=0, Total=2652 [2018-02-04 13:05:08,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-04 13:05:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 216. [2018-02-04 13:05:08,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 13:05:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 248 transitions. [2018-02-04 13:05:08,015 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 248 transitions. Word has length 48 [2018-02-04 13:05:08,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:05:08,015 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 248 transitions. [2018-02-04 13:05:08,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 13:05:08,015 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 248 transitions. [2018-02-04 13:05:08,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 13:05:08,015 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:05:08,015 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:05:08,015 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:05:08,015 INFO L82 PathProgramCache]: Analyzing trace with hash -822481427, now seen corresponding path program 1 times [2018-02-04 13:05:08,016 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:05:08,016 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:05:08,016 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:05:08,016 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:05:08,016 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:05:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:05:08,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:05:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:05:08,123 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:05:08,123 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:05:08,128 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:05:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:05:08,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:05:08,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:05:08,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:05:08,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 13:05:08,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:05:08,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:05:08,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-02-04 13:05:08,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:05:08,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:05:08,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:05:08,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:05:08,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:05:08,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-04 13:05:08,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:05:08,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-02-04 13:05:08,228 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 12 treesize of output 11 [2018-02-04 13:05:08,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:05:08,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:05:08,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:05:08,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-02-04 13:05:08,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-02-04 13:05:08,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-02-04 13:05:08,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:05:08,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:05:08,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:05:08,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:47 [2018-02-04 13:05:14,311 WARN L146 SmtUtils]: Spent 2009ms on a formula simplification. DAG size of input: 26 DAG size of output 22 [2018-02-04 13:05:16,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-02-04 13:05:16,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-04 13:05:16,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:05:16,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 13:05:16,359 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:05:16,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:05:16,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:05:16,364 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-02-04 13:05:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:05:16,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:05:16,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 13:05:16,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 13:05:16,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 13:05:16,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=367, Unknown=3, NotChecked=0, Total=462 [2018-02-04 13:05:16,438 INFO L87 Difference]: Start difference. First operand 216 states and 248 transitions. Second operand 22 states. [2018-02-04 13:06:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:06:00,560 INFO L93 Difference]: Finished difference Result 484 states and 578 transitions. [2018-02-04 13:06:00,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 13:06:00,560 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-02-04 13:06:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:06:00,561 INFO L225 Difference]: With dead ends: 484 [2018-02-04 13:06:00,561 INFO L226 Difference]: Without dead ends: 484 [2018-02-04 13:06:00,561 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 40.5s TimeCoverageRelationStatistics Valid=344, Invalid=897, Unknown=19, NotChecked=0, Total=1260 [2018-02-04 13:06:00,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-02-04 13:06:00,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 261. [2018-02-04 13:06:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-04 13:06:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 316 transitions. [2018-02-04 13:06:00,564 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 316 transitions. Word has length 48 [2018-02-04 13:06:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:06:00,565 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 316 transitions. [2018-02-04 13:06:00,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 13:06:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 316 transitions. [2018-02-04 13:06:00,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 13:06:00,565 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:06:00,565 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:06:00,566 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:06:00,566 INFO L82 PathProgramCache]: Analyzing trace with hash -822481426, now seen corresponding path program 1 times [2018-02-04 13:06:00,566 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:06:00,566 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:06:00,567 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:06:00,567 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:06:00,567 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:06:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:06:00,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:06:00,732 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:06:00,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:06:00,733 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:06:00,740 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:06:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:06:00,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:06:00,778 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 13:06:00,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:00,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:06:00,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:06:00,787 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 13:06:00,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:00,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:00,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-02-04 13:06:00,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:06:00,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:06:00,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:00,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:00,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:06:00,814 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 13:06:00,814 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:00,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:00,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:00,822 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-02-04 13:06:00,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:06:00,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-02-04 13:06:00,870 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 12 treesize of output 11 [2018-02-04 13:06:00,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:00,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:00,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:06:00,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-04 13:06:00,891 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 12 treesize of output 11 [2018-02-04 13:06:00,891 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:00,894 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:00,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:06:00,910 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-02-04 13:06:00,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-02-04 13:06:00,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-02-04 13:06:00,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:00,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:00,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-02-04 13:06:00,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-02-04 13:06:00,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:00,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:00,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:06:00,996 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:73 [2018-02-04 13:06:07,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-02-04 13:06:07,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 13:06:07,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:07,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-02-04 13:06:07,087 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:07,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:07,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-02-04 13:06:07,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 13:06:07,096 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:07,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 13:06:07,099 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:07,102 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:07,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:07,105 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-02-04 13:06:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:06:07,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:06:07,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-02-04 13:06:07,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:06:07,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:06:07,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=277, Unknown=3, NotChecked=0, Total=342 [2018-02-04 13:06:07,142 INFO L87 Difference]: Start difference. First operand 261 states and 316 transitions. Second operand 19 states. [2018-02-04 13:06:09,392 WARN L146 SmtUtils]: Spent 2034ms on a formula simplification. DAG size of input: 91 DAG size of output 47 [2018-02-04 13:06:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:06:10,084 INFO L93 Difference]: Finished difference Result 475 states and 566 transitions. [2018-02-04 13:06:10,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 13:06:10,084 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-02-04 13:06:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:06:10,085 INFO L225 Difference]: With dead ends: 475 [2018-02-04 13:06:10,085 INFO L226 Difference]: Without dead ends: 475 [2018-02-04 13:06:10,085 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=215, Invalid=712, Unknown=3, NotChecked=0, Total=930 [2018-02-04 13:06:10,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-02-04 13:06:10,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 281. [2018-02-04 13:06:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-04 13:06:10,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 340 transitions. [2018-02-04 13:06:10,088 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 340 transitions. Word has length 48 [2018-02-04 13:06:10,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:06:10,088 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 340 transitions. [2018-02-04 13:06:10,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:06:10,088 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 340 transitions. [2018-02-04 13:06:10,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 13:06:10,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:06:10,089 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:06:10,089 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:06:10,089 INFO L82 PathProgramCache]: Analyzing trace with hash -816755789, now seen corresponding path program 1 times [2018-02-04 13:06:10,089 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:06:10,089 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:06:10,089 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:06:10,089 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:06:10,089 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:06:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:06:10,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:06:10,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:06:10,294 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:06:10,294 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:06:10,302 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:06:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:06:10,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:06:10,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 13:06:10,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 13:06:10,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 13:06:10,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 13:06:10,367 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,368 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,373 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-02-04 13:06:10,404 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:06:10,404 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:06:10,405 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 13:06:10,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-02-04 13:06:10,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-02-04 13:06:10,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:06:10,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 13:06:10,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-02-04 13:06:10,457 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:06:10,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 13:06:10,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,469 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:36 [2018-02-04 13:06:10,503 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:06:10,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-04 13:06:10,508 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 12 treesize of output 11 [2018-02-04 13:06:10,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:06:10,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-02-04 13:06:10,526 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 12 treesize of output 11 [2018-02-04 13:06:10,526 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:06:10,538 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:58 [2018-02-04 13:06:10,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-02-04 13:06:10,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-02-04 13:06:10,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2018-02-04 13:06:10,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-02-04 13:06:10,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:10,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 13:06:10,670 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:97, output treesize:81 [2018-02-04 13:06:14,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 58 [2018-02-04 13:06:14,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-02-04 13:06:14,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:14,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:06:14,831 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2018-02-04 13:06:14,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:06:14,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:06:14,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-02-04 13:06:14,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-02-04 13:06:14,852 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:14,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 13:06:14,857 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:06:14,858 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:14,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:06:14,863 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:102, output treesize:7 [2018-02-04 13:06:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:06:14,919 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:06:14,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 26 [2018-02-04 13:06:14,919 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 13:06:14,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 13:06:14,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=572, Unknown=2, NotChecked=0, Total=650 [2018-02-04 13:06:14,920 INFO L87 Difference]: Start difference. First operand 281 states and 340 transitions. Second operand 26 states. [2018-02-04 13:06:57,586 WARN L146 SmtUtils]: Spent 4054ms on a formula simplification. DAG size of input: 82 DAG size of output 53 [2018-02-04 13:07:07,666 WARN L146 SmtUtils]: Spent 4044ms on a formula simplification. DAG size of input: 78 DAG size of output 49 [2018-02-04 13:07:11,735 WARN L146 SmtUtils]: Spent 4046ms on a formula simplification. DAG size of input: 82 DAG size of output 53 [2018-02-04 13:07:21,980 WARN L146 SmtUtils]: Spent 4059ms on a formula simplification. DAG size of input: 81 DAG size of output 51 [2018-02-04 13:07:26,072 WARN L146 SmtUtils]: Spent 4053ms on a formula simplification. DAG size of input: 83 DAG size of output 53 [2018-02-04 13:07:30,152 WARN L146 SmtUtils]: Spent 4053ms on a formula simplification. DAG size of input: 85 DAG size of output 55 [2018-02-04 13:07:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:07:30,693 INFO L93 Difference]: Finished difference Result 429 states and 526 transitions. [2018-02-04 13:07:30,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 13:07:30,693 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-02-04 13:07:30,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:07:30,694 INFO L225 Difference]: With dead ends: 429 [2018-02-04 13:07:30,694 INFO L226 Difference]: Without dead ends: 429 [2018-02-04 13:07:30,694 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 61.6s TimeCoverageRelationStatistics Valid=647, Invalid=2091, Unknown=18, NotChecked=0, Total=2756 [2018-02-04 13:07:30,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-02-04 13:07:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 329. [2018-02-04 13:07:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-02-04 13:07:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 401 transitions. [2018-02-04 13:07:30,698 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 401 transitions. Word has length 48 [2018-02-04 13:07:30,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:07:30,698 INFO L432 AbstractCegarLoop]: Abstraction has 329 states and 401 transitions. [2018-02-04 13:07:30,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 13:07:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 401 transitions. [2018-02-04 13:07:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 13:07:30,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:07:30,699 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:30,699 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 13:07:30,699 INFO L82 PathProgramCache]: Analyzing trace with hash 234285945, now seen corresponding path program 1 times [2018-02-04 13:07:30,699 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:07:30,699 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:07:30,700 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:07:30,700 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:07:30,700 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:07:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:07:30,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:07:30,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:07:30,949 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:07:30,949 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:07:30,954 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:07:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:07:30,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:07:31,002 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:07:31,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:07:31,003 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 13:07:31,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:07:31,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:07:31,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-02-04 13:07:31,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:07:31,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:07:31,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:07:31,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:07:31,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:07:31,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-02-04 13:07:31,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-02-04 13:07:31,080 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 12 treesize of output 11 [2018-02-04 13:07:31,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:07:31,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:07:31,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:07:31,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-02-04 13:07:31,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:07:31,134 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:07:31,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-02-04 13:07:31,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-02-04 13:07:31,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:07:31,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:07:31,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:07:31,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:53 [2018-02-04 13:07:35,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:07:35,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:07:35,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:07:35,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-02-04 13:07:35,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:07:35,203 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 13:07:35,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:59 [2018-02-04 13:07:35,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-02-04 13:07:35,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:07:35,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 54 [2018-02-04 13:07:35,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:07:35,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:07:35,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:07:35,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:77 [2018-02-04 13:07:35,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:07:35,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:07:35,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 99 [2018-02-04 13:07:35,354 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 14 treesize of output 13 [2018-02-04 13:07:35,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:07:35,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:07:35,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:07:35,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:90 [2018-02-04 13:07:35,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 93 [2018-02-04 13:07:35,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-02-04 13:07:35,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:07:35,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:07:35,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 13:07:35,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:109, output treesize:99 [2018-02-04 13:07:41,532 WARN L146 SmtUtils]: Spent 2024ms on a formula simplification. DAG size of input: 40 DAG size of output 36 Received shutdown request... [2018-02-04 13:07:43,555 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 13:07:43,556 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 13:07:43,561 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 13:07:43,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:07:43 BoogieIcfgContainer [2018-02-04 13:07:43,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 13:07:43,562 INFO L168 Benchmark]: Toolchain (without parser) took 216500.39 ms. Allocated memory was 403.2 MB in the beginning and 810.0 MB in the end (delta: 406.8 MB). Free memory was 359.9 MB in the beginning and 469.2 MB in the end (delta: -109.4 MB). Peak memory consumption was 297.5 MB. Max. memory is 5.3 GB. [2018-02-04 13:07:43,565 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 403.2 MB. Free memory is still 366.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 13:07:43,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.73 ms. Allocated memory is still 403.2 MB. Free memory was 359.9 MB in the beginning and 349.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 13:07:43,565 INFO L168 Benchmark]: Boogie Preprocessor took 28.22 ms. Allocated memory is still 403.2 MB. Free memory was 349.3 MB in the beginning and 346.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 13:07:43,565 INFO L168 Benchmark]: RCFGBuilder took 372.89 ms. Allocated memory is still 403.2 MB. Free memory was 346.6 MB in the beginning and 306.9 MB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 5.3 GB. [2018-02-04 13:07:43,566 INFO L168 Benchmark]: TraceAbstraction took 215939.29 ms. Allocated memory was 403.2 MB in the beginning and 810.0 MB in the end (delta: 406.8 MB). Free memory was 306.9 MB in the beginning and 469.2 MB in the end (delta: -162.4 MB). Peak memory consumption was 244.5 MB. Max. memory is 5.3 GB. [2018-02-04 13:07:43,567 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 403.2 MB. Free memory is still 366.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.73 ms. Allocated memory is still 403.2 MB. Free memory was 359.9 MB in the beginning and 349.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.22 ms. Allocated memory is still 403.2 MB. Free memory was 349.3 MB in the beginning and 346.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 372.89 ms. Allocated memory is still 403.2 MB. Free memory was 346.6 MB in the beginning and 306.9 MB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 215939.29 ms. Allocated memory was 403.2 MB in the beginning and 810.0 MB in the end (delta: 406.8 MB). Free memory was 306.9 MB in the beginning and 469.2 MB in the end (delta: -162.4 MB). Peak memory consumption was 244.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 147 locations, 65 error locations. TIMEOUT Result, 215.8s OverallTime, 40 OverallIterations, 3 TraceHistogramMax, 172.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4127 SDtfs, 8704 SDslu, 13712 SDs, 0 SdLazy, 14368 SolverSat, 1030 SolverUnsat, 35 SolverUnknown, 0 SolverNotchecked, 46.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 778 GetRequests, 261 SyntacticMatches, 26 SemanticMatches, 491 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2474 ImplicationChecksByTransitivity, 151.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329occurred in iteration=39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 1824 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 29.8s InterpolantComputationTime, 1415 NumberOfCodeBlocks, 1415 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1370 ConstructedInterpolants, 84 QuantifiedInterpolants, 576767 SizeOfPredicates, 88 NumberOfNonLiveVariables, 1068 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 45 InterpolantComputations, 33 PerfectInterpolantSequences, 60/142 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/tree_stack_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_13-07-43-575.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_stack_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_13-07-43-575.csv Completed graceful shutdown