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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0521_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:01:56,550 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:01:56,552 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:01:56,563 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:01:56,564 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:01:56,564 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:01:56,565 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:01:56,567 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:01:56,569 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:01:56,570 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:01:56,571 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:01:56,571 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:01:56,572 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:01:56,573 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:01:56,574 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:01:56,576 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:01:56,577 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:01:56,579 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:01:56,580 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:01:56,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:01:56,582 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:01:56,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:01:56,583 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:01:56,584 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:01:56,585 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:01:56,586 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:01:56,586 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:01:56,587 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:01:56,587 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:01:56,587 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:01:56,588 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:01:56,588 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 09:01:56,598 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:01:56,598 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:01:56,599 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:01:56,599 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:01:56,599 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:01:56,599 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:01:56,599 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:01:56,599 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:01:56,599 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:01:56,599 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:01:56,599 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:01:56,600 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:01:56,600 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:01:56,600 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:01:56,600 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:01:56,600 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:01:56,600 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:01:56,600 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:01:56,600 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:01:56,600 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:01:56,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:01:56,601 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:01:56,601 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 09:01:56,601 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 09:01:56,601 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 09:01:56,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:01:56,639 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:01:56,642 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:01:56,643 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:01:56,644 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:01:56,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0521_true-valid-memsafety.i [2018-02-02 09:01:56,801 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:01:56,802 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:01:56,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:01:56,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:01:56,808 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:01:56,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:01:56" (1/1) ... [2018-02-02 09:01:56,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1819e0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:56, skipping insertion in model container [2018-02-02 09:01:56,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:01:56" (1/1) ... [2018-02-02 09:01:56,821 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:01:56,851 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:01:56,970 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:01:56,994 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:01:57,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:57 WrapperNode [2018-02-02 09:01:57,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:01:57,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:01:57,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:01:57,004 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:01:57,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:57" (1/1) ... [2018-02-02 09:01:57,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:57" (1/1) ... [2018-02-02 09:01:57,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:57" (1/1) ... [2018-02-02 09:01:57,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:57" (1/1) ... [2018-02-02 09:01:57,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:57" (1/1) ... [2018-02-02 09:01:57,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:57" (1/1) ... [2018-02-02 09:01:57,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:57" (1/1) ... [2018-02-02 09:01:57,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:01:57,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:01:57,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:01:57,044 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:01:57,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:57" (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-02 09:01:57,084 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:01:57,084 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:01:57,085 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:01:57,085 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 09:01:57,085 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 09:01:57,085 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:01:57,085 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:01:57,085 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:01:57,085 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:01:57,085 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:01:57,086 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 09:01:57,086 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 09:01:57,086 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:01:57,086 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:01:57,086 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:01:57,086 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:01:57,630 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:01:57,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:01:57 BoogieIcfgContainer [2018-02-02 09:01:57,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:01:57,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:01:57,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:01:57,634 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:01:57,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:01:56" (1/3) ... [2018-02-02 09:01:57,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738274b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:01:57, skipping insertion in model container [2018-02-02 09:01:57,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:57" (2/3) ... [2018-02-02 09:01:57,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738274b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:01:57, skipping insertion in model container [2018-02-02 09:01:57,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:01:57" (3/3) ... [2018-02-02 09:01:57,637 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0521_true-valid-memsafety.i [2018-02-02 09:01:57,644 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:01:57,651 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 91 error locations. [2018-02-02 09:01:57,681 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:01:57,681 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:01:57,681 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 09:01:57,681 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 09:01:57,681 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:01:57,681 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:01:57,681 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:01:57,682 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:01:57,682 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:01:57,695 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states. [2018-02-02 09:01:57,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 09:01:57,701 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:57,702 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:01:57,702 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:01:57,705 INFO L82 PathProgramCache]: Analyzing trace with hash 2006593009, now seen corresponding path program 1 times [2018-02-02 09:01:57,706 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:57,707 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:57,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:57,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:57,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:57,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:57,796 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-02 09:01:57,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:01:57,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:01:57,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 09:01:57,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 09:01:57,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 09:01:57,875 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 2 states. [2018-02-02 09:01:57,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:57,901 INFO L93 Difference]: Finished difference Result 247 states and 274 transitions. [2018-02-02 09:01:57,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 09:01:57,903 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-02-02 09:01:57,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:57,912 INFO L225 Difference]: With dead ends: 247 [2018-02-02 09:01:57,912 INFO L226 Difference]: Without dead ends: 244 [2018-02-02 09:01:57,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 09:01:57,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-02 09:01:57,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2018-02-02 09:01:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 09:01:57,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 271 transitions. [2018-02-02 09:01:57,947 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 271 transitions. Word has length 10 [2018-02-02 09:01:57,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:57,948 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 271 transitions. [2018-02-02 09:01:57,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 09:01:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 271 transitions. [2018-02-02 09:01:57,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 09:01:57,948 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:57,948 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:01:57,948 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:01:57,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1287736010, now seen corresponding path program 1 times [2018-02-02 09:01:57,949 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:57,949 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:57,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:57,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:57,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:57,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:58,013 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-02 09:01:58,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:01:58,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:01:58,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:01:58,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:01:58,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:01:58,015 INFO L87 Difference]: Start difference. First operand 244 states and 271 transitions. Second operand 4 states. [2018-02-02 09:01:58,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:58,122 INFO L93 Difference]: Finished difference Result 561 states and 618 transitions. [2018-02-02 09:01:58,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:01:58,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 09:01:58,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:58,125 INFO L225 Difference]: With dead ends: 561 [2018-02-02 09:01:58,126 INFO L226 Difference]: Without dead ends: 561 [2018-02-02 09:01:58,127 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-02 09:01:58,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-02-02 09:01:58,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 256. [2018-02-02 09:01:58,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-02 09:01:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 285 transitions. [2018-02-02 09:01:58,141 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 285 transitions. Word has length 12 [2018-02-02 09:01:58,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:58,142 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 285 transitions. [2018-02-02 09:01:58,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:01:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 285 transitions. [2018-02-02 09:01:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:01:58,142 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:58,142 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:01:58,143 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:01:58,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1264312096, now seen corresponding path program 1 times [2018-02-02 09:01:58,143 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:58,143 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:58,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:58,144 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:58,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:58,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:58,175 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-02 09:01:58,176 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:01:58,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:01:58,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:01:58,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:01:58,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:01:58,177 INFO L87 Difference]: Start difference. First operand 256 states and 285 transitions. Second operand 4 states. [2018-02-02 09:01:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:58,475 INFO L93 Difference]: Finished difference Result 416 states and 464 transitions. [2018-02-02 09:01:58,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:01:58,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 09:01:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:58,477 INFO L225 Difference]: With dead ends: 416 [2018-02-02 09:01:58,477 INFO L226 Difference]: Without dead ends: 416 [2018-02-02 09:01:58,477 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-02 09:01:58,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-02-02 09:01:58,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 254. [2018-02-02 09:01:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 09:01:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 283 transitions. [2018-02-02 09:01:58,488 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 283 transitions. Word has length 13 [2018-02-02 09:01:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:58,488 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 283 transitions. [2018-02-02 09:01:58,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:01:58,488 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 283 transitions. [2018-02-02 09:01:58,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:01:58,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:58,489 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:01:58,489 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:01:58,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1264312095, now seen corresponding path program 1 times [2018-02-02 09:01:58,489 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:58,490 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:58,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:58,491 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:58,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:58,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:58,572 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-02 09:01:58,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:01:58,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:01:58,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:01:58,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:01:58,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:01:58,575 INFO L87 Difference]: Start difference. First operand 254 states and 283 transitions. Second operand 4 states. [2018-02-02 09:01:58,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:58,740 INFO L93 Difference]: Finished difference Result 349 states and 392 transitions. [2018-02-02 09:01:58,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:01:58,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 09:01:58,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:58,741 INFO L225 Difference]: With dead ends: 349 [2018-02-02 09:01:58,741 INFO L226 Difference]: Without dead ends: 349 [2018-02-02 09:01:58,742 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:01:58,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-02-02 09:01:58,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 252. [2018-02-02 09:01:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-02-02 09:01:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 281 transitions. [2018-02-02 09:01:58,746 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 281 transitions. Word has length 13 [2018-02-02 09:01:58,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:58,747 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 281 transitions. [2018-02-02 09:01:58,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:01:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 281 transitions. [2018-02-02 09:01:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 09:01:58,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:58,747 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:01:58,747 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:01:58,748 INFO L82 PathProgramCache]: Analyzing trace with hash 184691868, now seen corresponding path program 1 times [2018-02-02 09:01:58,748 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:58,748 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:58,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:58,748 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:58,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:58,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:58,789 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-02 09:01:58,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:01:58,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:01:58,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:01:58,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:01:58,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:01:58,791 INFO L87 Difference]: Start difference. First operand 252 states and 281 transitions. Second operand 5 states. [2018-02-02 09:01:58,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:58,918 INFO L93 Difference]: Finished difference Result 327 states and 364 transitions. [2018-02-02 09:01:58,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:01:58,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 09:01:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:58,920 INFO L225 Difference]: With dead ends: 327 [2018-02-02 09:01:58,920 INFO L226 Difference]: Without dead ends: 327 [2018-02-02 09:01:58,920 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-02 09:01:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-02 09:01:58,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 292. [2018-02-02 09:01:58,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-02 09:01:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 344 transitions. [2018-02-02 09:01:58,926 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 344 transitions. Word has length 20 [2018-02-02 09:01:58,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:58,926 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 344 transitions. [2018-02-02 09:01:58,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:01:58,926 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 344 transitions. [2018-02-02 09:01:58,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 09:01:58,927 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:58,927 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:01:58,927 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:01:58,927 INFO L82 PathProgramCache]: Analyzing trace with hash 415972895, now seen corresponding path program 1 times [2018-02-02 09:01:58,927 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:58,927 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:58,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:58,928 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:58,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:58,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:58,968 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-02 09:01:58,968 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:01:58,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:01:58,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:01:58,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:01:58,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:01:58,973 INFO L87 Difference]: Start difference. First operand 292 states and 344 transitions. Second operand 4 states. [2018-02-02 09:01:59,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:59,169 INFO L93 Difference]: Finished difference Result 454 states and 524 transitions. [2018-02-02 09:01:59,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:01:59,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-02 09:01:59,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:59,171 INFO L225 Difference]: With dead ends: 454 [2018-02-02 09:01:59,172 INFO L226 Difference]: Without dead ends: 454 [2018-02-02 09:01:59,172 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-02 09:01:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-02-02 09:01:59,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 290. [2018-02-02 09:01:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-02 09:01:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 342 transitions. [2018-02-02 09:01:59,178 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 342 transitions. Word has length 20 [2018-02-02 09:01:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:59,178 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 342 transitions. [2018-02-02 09:01:59,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:01:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 342 transitions. [2018-02-02 09:01:59,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 09:01:59,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:59,179 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:01:59,179 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:01:59,179 INFO L82 PathProgramCache]: Analyzing trace with hash 415972896, now seen corresponding path program 1 times [2018-02-02 09:01:59,179 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:59,179 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:59,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:59,180 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:59,181 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:59,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:59,237 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-02 09:01:59,237 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:01:59,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:01:59,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:01:59,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:01:59,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:01:59,238 INFO L87 Difference]: Start difference. First operand 290 states and 342 transitions. Second operand 4 states. [2018-02-02 09:01:59,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:59,409 INFO L93 Difference]: Finished difference Result 387 states and 452 transitions. [2018-02-02 09:01:59,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:01:59,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-02 09:01:59,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:59,410 INFO L225 Difference]: With dead ends: 387 [2018-02-02 09:01:59,410 INFO L226 Difference]: Without dead ends: 387 [2018-02-02 09:01:59,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:01:59,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-02 09:01:59,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 288. [2018-02-02 09:01:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-02 09:01:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 340 transitions. [2018-02-02 09:01:59,417 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 340 transitions. Word has length 20 [2018-02-02 09:01:59,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:59,417 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 340 transitions. [2018-02-02 09:01:59,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:01:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 340 transitions. [2018-02-02 09:01:59,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:01:59,418 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:59,418 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] [2018-02-02 09:01:59,419 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:01:59,419 INFO L82 PathProgramCache]: Analyzing trace with hash 308407885, now seen corresponding path program 1 times [2018-02-02 09:01:59,419 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:59,419 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:59,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:59,420 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:59,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:59,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:59,452 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-02 09:01:59,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:01:59,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:01:59,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:01:59,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:01:59,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:01:59,454 INFO L87 Difference]: Start difference. First operand 288 states and 340 transitions. Second operand 5 states. [2018-02-02 09:01:59,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:59,532 INFO L93 Difference]: Finished difference Result 319 states and 351 transitions. [2018-02-02 09:01:59,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:01:59,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 09:01:59,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:59,533 INFO L225 Difference]: With dead ends: 319 [2018-02-02 09:01:59,533 INFO L226 Difference]: Without dead ends: 319 [2018-02-02 09:01:59,533 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-02 09:01:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-02 09:01:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 275. [2018-02-02 09:01:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-02 09:01:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 307 transitions. [2018-02-02 09:01:59,537 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 307 transitions. Word has length 23 [2018-02-02 09:01:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:59,537 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 307 transitions. [2018-02-02 09:01:59,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:01:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 307 transitions. [2018-02-02 09:01:59,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:01:59,542 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:59,542 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] [2018-02-02 09:01:59,543 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:01:59,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1728935830, now seen corresponding path program 1 times [2018-02-02 09:01:59,543 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:59,543 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:59,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:59,544 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:59,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:59,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:59,581 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-02 09:01:59,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:01:59,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:01:59,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:01:59,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:01:59,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:01:59,582 INFO L87 Difference]: Start difference. First operand 275 states and 307 transitions. Second operand 5 states. [2018-02-02 09:01:59,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:59,853 INFO L93 Difference]: Finished difference Result 457 states and 509 transitions. [2018-02-02 09:01:59,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:01:59,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-02 09:01:59,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:59,854 INFO L225 Difference]: With dead ends: 457 [2018-02-02 09:01:59,854 INFO L226 Difference]: Without dead ends: 457 [2018-02-02 09:01:59,855 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-02 09:01:59,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-02-02 09:01:59,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 276. [2018-02-02 09:01:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-02 09:01:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 310 transitions. [2018-02-02 09:01:59,861 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 310 transitions. Word has length 28 [2018-02-02 09:01:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:59,861 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 310 transitions. [2018-02-02 09:01:59,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:01:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 310 transitions. [2018-02-02 09:01:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:01:59,862 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:59,862 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] [2018-02-02 09:01:59,862 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:01:59,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1728935829, now seen corresponding path program 1 times [2018-02-02 09:01:59,864 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:59,864 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:59,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:59,865 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:59,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:59,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:59,937 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-02 09:01:59,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:01:59,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:01:59,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:01:59,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:01:59,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:01:59,938 INFO L87 Difference]: Start difference. First operand 276 states and 310 transitions. Second operand 6 states. [2018-02-02 09:02:00,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:00,245 INFO L93 Difference]: Finished difference Result 387 states and 437 transitions. [2018-02-02 09:02:00,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:02:00,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-02 09:02:00,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:00,246 INFO L225 Difference]: With dead ends: 387 [2018-02-02 09:02:00,246 INFO L226 Difference]: Without dead ends: 387 [2018-02-02 09:02:00,247 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:02:00,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-02 09:02:00,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 275. [2018-02-02 09:02:00,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-02 09:02:00,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 309 transitions. [2018-02-02 09:02:00,252 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 309 transitions. Word has length 28 [2018-02-02 09:02:00,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:00,252 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 309 transitions. [2018-02-02 09:02:00,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:02:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 309 transitions. [2018-02-02 09:02:00,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 09:02:00,253 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:00,253 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] [2018-02-02 09:02:00,253 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:00,254 INFO L82 PathProgramCache]: Analyzing trace with hash -887445228, now seen corresponding path program 1 times [2018-02-02 09:02:00,254 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:00,254 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:00,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:00,255 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:00,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:00,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:00,281 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-02 09:02:00,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:00,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:02:00,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:02:00,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:02:00,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:02:00,282 INFO L87 Difference]: Start difference. First operand 275 states and 309 transitions. Second operand 3 states. [2018-02-02 09:02:00,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:00,370 INFO L93 Difference]: Finished difference Result 278 states and 311 transitions. [2018-02-02 09:02:00,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:02:00,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-02-02 09:02:00,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:00,371 INFO L225 Difference]: With dead ends: 278 [2018-02-02 09:02:00,371 INFO L226 Difference]: Without dead ends: 255 [2018-02-02 09:02:00,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:02:00,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-02 09:02:00,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2018-02-02 09:02:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 09:02:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 285 transitions. [2018-02-02 09:02:00,374 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 285 transitions. Word has length 30 [2018-02-02 09:02:00,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:00,374 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 285 transitions. [2018-02-02 09:02:00,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:02:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 285 transitions. [2018-02-02 09:02:00,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:02:00,375 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:00,375 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-02 09:02:00,375 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:00,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1380917583, now seen corresponding path program 1 times [2018-02-02 09:02:00,375 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:00,375 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:00,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:00,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:00,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:00,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:00,498 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-02 09:02:00,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:00,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 09:02:00,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:02:00,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:02:00,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:02:00,499 INFO L87 Difference]: Start difference. First operand 254 states and 285 transitions. Second operand 12 states. [2018-02-02 09:02:01,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:01,654 INFO L93 Difference]: Finished difference Result 1030 states and 1162 transitions. [2018-02-02 09:02:01,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:02:01,654 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-02-02 09:02:01,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:01,656 INFO L225 Difference]: With dead ends: 1030 [2018-02-02 09:02:01,656 INFO L226 Difference]: Without dead ends: 1030 [2018-02-02 09:02:01,656 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:02:01,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2018-02-02 09:02:01,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 253. [2018-02-02 09:02:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-02-02 09:02:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 284 transitions. [2018-02-02 09:02:01,664 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 284 transitions. Word has length 32 [2018-02-02 09:02:01,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:01,664 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 284 transitions. [2018-02-02 09:02:01,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:02:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 284 transitions. [2018-02-02 09:02:01,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:02:01,664 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:01,665 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-02 09:02:01,665 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:01,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1380917584, now seen corresponding path program 1 times [2018-02-02 09:02:01,665 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:01,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:01,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:01,665 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:01,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:01,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:01,801 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-02 09:02:01,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:01,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 09:02:01,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:02:01,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:02:01,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:02:01,802 INFO L87 Difference]: Start difference. First operand 253 states and 284 transitions. Second operand 11 states. [2018-02-02 09:02:03,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:03,272 INFO L93 Difference]: Finished difference Result 1175 states and 1331 transitions. [2018-02-02 09:02:03,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 09:02:03,273 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-02-02 09:02:03,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:03,276 INFO L225 Difference]: With dead ends: 1175 [2018-02-02 09:02:03,277 INFO L226 Difference]: Without dead ends: 1175 [2018-02-02 09:02:03,277 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=672, Unknown=0, NotChecked=0, Total=930 [2018-02-02 09:02:03,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2018-02-02 09:02:03,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 252. [2018-02-02 09:02:03,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-02-02 09:02:03,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 283 transitions. [2018-02-02 09:02:03,285 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 283 transitions. Word has length 32 [2018-02-02 09:02:03,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:03,285 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 283 transitions. [2018-02-02 09:02:03,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:02:03,285 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 283 transitions. [2018-02-02 09:02:03,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 09:02:03,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:03,286 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] [2018-02-02 09:02:03,286 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:03,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1718989974, now seen corresponding path program 1 times [2018-02-02 09:02:03,287 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:03,287 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:03,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:03,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:03,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:03,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:02:03,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:03,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:02:03,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:02:03,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:02:03,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:02:03,313 INFO L87 Difference]: Start difference. First operand 252 states and 283 transitions. Second operand 4 states. [2018-02-02 09:02:03,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:03,536 INFO L93 Difference]: Finished difference Result 775 states and 871 transitions. [2018-02-02 09:02:03,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:02:03,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-02 09:02:03,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:03,539 INFO L225 Difference]: With dead ends: 775 [2018-02-02 09:02:03,539 INFO L226 Difference]: Without dead ends: 775 [2018-02-02 09:02:03,539 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-02 09:02:03,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2018-02-02 09:02:03,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 250. [2018-02-02 09:02:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-02 09:02:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 281 transitions. [2018-02-02 09:02:03,545 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 281 transitions. Word has length 35 [2018-02-02 09:02:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:03,545 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 281 transitions. [2018-02-02 09:02:03,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:02:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 281 transitions. [2018-02-02 09:02:03,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 09:02:03,546 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:03,546 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] [2018-02-02 09:02:03,546 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:03,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1718989975, now seen corresponding path program 1 times [2018-02-02 09:02:03,546 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:03,547 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:03,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:03,547 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:03,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:03,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:03,618 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-02 09:02:03,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:03,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:02:03,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:02:03,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:02:03,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:02:03,619 INFO L87 Difference]: Start difference. First operand 250 states and 281 transitions. Second operand 6 states. [2018-02-02 09:02:03,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:03,961 INFO L93 Difference]: Finished difference Result 474 states and 541 transitions. [2018-02-02 09:02:03,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:02:03,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 09:02:03,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:03,963 INFO L225 Difference]: With dead ends: 474 [2018-02-02 09:02:03,963 INFO L226 Difference]: Without dead ends: 474 [2018-02-02 09:02:03,963 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:02:03,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-02-02 09:02:03,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 256. [2018-02-02 09:02:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-02 09:02:03,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 292 transitions. [2018-02-02 09:02:03,968 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 292 transitions. Word has length 35 [2018-02-02 09:02:03,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:03,969 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 292 transitions. [2018-02-02 09:02:03,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:02:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 292 transitions. [2018-02-02 09:02:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 09:02:03,969 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:03,969 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] [2018-02-02 09:02:03,969 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:03,970 INFO L82 PathProgramCache]: Analyzing trace with hash 320441296, now seen corresponding path program 1 times [2018-02-02 09:02:03,970 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:03,970 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:03,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:03,971 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:03,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:03,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:04,027 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-02 09:02:04,027 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:04,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:02:04,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:02:04,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:02:04,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:02:04,028 INFO L87 Difference]: Start difference. First operand 256 states and 292 transitions. Second operand 6 states. [2018-02-02 09:02:04,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:04,117 INFO L93 Difference]: Finished difference Result 453 states and 505 transitions. [2018-02-02 09:02:04,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:02:04,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 09:02:04,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:04,119 INFO L225 Difference]: With dead ends: 453 [2018-02-02 09:02:04,119 INFO L226 Difference]: Without dead ends: 453 [2018-02-02 09:02:04,119 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:02:04,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-02-02 09:02:04,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 254. [2018-02-02 09:02:04,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 09:02:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 287 transitions. [2018-02-02 09:02:04,124 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 287 transitions. Word has length 36 [2018-02-02 09:02:04,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:04,124 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 287 transitions. [2018-02-02 09:02:04,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:02:04,124 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 287 transitions. [2018-02-02 09:02:04,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 09:02:04,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:04,125 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-02 09:02:04,125 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:04,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1534000121, now seen corresponding path program 1 times [2018-02-02 09:02:04,125 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:04,125 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:04,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:04,126 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:04,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:04,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:04,462 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-02 09:02:04,462 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:04,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 09:02:04,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:02:04,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:02:04,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:02:04,463 INFO L87 Difference]: Start difference. First operand 254 states and 287 transitions. Second operand 16 states. [2018-02-02 09:02:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:06,071 INFO L93 Difference]: Finished difference Result 685 states and 769 transitions. [2018-02-02 09:02:06,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 09:02:06,071 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-02-02 09:02:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:06,072 INFO L225 Difference]: With dead ends: 685 [2018-02-02 09:02:06,072 INFO L226 Difference]: Without dead ends: 685 [2018-02-02 09:02:06,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=401, Invalid=1159, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 09:02:06,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-02-02 09:02:06,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 247. [2018-02-02 09:02:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-02 09:02:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 275 transitions. [2018-02-02 09:02:06,078 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 275 transitions. Word has length 38 [2018-02-02 09:02:06,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:06,079 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 275 transitions. [2018-02-02 09:02:06,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:02:06,079 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 275 transitions. [2018-02-02 09:02:06,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 09:02:06,079 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:06,079 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-02 09:02:06,079 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:06,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1535290008, now seen corresponding path program 1 times [2018-02-02 09:02:06,080 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:06,080 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:06,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:06,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:06,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:06,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:06,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:02:06,282 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:02:06,282 INFO L209 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-02 09:02:06,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:06,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:02:06,387 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-02 09:02:06,390 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-02 09:02:06,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:06,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:06,412 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-02 09:02:06,414 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-02 09:02:06,414 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:06,415 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:06,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:06,418 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-02-02 09:02:06,451 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 15 treesize of output 11 [2018-02-02 09:02:06,452 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-02 09:02:06,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:06,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:06,471 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 15 treesize of output 11 [2018-02-02 09:02:06,472 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-02 09:02:06,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:06,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:06,476 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-02 09:02:06,477 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-02-02 09:02:06,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:02:06,525 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:02:06,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 16 [2018-02-02 09:02:06,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:02:06,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:02:06,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:02:06,526 INFO L87 Difference]: Start difference. First operand 247 states and 275 transitions. Second operand 16 states. [2018-02-02 09:02:07,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:07,068 INFO L93 Difference]: Finished difference Result 570 states and 637 transitions. [2018-02-02 09:02:07,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:02:07,068 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-02-02 09:02:07,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:07,070 INFO L225 Difference]: With dead ends: 570 [2018-02-02 09:02:07,070 INFO L226 Difference]: Without dead ends: 570 [2018-02-02 09:02:07,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:02:07,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-02-02 09:02:07,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 275. [2018-02-02 09:02:07,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-02 09:02:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 304 transitions. [2018-02-02 09:02:07,077 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 304 transitions. Word has length 38 [2018-02-02 09:02:07,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:07,077 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 304 transitions. [2018-02-02 09:02:07,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:02:07,078 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 304 transitions. [2018-02-02 09:02:07,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 09:02:07,078 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:07,078 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:07,078 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:07,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1834854922, now seen corresponding path program 1 times [2018-02-02 09:02:07,079 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:07,079 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:07,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:07,080 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:07,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:07,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:07,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:02:07,123 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:07,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:02:07,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:02:07,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:02:07,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:02:07,123 INFO L87 Difference]: Start difference. First operand 275 states and 304 transitions. Second operand 5 states. [2018-02-02 09:02:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:07,388 INFO L93 Difference]: Finished difference Result 450 states and 499 transitions. [2018-02-02 09:02:07,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:02:07,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-02-02 09:02:07,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:07,390 INFO L225 Difference]: With dead ends: 450 [2018-02-02 09:02:07,390 INFO L226 Difference]: Without dead ends: 450 [2018-02-02 09:02:07,390 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:02:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-02-02 09:02:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 318. [2018-02-02 09:02:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-02-02 09:02:07,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 376 transitions. [2018-02-02 09:02:07,395 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 376 transitions. Word has length 45 [2018-02-02 09:02:07,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:07,396 INFO L432 AbstractCegarLoop]: Abstraction has 318 states and 376 transitions. [2018-02-02 09:02:07,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:02:07,396 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 376 transitions. [2018-02-02 09:02:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 09:02:07,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:07,396 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:07,396 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:07,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1834854923, now seen corresponding path program 1 times [2018-02-02 09:02:07,397 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:07,397 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:07,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:07,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:07,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:07,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:07,467 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-02 09:02:07,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:07,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:02:07,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:02:07,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:02:07,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:02:07,468 INFO L87 Difference]: Start difference. First operand 318 states and 376 transitions. Second operand 6 states. [2018-02-02 09:02:07,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:07,699 INFO L93 Difference]: Finished difference Result 565 states and 680 transitions. [2018-02-02 09:02:07,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:02:07,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-02-02 09:02:07,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:07,700 INFO L225 Difference]: With dead ends: 565 [2018-02-02 09:02:07,700 INFO L226 Difference]: Without dead ends: 565 [2018-02-02 09:02:07,700 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:02:07,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-02-02 09:02:07,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 376. [2018-02-02 09:02:07,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-02-02 09:02:07,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 467 transitions. [2018-02-02 09:02:07,704 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 467 transitions. Word has length 45 [2018-02-02 09:02:07,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:07,704 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 467 transitions. [2018-02-02 09:02:07,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:02:07,704 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 467 transitions. [2018-02-02 09:02:07,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 09:02:07,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:07,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:07,705 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:07,705 INFO L82 PathProgramCache]: Analyzing trace with hash 120279583, now seen corresponding path program 1 times [2018-02-02 09:02:07,705 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:07,705 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:07,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:07,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:07,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:07,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:07,744 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-02 09:02:07,744 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:07,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:02:07,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:02:07,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:02:07,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:02:07,745 INFO L87 Difference]: Start difference. First operand 376 states and 467 transitions. Second operand 7 states. [2018-02-02 09:02:07,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:07,885 INFO L93 Difference]: Finished difference Result 505 states and 583 transitions. [2018-02-02 09:02:07,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:02:07,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-02-02 09:02:07,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:07,886 INFO L225 Difference]: With dead ends: 505 [2018-02-02 09:02:07,886 INFO L226 Difference]: Without dead ends: 505 [2018-02-02 09:02:07,886 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:02:07,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-02-02 09:02:07,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 375. [2018-02-02 09:02:07,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-02 09:02:07,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 463 transitions. [2018-02-02 09:02:07,890 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 463 transitions. Word has length 48 [2018-02-02 09:02:07,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:07,890 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 463 transitions. [2018-02-02 09:02:07,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:02:07,890 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 463 transitions. [2018-02-02 09:02:07,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 09:02:07,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:07,890 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:07,890 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:07,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1809870756, now seen corresponding path program 1 times [2018-02-02 09:02:07,895 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:07,895 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:07,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:07,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:07,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:07,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:02:07,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:07,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:02:07,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:02:07,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:02:07,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:02:07,939 INFO L87 Difference]: Start difference. First operand 375 states and 463 transitions. Second operand 6 states. [2018-02-02 09:02:08,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:08,163 INFO L93 Difference]: Finished difference Result 534 states and 619 transitions. [2018-02-02 09:02:08,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:02:08,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-02-02 09:02:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:08,165 INFO L225 Difference]: With dead ends: 534 [2018-02-02 09:02:08,165 INFO L226 Difference]: Without dead ends: 534 [2018-02-02 09:02:08,165 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:02:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-02-02 09:02:08,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 375. [2018-02-02 09:02:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-02 09:02:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 461 transitions. [2018-02-02 09:02:08,168 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 461 transitions. Word has length 50 [2018-02-02 09:02:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:08,168 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 461 transitions. [2018-02-02 09:02:08,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:02:08,168 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 461 transitions. [2018-02-02 09:02:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 09:02:08,168 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:08,169 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:08,169 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:08,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1809870755, now seen corresponding path program 1 times [2018-02-02 09:02:08,169 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:08,169 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:08,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:08,169 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:08,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:08,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:08,223 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-02 09:02:08,223 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:08,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:02:08,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:02:08,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:02:08,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:02:08,224 INFO L87 Difference]: Start difference. First operand 375 states and 461 transitions. Second operand 7 states. [2018-02-02 09:02:08,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:08,519 INFO L93 Difference]: Finished difference Result 559 states and 670 transitions. [2018-02-02 09:02:08,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:02:08,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-02-02 09:02:08,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:08,520 INFO L225 Difference]: With dead ends: 559 [2018-02-02 09:02:08,521 INFO L226 Difference]: Without dead ends: 559 [2018-02-02 09:02:08,521 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:02:08,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-02-02 09:02:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 375. [2018-02-02 09:02:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-02 09:02:08,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 460 transitions. [2018-02-02 09:02:08,526 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 460 transitions. Word has length 50 [2018-02-02 09:02:08,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:08,526 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 460 transitions. [2018-02-02 09:02:08,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:02:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 460 transitions. [2018-02-02 09:02:08,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 09:02:08,527 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:08,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:08,527 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:08,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1600702209, now seen corresponding path program 1 times [2018-02-02 09:02:08,527 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:08,527 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:08,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:08,528 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:08,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:08,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:08,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:02:08,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:08,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 09:02:08,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:02:08,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:02:08,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:02:08,641 INFO L87 Difference]: Start difference. First operand 375 states and 460 transitions. Second operand 12 states. [2018-02-02 09:02:09,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:09,121 INFO L93 Difference]: Finished difference Result 475 states and 557 transitions. [2018-02-02 09:02:09,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:02:09,122 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-02-02 09:02:09,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:09,123 INFO L225 Difference]: With dead ends: 475 [2018-02-02 09:02:09,123 INFO L226 Difference]: Without dead ends: 475 [2018-02-02 09:02:09,123 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:02:09,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-02-02 09:02:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 375. [2018-02-02 09:02:09,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-02 09:02:09,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 459 transitions. [2018-02-02 09:02:09,127 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 459 transitions. Word has length 54 [2018-02-02 09:02:09,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:09,128 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 459 transitions. [2018-02-02 09:02:09,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:02:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 459 transitions. [2018-02-02 09:02:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 09:02:09,128 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:09,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:09,129 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:09,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1600702210, now seen corresponding path program 1 times [2018-02-02 09:02:09,129 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:09,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:09,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:09,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:09,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:09,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:02:09,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:09,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 09:02:09,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:02:09,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:02:09,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:02:09,276 INFO L87 Difference]: Start difference. First operand 375 states and 459 transitions. Second operand 14 states. [2018-02-02 09:02:10,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:10,085 INFO L93 Difference]: Finished difference Result 619 states and 736 transitions. [2018-02-02 09:02:10,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 09:02:10,085 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-02-02 09:02:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:10,086 INFO L225 Difference]: With dead ends: 619 [2018-02-02 09:02:10,086 INFO L226 Difference]: Without dead ends: 619 [2018-02-02 09:02:10,087 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:02:10,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-02-02 09:02:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 393. [2018-02-02 09:02:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-02-02 09:02:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 482 transitions. [2018-02-02 09:02:10,090 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 482 transitions. Word has length 54 [2018-02-02 09:02:10,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:10,090 INFO L432 AbstractCegarLoop]: Abstraction has 393 states and 482 transitions. [2018-02-02 09:02:10,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:02:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 482 transitions. [2018-02-02 09:02:10,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 09:02:10,091 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:10,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:10,091 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:10,091 INFO L82 PathProgramCache]: Analyzing trace with hash -497243786, now seen corresponding path program 1 times [2018-02-02 09:02:10,091 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:10,091 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:10,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:10,092 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:10,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:10,097 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:02:10,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:10,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:02:10,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:02:10,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:02:10,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:02:10,108 INFO L87 Difference]: Start difference. First operand 393 states and 482 transitions. Second operand 3 states. [2018-02-02 09:02:10,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:10,196 INFO L93 Difference]: Finished difference Result 392 states and 481 transitions. [2018-02-02 09:02:10,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:02:10,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-02-02 09:02:10,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:10,197 INFO L225 Difference]: With dead ends: 392 [2018-02-02 09:02:10,198 INFO L226 Difference]: Without dead ends: 392 [2018-02-02 09:02:10,198 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:02:10,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-02-02 09:02:10,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2018-02-02 09:02:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-02-02 09:02:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 481 transitions. [2018-02-02 09:02:10,202 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 481 transitions. Word has length 54 [2018-02-02 09:02:10,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:10,202 INFO L432 AbstractCegarLoop]: Abstraction has 392 states and 481 transitions. [2018-02-02 09:02:10,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:02:10,202 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 481 transitions. [2018-02-02 09:02:10,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 09:02:10,203 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:10,203 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:10,203 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:10,203 INFO L82 PathProgramCache]: Analyzing trace with hash -497243785, now seen corresponding path program 1 times [2018-02-02 09:02:10,203 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:10,203 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:10,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:10,204 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:10,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:10,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:10,271 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-02 09:02:10,271 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:10,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 09:02:10,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:02:10,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:02:10,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:02:10,272 INFO L87 Difference]: Start difference. First operand 392 states and 481 transitions. Second operand 11 states. [2018-02-02 09:02:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:10,500 INFO L93 Difference]: Finished difference Result 438 states and 517 transitions. [2018-02-02 09:02:10,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:02:10,500 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-02-02 09:02:10,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:10,501 INFO L225 Difference]: With dead ends: 438 [2018-02-02 09:02:10,501 INFO L226 Difference]: Without dead ends: 438 [2018-02-02 09:02:10,501 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:02:10,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-02-02 09:02:10,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 378. [2018-02-02 09:02:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-02-02 09:02:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 462 transitions. [2018-02-02 09:02:10,504 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 462 transitions. Word has length 54 [2018-02-02 09:02:10,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:10,504 INFO L432 AbstractCegarLoop]: Abstraction has 378 states and 462 transitions. [2018-02-02 09:02:10,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:02:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 462 transitions. [2018-02-02 09:02:10,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 09:02:10,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:10,505 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:10,505 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:10,505 INFO L82 PathProgramCache]: Analyzing trace with hash 750527692, now seen corresponding path program 2 times [2018-02-02 09:02:10,505 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:10,505 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:10,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:10,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:10,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:10,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:10,824 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:02:10,824 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:02:10,824 INFO L209 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-02 09:02:10,828 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:02:10,838 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:02:10,852 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:02:10,857 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:02:10,860 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:02:10,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:10,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:10,872 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-02 09:02:10,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:10,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:10,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-02 09:02:10,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-02-02 09:02:10,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:10,939 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-02 09:02:10,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2018-02-02 09:02:11,026 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-02 09:02:11,031 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-02 09:02:11,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:11,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:11,039 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-02 09:02:11,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:35 [2018-02-02 09:02:11,139 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 25 treesize of output 19 [2018-02-02 09:02:11,141 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-02 09:02:11,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:11,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:11,148 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-02 09:02:11,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:20 [2018-02-02 09:02:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:02:11,227 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:02:11,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [19] total 28 [2018-02-02 09:02:11,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 09:02:11,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 09:02:11,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2018-02-02 09:02:11,228 INFO L87 Difference]: Start difference. First operand 378 states and 462 transitions. Second operand 29 states. [2018-02-02 09:02:13,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:13,239 INFO L93 Difference]: Finished difference Result 1033 states and 1241 transitions. [2018-02-02 09:02:13,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 09:02:13,240 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-02-02 09:02:13,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:13,242 INFO L225 Difference]: With dead ends: 1033 [2018-02-02 09:02:13,243 INFO L226 Difference]: Without dead ends: 1033 [2018-02-02 09:02:13,243 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=594, Invalid=2162, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 09:02:13,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2018-02-02 09:02:13,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 377. [2018-02-02 09:02:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-02-02 09:02:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 461 transitions. [2018-02-02 09:02:13,250 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 461 transitions. Word has length 54 [2018-02-02 09:02:13,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:13,251 INFO L432 AbstractCegarLoop]: Abstraction has 377 states and 461 transitions. [2018-02-02 09:02:13,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 09:02:13,251 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 461 transitions. [2018-02-02 09:02:13,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 09:02:13,251 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:13,251 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:13,251 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:13,252 INFO L82 PathProgramCache]: Analyzing trace with hash 750527693, now seen corresponding path program 1 times [2018-02-02 09:02:13,252 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:13,252 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:13,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:13,253 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:02:13,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:13,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:02:13,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:02:13,537 INFO L209 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-02 09:02:13,541 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:13,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:02:13,567 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-02 09:02:13,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:13,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:13,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 09:02:13,609 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:13,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-02 09:02:13,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:13,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:13,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:13,616 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-02 09:02:13,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:13,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:13,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-02 09:02:13,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-02-02 09:02:13,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:13,693 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-02 09:02:13,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2018-02-02 09:02:13,760 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-02 09:02:13,761 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-02 09:02:13,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:13,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:13,781 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-02 09:02:13,783 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-02 09:02:13,783 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:13,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:13,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:02:13,795 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:47 [2018-02-02 09:02:13,907 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 31 treesize of output 25 [2018-02-02 09:02:13,917 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 25 treesize of output 10 [2018-02-02 09:02:13,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:13,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:13,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-02 09:02:13,928 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-02 09:02:13,928 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:13,929 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:13,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:02:13,935 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:65, output treesize:23 [2018-02-02 09:02:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:02:14,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:02:14,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-02-02 09:02:14,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 09:02:14,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 09:02:14,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:02:14,011 INFO L87 Difference]: Start difference. First operand 377 states and 461 transitions. Second operand 30 states. [2018-02-02 09:02:16,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:16,083 INFO L93 Difference]: Finished difference Result 1179 states and 1447 transitions. [2018-02-02 09:02:16,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 09:02:16,083 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2018-02-02 09:02:16,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:16,085 INFO L225 Difference]: With dead ends: 1179 [2018-02-02 09:02:16,085 INFO L226 Difference]: Without dead ends: 1179 [2018-02-02 09:02:16,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=708, Invalid=2372, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 09:02:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-02-02 09:02:16,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 383. [2018-02-02 09:02:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-02 09:02:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 472 transitions. [2018-02-02 09:02:16,093 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 472 transitions. Word has length 54 [2018-02-02 09:02:16,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:16,093 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 472 transitions. [2018-02-02 09:02:16,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 09:02:16,093 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 472 transitions. [2018-02-02 09:02:16,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 09:02:16,094 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:16,094 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:16,094 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:16,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1483410129, now seen corresponding path program 1 times [2018-02-02 09:02:16,094 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:16,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:16,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:16,095 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:16,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:16,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:02:16,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:16,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 09:02:16,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:02:16,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:02:16,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:02:16,273 INFO L87 Difference]: Start difference. First operand 383 states and 472 transitions. Second operand 17 states. [2018-02-02 09:02:17,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:17,088 INFO L93 Difference]: Finished difference Result 541 states and 629 transitions. [2018-02-02 09:02:17,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 09:02:17,088 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-02-02 09:02:17,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:17,090 INFO L225 Difference]: With dead ends: 541 [2018-02-02 09:02:17,090 INFO L226 Difference]: Without dead ends: 541 [2018-02-02 09:02:17,090 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=284, Invalid=1048, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 09:02:17,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-02-02 09:02:17,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 383. [2018-02-02 09:02:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-02 09:02:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 471 transitions. [2018-02-02 09:02:17,093 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 471 transitions. Word has length 57 [2018-02-02 09:02:17,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:17,093 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 471 transitions. [2018-02-02 09:02:17,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:02:17,093 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 471 transitions. [2018-02-02 09:02:17,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 09:02:17,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:17,094 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:17,094 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:17,094 INFO L82 PathProgramCache]: Analyzing trace with hash 713611172, now seen corresponding path program 1 times [2018-02-02 09:02:17,094 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:17,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:17,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:17,094 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:17,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:17,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 09:02:17,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:17,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:02:17,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:02:17,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:02:17,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:02:17,131 INFO L87 Difference]: Start difference. First operand 383 states and 471 transitions. Second operand 3 states. [2018-02-02 09:02:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:17,221 INFO L93 Difference]: Finished difference Result 382 states and 470 transitions. [2018-02-02 09:02:17,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:02:17,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-02-02 09:02:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:17,223 INFO L225 Difference]: With dead ends: 382 [2018-02-02 09:02:17,223 INFO L226 Difference]: Without dead ends: 382 [2018-02-02 09:02:17,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:02:17,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-02 09:02:17,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-02-02 09:02:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-02 09:02:17,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 470 transitions. [2018-02-02 09:02:17,228 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 470 transitions. Word has length 57 [2018-02-02 09:02:17,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:17,228 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 470 transitions. [2018-02-02 09:02:17,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:02:17,228 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 470 transitions. [2018-02-02 09:02:17,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 09:02:17,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:17,229 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:17,229 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:17,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1414427259, now seen corresponding path program 1 times [2018-02-02 09:02:17,230 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:17,230 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:17,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:17,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:17,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:17,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:17,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:02:17,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:17,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:02:17,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:02:17,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:02:17,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:02:17,407 INFO L87 Difference]: Start difference. First operand 382 states and 470 transitions. Second operand 10 states. [2018-02-02 09:02:18,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:18,069 INFO L93 Difference]: Finished difference Result 752 states and 884 transitions. [2018-02-02 09:02:18,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:02:18,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-02-02 09:02:18,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:18,071 INFO L225 Difference]: With dead ends: 752 [2018-02-02 09:02:18,071 INFO L226 Difference]: Without dead ends: 752 [2018-02-02 09:02:18,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:02:18,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-02-02 09:02:18,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 424. [2018-02-02 09:02:18,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-02-02 09:02:18,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 546 transitions. [2018-02-02 09:02:18,075 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 546 transitions. Word has length 59 [2018-02-02 09:02:18,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:18,075 INFO L432 AbstractCegarLoop]: Abstraction has 424 states and 546 transitions. [2018-02-02 09:02:18,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:02:18,076 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 546 transitions. [2018-02-02 09:02:18,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 09:02:18,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:18,076 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:18,076 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:18,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1352389134, now seen corresponding path program 1 times [2018-02-02 09:02:18,076 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:18,076 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:18,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:18,077 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:18,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:18,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 09:02:18,111 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:18,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:02:18,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:02:18,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:02:18,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:02:18,113 INFO L87 Difference]: Start difference. First operand 424 states and 546 transitions. Second operand 4 states. [2018-02-02 09:02:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:18,235 INFO L93 Difference]: Finished difference Result 600 states and 770 transitions. [2018-02-02 09:02:18,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:02:18,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-02-02 09:02:18,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:18,237 INFO L225 Difference]: With dead ends: 600 [2018-02-02 09:02:18,237 INFO L226 Difference]: Without dead ends: 600 [2018-02-02 09:02:18,237 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-02 09:02:18,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-02-02 09:02:18,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 422. [2018-02-02 09:02:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-02 09:02:18,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 540 transitions. [2018-02-02 09:02:18,240 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 540 transitions. Word has length 60 [2018-02-02 09:02:18,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:18,240 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 540 transitions. [2018-02-02 09:02:18,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:02:18,240 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 540 transitions. [2018-02-02 09:02:18,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 09:02:18,241 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:18,241 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:18,241 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:18,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1352389133, now seen corresponding path program 1 times [2018-02-02 09:02:18,241 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:18,241 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:18,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:18,242 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:18,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:18,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:02:18,300 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:18,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:02:18,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:02:18,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:02:18,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:02:18,301 INFO L87 Difference]: Start difference. First operand 422 states and 540 transitions. Second operand 7 states. [2018-02-02 09:02:18,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:18,558 INFO L93 Difference]: Finished difference Result 662 states and 817 transitions. [2018-02-02 09:02:18,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:02:18,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-02-02 09:02:18,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:18,560 INFO L225 Difference]: With dead ends: 662 [2018-02-02 09:02:18,560 INFO L226 Difference]: Without dead ends: 662 [2018-02-02 09:02:18,560 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:02:18,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-02-02 09:02:18,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 429. [2018-02-02 09:02:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-02-02 09:02:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 551 transitions. [2018-02-02 09:02:18,563 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 551 transitions. Word has length 60 [2018-02-02 09:02:18,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:18,564 INFO L432 AbstractCegarLoop]: Abstraction has 429 states and 551 transitions. [2018-02-02 09:02:18,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:02:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 551 transitions. [2018-02-02 09:02:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 09:02:18,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:18,564 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:18,564 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:18,565 INFO L82 PathProgramCache]: Analyzing trace with hash -897571947, now seen corresponding path program 1 times [2018-02-02 09:02:18,565 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:18,565 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:18,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:18,566 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:18,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:18,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 09:02:18,586 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:18,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:02:18,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:02:18,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:02:18,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:02:18,587 INFO L87 Difference]: Start difference. First operand 429 states and 551 transitions. Second operand 3 states. [2018-02-02 09:02:18,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:18,639 INFO L93 Difference]: Finished difference Result 426 states and 545 transitions. [2018-02-02 09:02:18,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:02:18,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-02-02 09:02:18,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:18,640 INFO L225 Difference]: With dead ends: 426 [2018-02-02 09:02:18,640 INFO L226 Difference]: Without dead ends: 426 [2018-02-02 09:02:18,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:02:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-02-02 09:02:18,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2018-02-02 09:02:18,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-02-02 09:02:18,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 545 transitions. [2018-02-02 09:02:18,643 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 545 transitions. Word has length 60 [2018-02-02 09:02:18,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:18,644 INFO L432 AbstractCegarLoop]: Abstraction has 426 states and 545 transitions. [2018-02-02 09:02:18,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:02:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 545 transitions. [2018-02-02 09:02:18,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 09:02:18,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:18,645 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:18,645 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:18,645 INFO L82 PathProgramCache]: Analyzing trace with hash -897571946, now seen corresponding path program 1 times [2018-02-02 09:02:18,645 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:18,645 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:18,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:18,646 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:18,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:18,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:18,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 09:02:18,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:18,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:02:18,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:02:18,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:02:18,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:02:18,683 INFO L87 Difference]: Start difference. First operand 426 states and 545 transitions. Second operand 3 states. [2018-02-02 09:02:18,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:18,766 INFO L93 Difference]: Finished difference Result 423 states and 539 transitions. [2018-02-02 09:02:18,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:02:18,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-02-02 09:02:18,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:18,767 INFO L225 Difference]: With dead ends: 423 [2018-02-02 09:02:18,768 INFO L226 Difference]: Without dead ends: 423 [2018-02-02 09:02:18,768 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:02:18,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-02-02 09:02:18,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2018-02-02 09:02:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-02-02 09:02:18,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 539 transitions. [2018-02-02 09:02:18,772 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 539 transitions. Word has length 60 [2018-02-02 09:02:18,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:18,772 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 539 transitions. [2018-02-02 09:02:18,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:02:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 539 transitions. [2018-02-02 09:02:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 09:02:18,773 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:18,773 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:18,773 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:18,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1820997833, now seen corresponding path program 1 times [2018-02-02 09:02:18,773 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:18,773 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:18,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:18,774 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:18,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:18,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:02:19,456 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:02:19,456 INFO L209 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-02 09:02:19,461 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:19,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:02:19,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 09:02:19,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:19,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:19,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-02 09:02:19,571 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-02 09:02:19,573 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-02 09:02:19,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:19,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:19,578 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-02 09:02:19,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-02 09:02:19,586 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 28 treesize of output 23 [2018-02-02 09:02:19,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:19,592 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 18 treesize of output 25 [2018-02-02 09:02:19,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:19,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:19,599 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-02 09:02:19,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2018-02-02 09:02:19,609 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:19,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:19,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:19,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-02-02 09:02:19,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:19,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:19,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:35 [2018-02-02 09:02:19,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-02-02 09:02:19,674 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-02 09:02:19,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:19,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:19,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:19,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2018-02-02 09:02:19,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-02-02 09:02:19,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:19,721 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 20 treesize of output 16 [2018-02-02 09:02:19,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:19,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:19,732 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-02 09:02:19,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:44 [2018-02-02 09:02:19,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-02-02 09:02:19,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:19,779 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-02 09:02:19,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:52 [2018-02-02 09:02:19,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:19,884 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 6 case distinctions, treesize of input 38 treesize of output 74 [2018-02-02 09:02:19,893 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 2 case distinctions, treesize of input 53 treesize of output 59 [2018-02-02 09:02:19,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 09:02:19,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 35 treesize of output 34 [2018-02-02 09:02:19,961 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:20,026 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:02:20,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-02-02 09:02:20,027 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:02:20,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-02-02 09:02:20,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-02-02 09:02:20,085 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:254 [2018-02-02 09:02:20,244 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 68 treesize of output 65 [2018-02-02 09:02:20,246 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-02 09:02:20,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:20,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:20,256 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 67 treesize of output 64 [2018-02-02 09:02:20,258 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-02 09:02:20,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:20,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:20,270 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 94 treesize of output 91 [2018-02-02 09:02:20,271 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-02 09:02:20,271 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:20,286 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:20,336 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:20,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:20,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:20,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 118 [2018-02-02 09:02:20,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:20,385 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 7 case distinctions, treesize of input 101 treesize of output 146 [2018-02-02 09:02:20,388 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-02-02 09:02:20,574 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:02:20,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:20,741 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 85 treesize of output 100 [2018-02-02 09:02:20,741 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:20,869 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-02-02 09:02:21,065 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 64 treesize of output 58 [2018-02-02 09:02:21,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:21,068 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 35 treesize of output 46 [2018-02-02 09:02:21,068 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:21,081 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:21,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:21,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:21,294 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:21,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 79 [2018-02-02 09:02:21,301 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:21,312 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 52 [2018-02-02 09:02:21,313 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 09:02:21,329 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:21,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 09:02:21,388 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:230, output treesize:230 [2018-02-02 09:02:22,091 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 119 treesize of output 115 [2018-02-02 09:02:22,095 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-02 09:02:22,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:22,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:22,157 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 86 treesize of output 82 [2018-02-02 09:02:22,160 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-02 09:02:22,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:22,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:22,207 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 78 treesize of output 74 [2018-02-02 09:02:22,208 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-02 09:02:22,209 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:22,218 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:22,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-02-02 09:02:22,250 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:284, output treesize:239 [2018-02-02 09:02:22,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:22,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:22,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 63 [2018-02-02 09:02:22,455 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 40 [2018-02-02 09:02:22,457 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-02-02 09:02:22,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 37 [2018-02-02 09:02:22,483 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 09:02:22,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:22,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-02-02 09:02:22,486 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:22,487 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 28 treesize of output 19 [2018-02-02 09:02:22,488 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:22,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-02 09:02:22,560 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:22,561 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:22,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 97 [2018-02-02 09:02:22,571 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 84 [2018-02-02 09:02:22,571 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 09:02:22,601 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 73 treesize of output 64 [2018-02-02 09:02:22,601 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:22,624 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 70 treesize of output 63 [2018-02-02 09:02:22,624 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:22,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 49 [2018-02-02 09:02:22,647 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:02:22,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 67 [2018-02-02 09:02:22,682 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-02 09:02:22,731 INFO L267 ElimStorePlain]: Start of recursive call 7: 5 dim-1 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-02-02 09:02:22,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 49 [2018-02-02 09:02:22,820 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:02:22,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-02-02 09:02:22,821 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:22,827 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-02 09:02:22,827 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:22,831 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:22,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: 17 dim-0 vars, and 8 xjuncts. [2018-02-02 09:02:22,907 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 11 variables, input treesize:242, output treesize:224 [2018-02-02 09:02:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:02:23,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:02:23,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [25] total 47 [2018-02-02 09:02:23,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 09:02:23,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 09:02:23,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2069, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 09:02:23,114 INFO L87 Difference]: Start difference. First operand 423 states and 539 transitions. Second operand 48 states. [2018-02-02 09:02:24,386 WARN L146 SmtUtils]: Spent 212ms on a formula simplification. DAG size of input: 107 DAG size of output 86 [2018-02-02 09:02:24,621 WARN L146 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 135 DAG size of output 109 [2018-02-02 09:02:25,071 WARN L146 SmtUtils]: Spent 370ms on a formula simplification. DAG size of input: 180 DAG size of output 154 [2018-02-02 09:02:25,360 WARN L146 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 140 DAG size of output 114 [2018-02-02 09:02:25,771 WARN L146 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 143 DAG size of output 118 [2018-02-02 09:02:26,277 WARN L146 SmtUtils]: Spent 405ms on a formula simplification. DAG size of input: 221 DAG size of output 157 [2018-02-02 09:02:26,847 WARN L146 SmtUtils]: Spent 474ms on a formula simplification. DAG size of input: 221 DAG size of output 158 [2018-02-02 09:02:27,029 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 116 DAG size of output 92 [2018-02-02 09:02:27,660 WARN L146 SmtUtils]: Spent 444ms on a formula simplification. DAG size of input: 227 DAG size of output 159 [2018-02-02 09:02:28,215 WARN L146 SmtUtils]: Spent 410ms on a formula simplification. DAG size of input: 221 DAG size of output 157 [2018-02-02 09:02:29,056 WARN L146 SmtUtils]: Spent 722ms on a formula simplification. DAG size of input: 274 DAG size of output 210 [2018-02-02 09:02:29,725 WARN L146 SmtUtils]: Spent 589ms on a formula simplification. DAG size of input: 252 DAG size of output 226 [2018-02-02 09:02:30,188 WARN L146 SmtUtils]: Spent 352ms on a formula simplification. DAG size of input: 213 DAG size of output 187 [2018-02-02 09:02:30,653 WARN L146 SmtUtils]: Spent 372ms on a formula simplification. DAG size of input: 226 DAG size of output 190 [2018-02-02 09:02:31,121 WARN L146 SmtUtils]: Spent 377ms on a formula simplification. DAG size of input: 226 DAG size of output 190 [2018-02-02 09:02:31,785 WARN L146 SmtUtils]: Spent 398ms on a formula simplification. DAG size of input: 233 DAG size of output 193 [2018-02-02 09:02:32,314 WARN L146 SmtUtils]: Spent 366ms on a formula simplification. DAG size of input: 225 DAG size of output 190 [2018-02-02 09:02:32,826 WARN L146 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 150 DAG size of output 112 [2018-02-02 09:02:33,425 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 146 DAG size of output 143 [2018-02-02 09:02:33,779 WARN L146 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 159 DAG size of output 146 [2018-02-02 09:02:34,669 WARN L146 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 158 DAG size of output 146 [2018-02-02 09:02:44,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:44,370 INFO L93 Difference]: Finished difference Result 1401 states and 1758 transitions. [2018-02-02 09:02:44,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 09:02:44,370 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 60 [2018-02-02 09:02:44,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:44,373 INFO L225 Difference]: With dead ends: 1401 [2018-02-02 09:02:44,373 INFO L226 Difference]: Without dead ends: 1401 [2018-02-02 09:02:44,374 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=1104, Invalid=5702, Unknown=0, NotChecked=0, Total=6806 [2018-02-02 09:02:44,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-02-02 09:02:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 425. [2018-02-02 09:02:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-02 09:02:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 543 transitions. [2018-02-02 09:02:44,378 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 543 transitions. Word has length 60 [2018-02-02 09:02:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:44,379 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 543 transitions. [2018-02-02 09:02:44,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 09:02:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 543 transitions. [2018-02-02 09:02:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 09:02:44,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:44,379 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:44,379 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:02:44,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1820997832, now seen corresponding path program 1 times [2018-02-02 09:02:44,379 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:44,379 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:44,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:44,380 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:44,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:44,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:02:45,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:02:45,484 INFO L209 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-02 09:02:45,489 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:45,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:02:45,514 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-02 09:02:45,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:45,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:45,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:02:45,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:45,566 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 19 treesize of output 22 [2018-02-02 09:02:45,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:45,574 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:45,575 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:45,575 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-02 09:02:45,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:45,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:45,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-02-02 09:02:45,641 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-02 09:02:45,642 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-02 09:02:45,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:45,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:45,658 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-02 09:02:45,671 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-02 09:02:45,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:45,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:45,684 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-02 09:02:45,684 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:58 [2018-02-02 09:02:45,722 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 46 treesize of output 37 [2018-02-02 09:02:45,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:45,726 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 37 treesize of output 48 [2018-02-02 09:02:45,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:45,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:45,749 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 38 treesize of output 31 [2018-02-02 09:02:45,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:45,752 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 31 treesize of output 40 [2018-02-02 09:02:45,753 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:45,757 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:45,770 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-02 09:02:45,770 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:58 [2018-02-02 09:02:45,850 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:45,852 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 36 treesize of output 39 [2018-02-02 09:02:45,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:45,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:45,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:45,880 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-02 09:02:45,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:45,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:45,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:64 [2018-02-02 09:02:45,981 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 31 treesize of output 32 [2018-02-02 09:02:45,983 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-02 09:02:45,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:45,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,009 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 30 treesize of output 31 [2018-02-02 09:02:46,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 09:02:46,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,031 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:90, output treesize:82 [2018-02-02 09:02:46,103 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 41 [2018-02-02 09:02:46,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:46,106 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 20 treesize of output 16 [2018-02-02 09:02:46,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,136 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 41 treesize of output 40 [2018-02-02 09:02:46,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:46,139 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 20 treesize of output 16 [2018-02-02 09:02:46,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,164 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,179 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:112, output treesize:82 [2018-02-02 09:02:46,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:46,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:46,208 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 45 [2018-02-02 09:02:46,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:46,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:46,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:46,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2018-02-02 09:02:46,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:88 [2018-02-02 09:02:46,394 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2018-02-02 09:02:46,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-02 09:02:46,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,449 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2018-02-02 09:02:46,452 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-02 09:02:46,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,463 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,489 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-02 09:02:46,489 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:113, output treesize:119 [2018-02-02 09:02:46,583 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 77 [2018-02-02 09:02:46,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:46,588 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 41 treesize of output 50 [2018-02-02 09:02:46,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,647 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 90 treesize of output 84 [2018-02-02 09:02:46,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:46,652 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 60 treesize of output 75 [2018-02-02 09:02:46,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,667 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:46,719 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-02 09:02:46,719 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:145, output treesize:203 [2018-02-02 09:02:47,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 172 [2018-02-02 09:02:47,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 95 [2018-02-02 09:02:47,360 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:02:47,379 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 1 [2018-02-02 09:02:47,379 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:47,394 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 37 treesize of output 10 [2018-02-02 09:02:47,394 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:47,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:02:47,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2018-02-02 09:02:47,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:02:47,425 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2018-02-02 09:02:47,426 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:02:47,438 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-02 09:02:47,438 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:47,443 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 18 treesize of output 9 [2018-02-02 09:02:47,443 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 09:02:47,447 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:02:47,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 09:02:47,457 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:241, output treesize:45 [2018-02-02 09:02:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:02:47,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:02:47,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 47 [2018-02-02 09:02:47,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 09:02:47,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 09:02:47,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2118, Unknown=7, NotChecked=0, Total=2256 [2018-02-02 09:02:47,662 INFO L87 Difference]: Start difference. First operand 425 states and 543 transitions. Second operand 48 states. Received shutdown request... [2018-02-02 09:02:55,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:02:55,919 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 09:02:55,923 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 09:02:55,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:02:55 BoogieIcfgContainer [2018-02-02 09:02:55,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:02:55,924 INFO L168 Benchmark]: Toolchain (without parser) took 59122.61 ms. Allocated memory was 396.4 MB in the beginning and 1.0 GB in the end (delta: 612.4 MB). Free memory was 353.1 MB in the beginning and 648.8 MB in the end (delta: -295.7 MB). Peak memory consumption was 316.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:02:55,925 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 396.4 MB. Free memory is still 358.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:02:55,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.75 ms. Allocated memory is still 396.4 MB. Free memory was 353.1 MB in the beginning and 339.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:02:55,925 INFO L168 Benchmark]: Boogie Preprocessor took 39.11 ms. Allocated memory is still 396.4 MB. Free memory was 339.8 MB in the beginning and 337.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:02:55,925 INFO L168 Benchmark]: RCFGBuilder took 587.09 ms. Allocated memory is still 396.4 MB. Free memory was 337.2 MB in the beginning and 274.3 MB in the end (delta: 62.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 5.3 GB. [2018-02-02 09:02:55,925 INFO L168 Benchmark]: TraceAbstraction took 58292.41 ms. Allocated memory was 396.4 MB in the beginning and 1.0 GB in the end (delta: 612.4 MB). Free memory was 274.3 MB in the beginning and 648.8 MB in the end (delta: -374.5 MB). Peak memory consumption was 237.9 MB. Max. memory is 5.3 GB. [2018-02-02 09:02:55,926 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 396.4 MB. Free memory is still 358.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 200.75 ms. Allocated memory is still 396.4 MB. Free memory was 353.1 MB in the beginning and 339.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.11 ms. Allocated memory is still 396.4 MB. Free memory was 339.8 MB in the beginning and 337.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 587.09 ms. Allocated memory is still 396.4 MB. Free memory was 337.2 MB in the beginning and 274.3 MB in the end (delta: 62.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58292.41 ms. Allocated memory was 396.4 MB in the beginning and 1.0 GB in the end (delta: 612.4 MB). Free memory was 274.3 MB in the beginning and 648.8 MB in the end (delta: -374.5 MB). Peak memory consumption was 237.9 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 713). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 741). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 715). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 733). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 693). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 771). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 757). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 712). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 702). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 721). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 713). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 773). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 704). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 715). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 708). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 761). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 715). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 721). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 760). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 696). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 708). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 760). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 708). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 713). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 704). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 771). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 704). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 773). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 702). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 774). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 684). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 715). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 761). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 713). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 745). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 770). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 696). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 714). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 741). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 708). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 757). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 693). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 770). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 733). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 714). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 684). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 704). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 774). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 712). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 745). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was constructing difference of abstraction (425states) and interpolant automaton (currently 5 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (15 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 247 locations, 91 error locations. TIMEOUT Result, 58.2s OverallTime, 38 OverallIterations, 3 TraceHistogramMax, 45.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9137 SDtfs, 34573 SDslu, 43273 SDs, 0 SdLazy, 28824 SolverSat, 1089 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 29.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 899 GetRequests, 258 SyntacticMatches, 45 SemanticMatches, 596 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4239 ImplicationChecksByTransitivity, 19.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=429occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 37 MinimizatonAttempts, 9080 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 1824 NumberOfCodeBlocks, 1824 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 1781 ConstructedInterpolants, 92 QuantifiedInterpolants, 1248163 SizeOfPredicates, 119 NumberOfNonLiveVariables, 1098 ConjunctsInSsa, 275 ConjunctsInUnsatCore, 43 InterpolantComputations, 35 PerfectInterpolantSequences, 192/268 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/test-0521_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-02-55-932.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0521_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-02-55-932.csv Completed graceful shutdown