java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0521_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 18:48:34,535 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:48:34,537 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:48:34,547 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:48:34,547 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:48:34,547 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:48:34,548 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:48:34,549 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:48:34,550 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:48:34,551 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:48:34,552 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:48:34,552 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:48:34,553 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:48:34,554 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:48:34,554 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:48:34,556 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:48:34,558 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:48:34,559 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:48:34,560 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:48:34,561 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:48:34,562 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:48:34,562 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:48:34,563 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:48:34,563 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:48:34,564 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:48:34,565 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:48:34,565 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:48:34,565 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:48:34,566 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:48:34,566 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:48:34,566 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:48:34,567 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 18:48:34,576 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:48:34,576 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:48:34,577 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:48:34,577 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:48:34,577 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:48:34,578 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:48:34,578 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:48:34,578 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:48:34,578 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:48:34,578 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:48:34,578 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:48:34,579 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:48:34,579 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:48:34,579 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:48:34,579 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:48:34,579 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:48:34,579 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:48:34,580 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:48:34,580 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:48:34,580 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:48:34,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:48:34,580 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:48:34,580 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:48:34,580 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:48:34,581 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:48:34,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:48:34,617 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:48:34,620 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:48:34,621 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:48:34,622 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:48:34,622 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 18:48:34,769 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:48:34,771 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:48:34,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:48:34,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:48:34,777 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:48:34,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:48:34" (1/1) ... [2018-02-02 18:48:34,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3390db28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:48:34, skipping insertion in model container [2018-02-02 18:48:34,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:48:34" (1/1) ... [2018-02-02 18:48:34,794 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:48:34,824 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:48:34,913 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:48:34,932 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:48:34,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:48:34 WrapperNode [2018-02-02 18:48:34,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:48:34,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:48:34,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:48:34,940 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:48:34,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:48:34" (1/1) ... [2018-02-02 18:48:34,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:48:34" (1/1) ... [2018-02-02 18:48:34,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:48:34" (1/1) ... [2018-02-02 18:48:34,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:48:34" (1/1) ... [2018-02-02 18:48:34,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:48:34" (1/1) ... [2018-02-02 18:48:34,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:48:34" (1/1) ... [2018-02-02 18:48:34,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:48:34" (1/1) ... [2018-02-02 18:48:34,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:48:34,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:48:34,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:48:34,975 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:48:34,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:48:34" (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 18:48:35,009 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:48:35,009 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:48:35,009 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:48:35,009 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 18:48:35,009 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 18:48:35,009 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 18:48:35,010 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 18:48:35,010 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:48:35,010 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:48:35,010 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:48:35,010 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 18:48:35,010 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 18:48:35,010 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:48:35,010 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:48:35,010 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:48:35,010 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:48:35,520 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:48:35,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:48:35 BoogieIcfgContainer [2018-02-02 18:48:35,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:48:35,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:48:35,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:48:35,523 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:48:35,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:48:34" (1/3) ... [2018-02-02 18:48:35,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364ab999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:48:35, skipping insertion in model container [2018-02-02 18:48:35,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:48:34" (2/3) ... [2018-02-02 18:48:35,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364ab999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:48:35, skipping insertion in model container [2018-02-02 18:48:35,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:48:35" (3/3) ... [2018-02-02 18:48:35,526 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0521_true-valid-memsafety.i [2018-02-02 18:48:35,531 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:48:35,540 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 91 error locations. [2018-02-02 18:48:35,568 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:48:35,569 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:48:35,569 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:48:35,569 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:48:35,569 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:48:35,569 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:48:35,569 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:48:35,570 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:48:35,570 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:48:35,585 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states. [2018-02-02 18:48:35,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 18:48:35,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:35,592 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:48:35,592 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 18:48:35,595 INFO L82 PathProgramCache]: Analyzing trace with hash 2006593009, now seen corresponding path program 1 times [2018-02-02 18:48:35,596 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:35,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:35,625 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:35,626 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:35,626 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:35,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:35,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:48:35,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:35,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:48:35,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 18:48:35,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 18:48:35,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 18:48:35,756 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 2 states. [2018-02-02 18:48:35,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:35,777 INFO L93 Difference]: Finished difference Result 247 states and 274 transitions. [2018-02-02 18:48:35,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 18:48:35,778 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-02-02 18:48:35,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:35,786 INFO L225 Difference]: With dead ends: 247 [2018-02-02 18:48:35,786 INFO L226 Difference]: Without dead ends: 244 [2018-02-02 18:48:35,787 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 18:48:35,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-02 18:48:35,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2018-02-02 18:48:35,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 18:48:35,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 271 transitions. [2018-02-02 18:48:35,814 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 271 transitions. Word has length 10 [2018-02-02 18:48:35,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:35,814 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 271 transitions. [2018-02-02 18:48:35,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 18:48:35,814 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 271 transitions. [2018-02-02 18:48:35,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 18:48:35,815 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:35,815 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:48:35,815 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 18:48:35,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1287736010, now seen corresponding path program 1 times [2018-02-02 18:48:35,816 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:35,816 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:35,816 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:35,816 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:35,816 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:35,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:35,876 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 18:48:35,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:35,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:48:35,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:48:35,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:48:35,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:48:35,878 INFO L87 Difference]: Start difference. First operand 244 states and 271 transitions. Second operand 4 states. [2018-02-02 18:48:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:35,983 INFO L93 Difference]: Finished difference Result 561 states and 618 transitions. [2018-02-02 18:48:35,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:48:35,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 18:48:35,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:35,986 INFO L225 Difference]: With dead ends: 561 [2018-02-02 18:48:35,986 INFO L226 Difference]: Without dead ends: 561 [2018-02-02 18:48:35,987 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 18:48:35,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-02-02 18:48:35,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 256. [2018-02-02 18:48:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-02 18:48:36,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 285 transitions. [2018-02-02 18:48:36,001 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 285 transitions. Word has length 12 [2018-02-02 18:48:36,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:36,002 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 285 transitions. [2018-02-02 18:48:36,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:48:36,002 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 285 transitions. [2018-02-02 18:48:36,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 18:48:36,002 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:36,002 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:48:36,003 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 18:48:36,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1264312096, now seen corresponding path program 1 times [2018-02-02 18:48:36,003 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:36,003 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:36,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:36,004 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:36,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:36,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:36,033 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 18:48:36,033 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:36,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:48:36,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:48:36,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:48:36,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:48:36,033 INFO L87 Difference]: Start difference. First operand 256 states and 285 transitions. Second operand 4 states. [2018-02-02 18:48:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:36,289 INFO L93 Difference]: Finished difference Result 416 states and 464 transitions. [2018-02-02 18:48:36,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:48:36,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 18:48:36,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:36,292 INFO L225 Difference]: With dead ends: 416 [2018-02-02 18:48:36,292 INFO L226 Difference]: Without dead ends: 416 [2018-02-02 18:48:36,292 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 18:48:36,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-02-02 18:48:36,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 254. [2018-02-02 18:48:36,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 18:48:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 283 transitions. [2018-02-02 18:48:36,301 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 283 transitions. Word has length 13 [2018-02-02 18:48:36,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:36,302 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 283 transitions. [2018-02-02 18:48:36,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:48:36,302 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 283 transitions. [2018-02-02 18:48:36,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 18:48:36,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:36,303 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:48:36,303 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 18:48:36,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1264312095, now seen corresponding path program 1 times [2018-02-02 18:48:36,303 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:36,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:36,304 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:36,304 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:36,304 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:36,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:36,364 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 18:48:36,364 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:36,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:48:36,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:48:36,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:48:36,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:48:36,365 INFO L87 Difference]: Start difference. First operand 254 states and 283 transitions. Second operand 4 states. [2018-02-02 18:48:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:36,523 INFO L93 Difference]: Finished difference Result 349 states and 392 transitions. [2018-02-02 18:48:36,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:48:36,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 18:48:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:36,525 INFO L225 Difference]: With dead ends: 349 [2018-02-02 18:48:36,525 INFO L226 Difference]: Without dead ends: 349 [2018-02-02 18:48:36,525 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 18:48:36,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-02-02 18:48:36,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 252. [2018-02-02 18:48:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-02-02 18:48:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 281 transitions. [2018-02-02 18:48:36,532 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 281 transitions. Word has length 13 [2018-02-02 18:48:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:36,532 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 281 transitions. [2018-02-02 18:48:36,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:48:36,533 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 281 transitions. [2018-02-02 18:48:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 18:48:36,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:36,533 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 18:48:36,533 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 18:48:36,534 INFO L82 PathProgramCache]: Analyzing trace with hash 184691868, now seen corresponding path program 1 times [2018-02-02 18:48:36,534 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:36,534 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:36,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:36,535 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:36,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:36,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:36,569 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 18:48:36,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:36,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:48:36,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:48:36,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:48:36,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:48:36,570 INFO L87 Difference]: Start difference. First operand 252 states and 281 transitions. Second operand 5 states. [2018-02-02 18:48:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:36,634 INFO L93 Difference]: Finished difference Result 327 states and 364 transitions. [2018-02-02 18:48:36,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 18:48:36,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 18:48:36,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:36,636 INFO L225 Difference]: With dead ends: 327 [2018-02-02 18:48:36,636 INFO L226 Difference]: Without dead ends: 327 [2018-02-02 18:48:36,636 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 18:48:36,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-02 18:48:36,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 292. [2018-02-02 18:48:36,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-02 18:48:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 344 transitions. [2018-02-02 18:48:36,640 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 344 transitions. Word has length 20 [2018-02-02 18:48:36,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:36,640 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 344 transitions. [2018-02-02 18:48:36,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:48:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 344 transitions. [2018-02-02 18:48:36,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 18:48:36,641 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:36,641 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 18:48:36,641 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 18:48:36,641 INFO L82 PathProgramCache]: Analyzing trace with hash 415972895, now seen corresponding path program 1 times [2018-02-02 18:48:36,641 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:36,642 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:36,642 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:36,642 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:36,642 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:36,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:36,683 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 18:48:36,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:36,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:48:36,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:48:36,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:48:36,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:48:36,684 INFO L87 Difference]: Start difference. First operand 292 states and 344 transitions. Second operand 4 states. [2018-02-02 18:48:36,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:36,849 INFO L93 Difference]: Finished difference Result 454 states and 524 transitions. [2018-02-02 18:48:36,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:48:36,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-02 18:48:36,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:36,851 INFO L225 Difference]: With dead ends: 454 [2018-02-02 18:48:36,851 INFO L226 Difference]: Without dead ends: 454 [2018-02-02 18:48:36,851 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 18:48:36,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-02-02 18:48:36,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 290. [2018-02-02 18:48:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-02 18:48:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 342 transitions. [2018-02-02 18:48:36,855 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 342 transitions. Word has length 20 [2018-02-02 18:48:36,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:36,855 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 342 transitions. [2018-02-02 18:48:36,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:48:36,855 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 342 transitions. [2018-02-02 18:48:36,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 18:48:36,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:36,856 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 18:48:36,856 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 18:48:36,856 INFO L82 PathProgramCache]: Analyzing trace with hash 415972896, now seen corresponding path program 1 times [2018-02-02 18:48:36,856 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:36,856 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:36,856 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:36,857 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:36,857 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:36,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:48:36,896 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:36,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:48:36,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:48:36,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:48:36,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:48:36,897 INFO L87 Difference]: Start difference. First operand 290 states and 342 transitions. Second operand 4 states. [2018-02-02 18:48:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:37,029 INFO L93 Difference]: Finished difference Result 387 states and 452 transitions. [2018-02-02 18:48:37,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:48:37,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-02 18:48:37,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:37,030 INFO L225 Difference]: With dead ends: 387 [2018-02-02 18:48:37,030 INFO L226 Difference]: Without dead ends: 387 [2018-02-02 18:48:37,031 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 18:48:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-02 18:48:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 288. [2018-02-02 18:48:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-02 18:48:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 340 transitions. [2018-02-02 18:48:37,037 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 340 transitions. Word has length 20 [2018-02-02 18:48:37,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:37,037 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 340 transitions. [2018-02-02 18:48:37,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:48:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 340 transitions. [2018-02-02 18:48:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 18:48:37,038 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:37,038 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 18:48:37,038 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 18:48:37,039 INFO L82 PathProgramCache]: Analyzing trace with hash 308407885, now seen corresponding path program 1 times [2018-02-02 18:48:37,039 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:37,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:37,040 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:37,040 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:37,040 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:37,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:37,075 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 18:48:37,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:37,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:48:37,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:48:37,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:48:37,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:48:37,076 INFO L87 Difference]: Start difference. First operand 288 states and 340 transitions. Second operand 5 states. [2018-02-02 18:48:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:37,153 INFO L93 Difference]: Finished difference Result 319 states and 351 transitions. [2018-02-02 18:48:37,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:48:37,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 18:48:37,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:37,155 INFO L225 Difference]: With dead ends: 319 [2018-02-02 18:48:37,155 INFO L226 Difference]: Without dead ends: 319 [2018-02-02 18:48:37,155 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 18:48:37,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-02 18:48:37,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 275. [2018-02-02 18:48:37,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-02 18:48:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 307 transitions. [2018-02-02 18:48:37,159 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 307 transitions. Word has length 23 [2018-02-02 18:48:37,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:37,159 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 307 transitions. [2018-02-02 18:48:37,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:48:37,159 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 307 transitions. [2018-02-02 18:48:37,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 18:48:37,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:37,160 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 18:48:37,160 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 18:48:37,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1728935830, now seen corresponding path program 1 times [2018-02-02 18:48:37,160 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:37,160 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:37,161 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:37,161 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:37,161 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:37,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:37,205 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 18:48:37,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:37,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:48:37,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:48:37,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:48:37,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:48:37,207 INFO L87 Difference]: Start difference. First operand 275 states and 307 transitions. Second operand 5 states. [2018-02-02 18:48:37,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:37,461 INFO L93 Difference]: Finished difference Result 457 states and 509 transitions. [2018-02-02 18:48:37,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 18:48:37,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-02 18:48:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:37,463 INFO L225 Difference]: With dead ends: 457 [2018-02-02 18:48:37,463 INFO L226 Difference]: Without dead ends: 457 [2018-02-02 18:48:37,463 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 18:48:37,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-02-02 18:48:37,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 276. [2018-02-02 18:48:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-02 18:48:37,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 310 transitions. [2018-02-02 18:48:37,469 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 310 transitions. Word has length 28 [2018-02-02 18:48:37,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:37,469 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 310 transitions. [2018-02-02 18:48:37,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:48:37,470 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 310 transitions. [2018-02-02 18:48:37,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 18:48:37,470 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:37,470 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 18:48:37,470 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 18:48:37,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1728935829, now seen corresponding path program 1 times [2018-02-02 18:48:37,471 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:37,471 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:37,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:37,472 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:37,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:37,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:37,534 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 18:48:37,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:37,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:48:37,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:48:37,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:48:37,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:48:37,536 INFO L87 Difference]: Start difference. First operand 276 states and 310 transitions. Second operand 6 states. [2018-02-02 18:48:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:37,816 INFO L93 Difference]: Finished difference Result 387 states and 437 transitions. [2018-02-02 18:48:37,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 18:48:37,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-02 18:48:37,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:37,818 INFO L225 Difference]: With dead ends: 387 [2018-02-02 18:48:37,818 INFO L226 Difference]: Without dead ends: 387 [2018-02-02 18:48:37,818 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 18:48:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-02 18:48:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 275. [2018-02-02 18:48:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-02 18:48:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 309 transitions. [2018-02-02 18:48:37,823 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 309 transitions. Word has length 28 [2018-02-02 18:48:37,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:37,824 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 309 transitions. [2018-02-02 18:48:37,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:48:37,824 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 309 transitions. [2018-02-02 18:48:37,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 18:48:37,825 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:37,825 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 18:48:37,825 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 18:48:37,826 INFO L82 PathProgramCache]: Analyzing trace with hash -887445228, now seen corresponding path program 1 times [2018-02-02 18:48:37,826 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:37,826 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:37,827 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:37,827 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:37,827 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:37,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:37,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:48:37,854 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:37,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:48:37,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:48:37,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:48:37,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:48:37,855 INFO L87 Difference]: Start difference. First operand 275 states and 309 transitions. Second operand 3 states. [2018-02-02 18:48:37,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:37,956 INFO L93 Difference]: Finished difference Result 278 states and 311 transitions. [2018-02-02 18:48:37,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:48:37,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-02-02 18:48:37,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:37,959 INFO L225 Difference]: With dead ends: 278 [2018-02-02 18:48:37,959 INFO L226 Difference]: Without dead ends: 255 [2018-02-02 18:48:37,959 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 18:48:37,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-02 18:48:37,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2018-02-02 18:48:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 18:48:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 285 transitions. [2018-02-02 18:48:37,962 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 285 transitions. Word has length 30 [2018-02-02 18:48:37,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:37,962 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 285 transitions. [2018-02-02 18:48:37,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:48:37,963 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 285 transitions. [2018-02-02 18:48:37,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 18:48:37,963 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:37,963 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 18:48:37,963 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 18:48:37,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1380917583, now seen corresponding path program 1 times [2018-02-02 18:48:37,964 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:37,964 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:37,965 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:37,965 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:37,965 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:37,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:38,083 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 18:48:38,083 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:38,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 18:48:38,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 18:48:38,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 18:48:38,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:48:38,084 INFO L87 Difference]: Start difference. First operand 254 states and 285 transitions. Second operand 12 states. [2018-02-02 18:48:39,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:39,216 INFO L93 Difference]: Finished difference Result 1030 states and 1162 transitions. [2018-02-02 18:48:39,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 18:48:39,217 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-02-02 18:48:39,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:39,219 INFO L225 Difference]: With dead ends: 1030 [2018-02-02 18:48:39,219 INFO L226 Difference]: Without dead ends: 1030 [2018-02-02 18:48:39,219 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 18:48:39,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2018-02-02 18:48:39,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 253. [2018-02-02 18:48:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-02-02 18:48:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 284 transitions. [2018-02-02 18:48:39,224 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 284 transitions. Word has length 32 [2018-02-02 18:48:39,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:39,225 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 284 transitions. [2018-02-02 18:48:39,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 18:48:39,225 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 284 transitions. [2018-02-02 18:48:39,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 18:48:39,225 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:39,225 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 18:48:39,225 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 18:48:39,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1380917584, now seen corresponding path program 1 times [2018-02-02 18:48:39,226 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:39,226 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:39,226 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:39,226 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:39,226 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:39,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:39,358 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 18:48:39,358 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:39,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 18:48:39,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:48:39,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:48:39,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:48:39,359 INFO L87 Difference]: Start difference. First operand 253 states and 284 transitions. Second operand 11 states. [2018-02-02 18:48:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:40,624 INFO L93 Difference]: Finished difference Result 1175 states and 1331 transitions. [2018-02-02 18:48:40,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 18:48:40,624 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-02-02 18:48:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:40,628 INFO L225 Difference]: With dead ends: 1175 [2018-02-02 18:48:40,628 INFO L226 Difference]: Without dead ends: 1175 [2018-02-02 18:48:40,628 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=258, Invalid=672, Unknown=0, NotChecked=0, Total=930 [2018-02-02 18:48:40,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2018-02-02 18:48:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 252. [2018-02-02 18:48:40,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-02-02 18:48:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 283 transitions. [2018-02-02 18:48:40,636 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 283 transitions. Word has length 32 [2018-02-02 18:48:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:40,636 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 283 transitions. [2018-02-02 18:48:40,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:48:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 283 transitions. [2018-02-02 18:48:40,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 18:48:40,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:40,637 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 18:48:40,637 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 18:48:40,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1718989974, now seen corresponding path program 1 times [2018-02-02 18:48:40,637 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:40,637 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:40,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:40,638 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:40,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:40,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:40,664 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 18:48:40,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:40,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:48:40,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:48:40,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:48:40,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:48:40,665 INFO L87 Difference]: Start difference. First operand 252 states and 283 transitions. Second operand 4 states. [2018-02-02 18:48:40,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:40,852 INFO L93 Difference]: Finished difference Result 775 states and 871 transitions. [2018-02-02 18:48:40,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:48:40,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-02 18:48:40,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:40,854 INFO L225 Difference]: With dead ends: 775 [2018-02-02 18:48:40,855 INFO L226 Difference]: Without dead ends: 775 [2018-02-02 18:48:40,855 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 18:48:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2018-02-02 18:48:40,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 250. [2018-02-02 18:48:40,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-02 18:48:40,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 281 transitions. [2018-02-02 18:48:40,861 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 281 transitions. Word has length 35 [2018-02-02 18:48:40,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:40,861 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 281 transitions. [2018-02-02 18:48:40,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:48:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 281 transitions. [2018-02-02 18:48:40,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 18:48:40,862 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:40,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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:48:40,862 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 18:48:40,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1718989975, now seen corresponding path program 1 times [2018-02-02 18:48:40,862 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:40,863 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:40,864 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:40,864 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:40,864 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:40,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:40,943 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 18:48:40,943 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:40,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:48:40,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:48:40,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:48:40,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:48:40,944 INFO L87 Difference]: Start difference. First operand 250 states and 281 transitions. Second operand 6 states. [2018-02-02 18:48:41,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:41,234 INFO L93 Difference]: Finished difference Result 474 states and 541 transitions. [2018-02-02 18:48:41,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 18:48:41,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 18:48:41,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:41,236 INFO L225 Difference]: With dead ends: 474 [2018-02-02 18:48:41,236 INFO L226 Difference]: Without dead ends: 474 [2018-02-02 18:48:41,237 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 18:48:41,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-02-02 18:48:41,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 256. [2018-02-02 18:48:41,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-02 18:48:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 292 transitions. [2018-02-02 18:48:41,241 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 292 transitions. Word has length 35 [2018-02-02 18:48:41,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:41,241 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 292 transitions. [2018-02-02 18:48:41,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:48:41,241 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 292 transitions. [2018-02-02 18:48:41,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 18:48:41,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:41,242 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 18:48:41,242 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 18:48:41,242 INFO L82 PathProgramCache]: Analyzing trace with hash 320441296, now seen corresponding path program 1 times [2018-02-02 18:48:41,242 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:41,242 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:41,243 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:41,243 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:41,243 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:41,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:41,273 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 18:48:41,273 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:41,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 18:48:41,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:48:41,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:48:41,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:48:41,274 INFO L87 Difference]: Start difference. First operand 256 states and 292 transitions. Second operand 6 states. [2018-02-02 18:48:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:41,353 INFO L93 Difference]: Finished difference Result 453 states and 505 transitions. [2018-02-02 18:48:41,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 18:48:41,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 18:48:41,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:41,403 INFO L225 Difference]: With dead ends: 453 [2018-02-02 18:48:41,403 INFO L226 Difference]: Without dead ends: 453 [2018-02-02 18:48:41,404 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 18:48:41,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-02-02 18:48:41,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 254. [2018-02-02 18:48:41,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 18:48:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 287 transitions. [2018-02-02 18:48:41,407 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 287 transitions. Word has length 36 [2018-02-02 18:48:41,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:41,407 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 287 transitions. [2018-02-02 18:48:41,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:48:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 287 transitions. [2018-02-02 18:48:41,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 18:48:41,407 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:41,407 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 18:48:41,407 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 18:48:41,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1534000121, now seen corresponding path program 1 times [2018-02-02 18:48:41,408 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:41,408 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:41,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:41,408 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:41,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:41,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:41,766 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 18:48:41,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:41,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 18:48:41,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 18:48:41,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 18:48:41,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-02-02 18:48:41,767 INFO L87 Difference]: Start difference. First operand 254 states and 287 transitions. Second operand 16 states. [2018-02-02 18:48:43,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:43,452 INFO L93 Difference]: Finished difference Result 685 states and 769 transitions. [2018-02-02 18:48:43,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 18:48:43,452 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-02-02 18:48:43,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:43,454 INFO L225 Difference]: With dead ends: 685 [2018-02-02 18:48:43,454 INFO L226 Difference]: Without dead ends: 685 [2018-02-02 18:48:43,454 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=401, Invalid=1159, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 18:48:43,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-02-02 18:48:43,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 247. [2018-02-02 18:48:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-02 18:48:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 275 transitions. [2018-02-02 18:48:43,457 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 275 transitions. Word has length 38 [2018-02-02 18:48:43,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:43,457 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 275 transitions. [2018-02-02 18:48:43,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 18:48:43,458 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 275 transitions. [2018-02-02 18:48:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 18:48:43,458 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:43,458 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 18:48:43,458 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 18:48:43,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1535290008, now seen corresponding path program 1 times [2018-02-02 18:48:43,458 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:43,458 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:43,459 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:43,459 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:43,459 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:43,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:43,663 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 18:48:43,663 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:48:43,663 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:48:43,669 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:43,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:48:43,794 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 18:48:43,797 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 18:48:43,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:43,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:43,808 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 18:48:43,810 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 18:48:43,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:43,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:43,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:43,816 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-02-02 18:48:43,879 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 18:48:43,882 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 18:48:43,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:43,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:43,889 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 18:48:43,892 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 18:48:43,892 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:43,903 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:43,906 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 18:48:43,906 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-02-02 18:48:43,927 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 18:48:43,959 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:48:43,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 16 [2018-02-02 18:48:43,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 18:48:43,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 18:48:43,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-02-02 18:48:43,960 INFO L87 Difference]: Start difference. First operand 247 states and 275 transitions. Second operand 16 states. [2018-02-02 18:48:44,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:44,474 INFO L93 Difference]: Finished difference Result 570 states and 637 transitions. [2018-02-02 18:48:44,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 18:48:44,474 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-02-02 18:48:44,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:44,476 INFO L225 Difference]: With dead ends: 570 [2018-02-02 18:48:44,476 INFO L226 Difference]: Without dead ends: 570 [2018-02-02 18:48:44,476 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2018-02-02 18:48:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-02-02 18:48:44,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 275. [2018-02-02 18:48:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-02 18:48:44,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 304 transitions. [2018-02-02 18:48:44,482 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 304 transitions. Word has length 38 [2018-02-02 18:48:44,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:44,483 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 304 transitions. [2018-02-02 18:48:44,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 18:48:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 304 transitions. [2018-02-02 18:48:44,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 18:48:44,483 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:44,483 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 18:48:44,483 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 18:48:44,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1834854922, now seen corresponding path program 1 times [2018-02-02 18:48:44,484 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:44,484 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:44,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:44,485 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:44,485 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:44,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:44,520 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 18:48:44,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:44,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:48:44,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:48:44,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:48:44,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:48:44,521 INFO L87 Difference]: Start difference. First operand 275 states and 304 transitions. Second operand 5 states. [2018-02-02 18:48:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:44,792 INFO L93 Difference]: Finished difference Result 450 states and 499 transitions. [2018-02-02 18:48:44,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 18:48:44,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-02-02 18:48:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:44,794 INFO L225 Difference]: With dead ends: 450 [2018-02-02 18:48:44,795 INFO L226 Difference]: Without dead ends: 450 [2018-02-02 18:48:44,795 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 18:48:44,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-02-02 18:48:44,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 318. [2018-02-02 18:48:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-02-02 18:48:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 376 transitions. [2018-02-02 18:48:44,801 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 376 transitions. Word has length 45 [2018-02-02 18:48:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:44,802 INFO L432 AbstractCegarLoop]: Abstraction has 318 states and 376 transitions. [2018-02-02 18:48:44,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:48:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 376 transitions. [2018-02-02 18:48:44,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 18:48:44,802 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:44,803 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 18:48:44,803 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 18:48:44,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1834854923, now seen corresponding path program 1 times [2018-02-02 18:48:44,803 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:44,803 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:44,804 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:44,804 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:44,804 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:44,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:44,871 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 18:48:44,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:44,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:48:44,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:48:44,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:48:44,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:48:44,872 INFO L87 Difference]: Start difference. First operand 318 states and 376 transitions. Second operand 6 states. [2018-02-02 18:48:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:45,185 INFO L93 Difference]: Finished difference Result 565 states and 680 transitions. [2018-02-02 18:48:45,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 18:48:45,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-02-02 18:48:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:45,186 INFO L225 Difference]: With dead ends: 565 [2018-02-02 18:48:45,186 INFO L226 Difference]: Without dead ends: 565 [2018-02-02 18:48:45,186 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 18:48:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-02-02 18:48:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 376. [2018-02-02 18:48:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-02-02 18:48:45,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 467 transitions. [2018-02-02 18:48:45,192 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 467 transitions. Word has length 45 [2018-02-02 18:48:45,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:45,192 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 467 transitions. [2018-02-02 18:48:45,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:48:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 467 transitions. [2018-02-02 18:48:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 18:48:45,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:45,193 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 18:48:45,193 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 18:48:45,193 INFO L82 PathProgramCache]: Analyzing trace with hash 120279583, now seen corresponding path program 1 times [2018-02-02 18:48:45,193 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:45,194 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:45,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:45,195 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:45,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:45,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:45,239 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 18:48:45,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:45,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 18:48:45,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 18:48:45,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 18:48:45,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:48:45,240 INFO L87 Difference]: Start difference. First operand 376 states and 467 transitions. Second operand 7 states. [2018-02-02 18:48:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:45,355 INFO L93 Difference]: Finished difference Result 505 states and 583 transitions. [2018-02-02 18:48:45,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 18:48:45,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-02-02 18:48:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:45,356 INFO L225 Difference]: With dead ends: 505 [2018-02-02 18:48:45,357 INFO L226 Difference]: Without dead ends: 505 [2018-02-02 18:48:45,357 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 18:48:45,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-02-02 18:48:45,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 375. [2018-02-02 18:48:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-02 18:48:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 463 transitions. [2018-02-02 18:48:45,361 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 463 transitions. Word has length 48 [2018-02-02 18:48:45,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:45,361 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 463 transitions. [2018-02-02 18:48:45,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 18:48:45,361 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 463 transitions. [2018-02-02 18:48:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 18:48:45,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:45,361 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 18:48:45,361 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 18:48:45,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1809870756, now seen corresponding path program 1 times [2018-02-02 18:48:45,362 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:45,362 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:45,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:45,362 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:45,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:45,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:45,392 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 18:48:45,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:45,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:48:45,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:48:45,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:48:45,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:48:45,392 INFO L87 Difference]: Start difference. First operand 375 states and 463 transitions. Second operand 6 states. [2018-02-02 18:48:45,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:45,626 INFO L93 Difference]: Finished difference Result 534 states and 619 transitions. [2018-02-02 18:48:45,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:48:45,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-02-02 18:48:45,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:45,628 INFO L225 Difference]: With dead ends: 534 [2018-02-02 18:48:45,628 INFO L226 Difference]: Without dead ends: 534 [2018-02-02 18:48:45,628 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 18:48:45,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-02-02 18:48:45,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 375. [2018-02-02 18:48:45,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-02 18:48:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 461 transitions. [2018-02-02 18:48:45,632 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 461 transitions. Word has length 50 [2018-02-02 18:48:45,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:45,632 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 461 transitions. [2018-02-02 18:48:45,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:48:45,632 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 461 transitions. [2018-02-02 18:48:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 18:48:45,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:45,633 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 18:48:45,633 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 18:48:45,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1809870755, now seen corresponding path program 1 times [2018-02-02 18:48:45,633 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:45,633 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:45,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:45,634 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:45,634 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:45,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:45,729 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 18:48:45,729 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:45,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 18:48:45,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 18:48:45,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 18:48:45,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:48:45,730 INFO L87 Difference]: Start difference. First operand 375 states and 461 transitions. Second operand 7 states. [2018-02-02 18:48:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:46,026 INFO L93 Difference]: Finished difference Result 559 states and 670 transitions. [2018-02-02 18:48:46,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:48:46,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-02-02 18:48:46,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:46,027 INFO L225 Difference]: With dead ends: 559 [2018-02-02 18:48:46,027 INFO L226 Difference]: Without dead ends: 559 [2018-02-02 18:48:46,028 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:48:46,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-02-02 18:48:46,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 375. [2018-02-02 18:48:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-02 18:48:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 460 transitions. [2018-02-02 18:48:46,032 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 460 transitions. Word has length 50 [2018-02-02 18:48:46,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:46,032 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 460 transitions. [2018-02-02 18:48:46,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 18:48:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 460 transitions. [2018-02-02 18:48:46,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 18:48:46,033 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:46,033 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 18:48:46,033 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 18:48:46,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1600702209, now seen corresponding path program 1 times [2018-02-02 18:48:46,033 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:46,033 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:46,034 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:46,034 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:46,034 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:46,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:46,109 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 18:48:46,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:46,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 18:48:46,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 18:48:46,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 18:48:46,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:48:46,110 INFO L87 Difference]: Start difference. First operand 375 states and 460 transitions. Second operand 12 states. [2018-02-02 18:48:46,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:46,660 INFO L93 Difference]: Finished difference Result 475 states and 557 transitions. [2018-02-02 18:48:46,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 18:48:46,661 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-02-02 18:48:46,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:46,662 INFO L225 Difference]: With dead ends: 475 [2018-02-02 18:48:46,662 INFO L226 Difference]: Without dead ends: 475 [2018-02-02 18:48:46,662 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 18:48:46,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-02-02 18:48:46,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 375. [2018-02-02 18:48:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-02 18:48:46,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 459 transitions. [2018-02-02 18:48:46,666 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 459 transitions. Word has length 54 [2018-02-02 18:48:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:46,667 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 459 transitions. [2018-02-02 18:48:46,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 18:48:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 459 transitions. [2018-02-02 18:48:46,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 18:48:46,667 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:46,667 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 18:48:46,668 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 18:48:46,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1600702210, now seen corresponding path program 1 times [2018-02-02 18:48:46,668 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:46,668 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:46,669 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:46,669 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:46,669 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:46,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:46,820 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 18:48:46,820 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:46,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 18:48:46,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 18:48:46,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 18:48:46,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 18:48:46,821 INFO L87 Difference]: Start difference. First operand 375 states and 459 transitions. Second operand 14 states. [2018-02-02 18:48:47,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:47,593 INFO L93 Difference]: Finished difference Result 619 states and 736 transitions. [2018-02-02 18:48:47,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 18:48:47,593 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-02-02 18:48:47,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:47,595 INFO L225 Difference]: With dead ends: 619 [2018-02-02 18:48:47,595 INFO L226 Difference]: Without dead ends: 619 [2018-02-02 18:48:47,595 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 18:48:47,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-02-02 18:48:47,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 393. [2018-02-02 18:48:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-02-02 18:48:47,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 482 transitions. [2018-02-02 18:48:47,598 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 482 transitions. Word has length 54 [2018-02-02 18:48:47,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:47,599 INFO L432 AbstractCegarLoop]: Abstraction has 393 states and 482 transitions. [2018-02-02 18:48:47,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 18:48:47,599 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 482 transitions. [2018-02-02 18:48:47,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 18:48:47,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:47,599 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 18:48:47,600 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 18:48:47,600 INFO L82 PathProgramCache]: Analyzing trace with hash -497243786, now seen corresponding path program 1 times [2018-02-02 18:48:47,600 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:47,600 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:47,600 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:47,600 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:47,600 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:47,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:47,632 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 18:48:47,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:47,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:48:47,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:48:47,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:48:47,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:48:47,633 INFO L87 Difference]: Start difference. First operand 393 states and 482 transitions. Second operand 3 states. [2018-02-02 18:48:47,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:47,712 INFO L93 Difference]: Finished difference Result 392 states and 481 transitions. [2018-02-02 18:48:47,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:48:47,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-02-02 18:48:47,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:47,713 INFO L225 Difference]: With dead ends: 392 [2018-02-02 18:48:47,713 INFO L226 Difference]: Without dead ends: 392 [2018-02-02 18:48:47,713 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 18:48:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-02-02 18:48:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2018-02-02 18:48:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-02-02 18:48:47,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 481 transitions. [2018-02-02 18:48:47,717 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 481 transitions. Word has length 54 [2018-02-02 18:48:47,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:47,718 INFO L432 AbstractCegarLoop]: Abstraction has 392 states and 481 transitions. [2018-02-02 18:48:47,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:48:47,718 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 481 transitions. [2018-02-02 18:48:47,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 18:48:47,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:47,718 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 18:48:47,718 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 18:48:47,719 INFO L82 PathProgramCache]: Analyzing trace with hash -497243785, now seen corresponding path program 1 times [2018-02-02 18:48:47,719 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:47,719 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:47,720 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:47,720 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:47,720 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:47,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:47,817 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 18:48:47,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:47,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 18:48:47,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:48:47,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:48:47,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:48:47,818 INFO L87 Difference]: Start difference. First operand 392 states and 481 transitions. Second operand 11 states. [2018-02-02 18:48:48,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:48,117 INFO L93 Difference]: Finished difference Result 438 states and 517 transitions. [2018-02-02 18:48:48,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 18:48:48,117 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-02-02 18:48:48,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:48,118 INFO L225 Difference]: With dead ends: 438 [2018-02-02 18:48:48,119 INFO L226 Difference]: Without dead ends: 438 [2018-02-02 18:48:48,119 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 18:48:48,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-02-02 18:48:48,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 378. [2018-02-02 18:48:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-02-02 18:48:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 462 transitions. [2018-02-02 18:48:48,121 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 462 transitions. Word has length 54 [2018-02-02 18:48:48,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:48,121 INFO L432 AbstractCegarLoop]: Abstraction has 378 states and 462 transitions. [2018-02-02 18:48:48,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:48:48,122 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 462 transitions. [2018-02-02 18:48:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 18:48:48,122 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:48,122 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 18:48:48,122 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 18:48:48,122 INFO L82 PathProgramCache]: Analyzing trace with hash 750527692, now seen corresponding path program 2 times [2018-02-02 18:48:48,123 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:48,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:48,123 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:48,123 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:48,123 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:48,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:48,447 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 18:48:48,447 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:48:48,447 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:48:48,452 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:48:48,473 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 18:48:48,474 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:48:48,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:48:48,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:48,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:48,486 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 18:48:48,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:48,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:48,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-02 18:48:48,536 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 18:48:48,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:48,542 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 18:48:48,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2018-02-02 18:48:48,611 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 18:48:48,614 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 18:48:48,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:48,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:48,624 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 18:48:48,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:35 [2018-02-02 18:48:48,710 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 18:48:48,712 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 18:48:48,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:48,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:48,721 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 18:48:48,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:20 [2018-02-02 18:48:48,774 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 18:48:48,792 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:48:48,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [19] total 28 [2018-02-02 18:48:48,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 18:48:48,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 18:48:48,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2018-02-02 18:48:48,793 INFO L87 Difference]: Start difference. First operand 378 states and 462 transitions. Second operand 29 states. [2018-02-02 18:48:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:50,727 INFO L93 Difference]: Finished difference Result 1033 states and 1241 transitions. [2018-02-02 18:48:50,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 18:48:50,727 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-02-02 18:48:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:50,730 INFO L225 Difference]: With dead ends: 1033 [2018-02-02 18:48:50,730 INFO L226 Difference]: Without dead ends: 1033 [2018-02-02 18:48:50,730 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=594, Invalid=2162, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 18:48:50,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2018-02-02 18:48:50,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 377. [2018-02-02 18:48:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-02-02 18:48:50,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 461 transitions. [2018-02-02 18:48:50,736 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 461 transitions. Word has length 54 [2018-02-02 18:48:50,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:50,736 INFO L432 AbstractCegarLoop]: Abstraction has 377 states and 461 transitions. [2018-02-02 18:48:50,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 18:48:50,736 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 461 transitions. [2018-02-02 18:48:50,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 18:48:50,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:50,737 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 18:48:50,737 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 18:48:50,737 INFO L82 PathProgramCache]: Analyzing trace with hash 750527693, now seen corresponding path program 1 times [2018-02-02 18:48:50,737 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:50,737 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:50,738 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:50,738 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:48:50,738 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:50,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:50,999 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 18:48:51,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:48:51,000 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:48:51,004 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:51,027 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:48:51,029 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 18:48:51,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:51,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:51,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 18:48:51,068 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:51,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, 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 18:48:51,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:51,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:51,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:51,075 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 18:48:51,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:51,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:51,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-02 18:48:51,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 18:48:51,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:51,121 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 18:48:51,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2018-02-02 18:48:51,189 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 18:48:51,190 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 18:48:51,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:51,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:51,203 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 18:48:51,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 18:48:51,204 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:51,206 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:51,216 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 18:48:51,216 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:47 [2018-02-02 18:48:51,325 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 18:48:51,327 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 18:48:51,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:51,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:51,336 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 18:48:51,337 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 18:48:51,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:51,338 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:51,343 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 18:48:51,343 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:65, output treesize:23 [2018-02-02 18:48:51,394 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 18:48:51,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:48:51,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-02-02 18:48:51,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 18:48:51,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 18:48:51,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2018-02-02 18:48:51,412 INFO L87 Difference]: Start difference. First operand 377 states and 461 transitions. Second operand 30 states. [2018-02-02 18:48:53,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:53,441 INFO L93 Difference]: Finished difference Result 1179 states and 1447 transitions. [2018-02-02 18:48:53,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 18:48:53,441 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2018-02-02 18:48:53,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:53,443 INFO L225 Difference]: With dead ends: 1179 [2018-02-02 18:48:53,443 INFO L226 Difference]: Without dead ends: 1179 [2018-02-02 18:48:53,444 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=708, Invalid=2372, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 18:48:53,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-02-02 18:48:53,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 383. [2018-02-02 18:48:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-02 18:48:53,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 472 transitions. [2018-02-02 18:48:53,448 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 472 transitions. Word has length 54 [2018-02-02 18:48:53,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:53,448 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 472 transitions. [2018-02-02 18:48:53,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 18:48:53,449 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 472 transitions. [2018-02-02 18:48:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 18:48:53,449 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:53,449 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 18:48:53,449 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 18:48:53,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1483410129, now seen corresponding path program 1 times [2018-02-02 18:48:53,449 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:53,449 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:53,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:53,450 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:53,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:53,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:53,628 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 18:48:53,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:53,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 18:48:53,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 18:48:53,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 18:48:53,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-02-02 18:48:53,629 INFO L87 Difference]: Start difference. First operand 383 states and 472 transitions. Second operand 17 states. [2018-02-02 18:48:54,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:54,443 INFO L93 Difference]: Finished difference Result 541 states and 629 transitions. [2018-02-02 18:48:54,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 18:48:54,443 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-02-02 18:48:54,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:54,444 INFO L225 Difference]: With dead ends: 541 [2018-02-02 18:48:54,444 INFO L226 Difference]: Without dead ends: 541 [2018-02-02 18:48:54,445 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 18:48:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-02-02 18:48:54,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 383. [2018-02-02 18:48:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-02 18:48:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 471 transitions. [2018-02-02 18:48:54,448 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 471 transitions. Word has length 57 [2018-02-02 18:48:54,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:54,449 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 471 transitions. [2018-02-02 18:48:54,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 18:48:54,449 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 471 transitions. [2018-02-02 18:48:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 18:48:54,449 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:54,449 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 18:48:54,449 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 18:48:54,449 INFO L82 PathProgramCache]: Analyzing trace with hash 713611172, now seen corresponding path program 1 times [2018-02-02 18:48:54,449 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:54,449 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:54,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:54,450 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:54,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:54,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:54,473 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 18:48:54,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:54,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:48:54,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:48:54,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:48:54,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:48:54,473 INFO L87 Difference]: Start difference. First operand 383 states and 471 transitions. Second operand 3 states. [2018-02-02 18:48:54,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:54,570 INFO L93 Difference]: Finished difference Result 382 states and 470 transitions. [2018-02-02 18:48:54,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:48:54,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-02-02 18:48:54,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:54,571 INFO L225 Difference]: With dead ends: 382 [2018-02-02 18:48:54,572 INFO L226 Difference]: Without dead ends: 382 [2018-02-02 18:48:54,572 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 18:48:54,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-02 18:48:54,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-02-02 18:48:54,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-02 18:48:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 470 transitions. [2018-02-02 18:48:54,576 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 470 transitions. Word has length 57 [2018-02-02 18:48:54,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:54,576 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 470 transitions. [2018-02-02 18:48:54,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:48:54,577 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 470 transitions. [2018-02-02 18:48:54,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 18:48:54,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:54,577 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 18:48:54,577 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 18:48:54,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1414427259, now seen corresponding path program 1 times [2018-02-02 18:48:54,578 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:54,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:54,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:54,579 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:54,579 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:54,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:54,717 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 18:48:54,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:54,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 18:48:54,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 18:48:54,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 18:48:54,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:48:54,718 INFO L87 Difference]: Start difference. First operand 382 states and 470 transitions. Second operand 10 states. [2018-02-02 18:48:55,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:55,303 INFO L93 Difference]: Finished difference Result 752 states and 884 transitions. [2018-02-02 18:48:55,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 18:48:55,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-02-02 18:48:55,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:55,305 INFO L225 Difference]: With dead ends: 752 [2018-02-02 18:48:55,305 INFO L226 Difference]: Without dead ends: 752 [2018-02-02 18:48:55,305 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 18:48:55,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-02-02 18:48:55,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 424. [2018-02-02 18:48:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-02-02 18:48:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 546 transitions. [2018-02-02 18:48:55,309 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 546 transitions. Word has length 59 [2018-02-02 18:48:55,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:55,309 INFO L432 AbstractCegarLoop]: Abstraction has 424 states and 546 transitions. [2018-02-02 18:48:55,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 18:48:55,309 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 546 transitions. [2018-02-02 18:48:55,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 18:48:55,309 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:55,310 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 18:48:55,310 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 18:48:55,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1352389134, now seen corresponding path program 1 times [2018-02-02 18:48:55,310 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:55,310 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:55,310 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:55,310 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:55,310 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:55,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:55,344 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 18:48:55,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:55,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:48:55,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:48:55,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:48:55,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:48:55,345 INFO L87 Difference]: Start difference. First operand 424 states and 546 transitions. Second operand 4 states. [2018-02-02 18:48:55,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:55,472 INFO L93 Difference]: Finished difference Result 600 states and 770 transitions. [2018-02-02 18:48:55,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:48:55,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-02-02 18:48:55,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:55,473 INFO L225 Difference]: With dead ends: 600 [2018-02-02 18:48:55,473 INFO L226 Difference]: Without dead ends: 600 [2018-02-02 18:48:55,474 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 18:48:55,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-02-02 18:48:55,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 422. [2018-02-02 18:48:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-02 18:48:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 540 transitions. [2018-02-02 18:48:55,477 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 540 transitions. Word has length 60 [2018-02-02 18:48:55,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:55,477 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 540 transitions. [2018-02-02 18:48:55,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:48:55,477 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 540 transitions. [2018-02-02 18:48:55,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 18:48:55,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:55,478 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 18:48:55,478 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 18:48:55,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1352389133, now seen corresponding path program 1 times [2018-02-02 18:48:55,478 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:55,478 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:55,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:55,479 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:55,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:55,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:55,557 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 18:48:55,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:55,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 18:48:55,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 18:48:55,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 18:48:55,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:48:55,558 INFO L87 Difference]: Start difference. First operand 422 states and 540 transitions. Second operand 7 states. [2018-02-02 18:48:55,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:55,833 INFO L93 Difference]: Finished difference Result 662 states and 817 transitions. [2018-02-02 18:48:55,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 18:48:55,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-02-02 18:48:55,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:55,834 INFO L225 Difference]: With dead ends: 662 [2018-02-02 18:48:55,834 INFO L226 Difference]: Without dead ends: 662 [2018-02-02 18:48:55,835 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 18:48:55,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-02-02 18:48:55,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 429. [2018-02-02 18:48:55,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-02-02 18:48:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 551 transitions. [2018-02-02 18:48:55,838 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 551 transitions. Word has length 60 [2018-02-02 18:48:55,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:55,838 INFO L432 AbstractCegarLoop]: Abstraction has 429 states and 551 transitions. [2018-02-02 18:48:55,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 18:48:55,838 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 551 transitions. [2018-02-02 18:48:55,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 18:48:55,838 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:55,838 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 18:48:55,838 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 18:48:55,838 INFO L82 PathProgramCache]: Analyzing trace with hash -897571947, now seen corresponding path program 1 times [2018-02-02 18:48:55,839 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:55,839 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:55,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:55,839 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:55,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:55,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:55,853 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 18:48:55,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:55,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:48:55,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:48:55,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:48:55,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:48:55,854 INFO L87 Difference]: Start difference. First operand 429 states and 551 transitions. Second operand 3 states. [2018-02-02 18:48:55,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:55,910 INFO L93 Difference]: Finished difference Result 426 states and 545 transitions. [2018-02-02 18:48:55,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:48:55,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-02-02 18:48:55,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:55,911 INFO L225 Difference]: With dead ends: 426 [2018-02-02 18:48:55,911 INFO L226 Difference]: Without dead ends: 426 [2018-02-02 18:48:55,911 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 18:48:55,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-02-02 18:48:55,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2018-02-02 18:48:55,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-02-02 18:48:55,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 545 transitions. [2018-02-02 18:48:55,914 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 545 transitions. Word has length 60 [2018-02-02 18:48:55,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:55,914 INFO L432 AbstractCegarLoop]: Abstraction has 426 states and 545 transitions. [2018-02-02 18:48:55,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:48:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 545 transitions. [2018-02-02 18:48:55,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 18:48:55,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:55,915 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 18:48:55,915 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 18:48:55,916 INFO L82 PathProgramCache]: Analyzing trace with hash -897571946, now seen corresponding path program 1 times [2018-02-02 18:48:55,916 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:55,916 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:55,916 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:55,917 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:55,917 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:55,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:55,959 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 18:48:55,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:48:55,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:48:55,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:48:55,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:48:55,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:48:55,960 INFO L87 Difference]: Start difference. First operand 426 states and 545 transitions. Second operand 3 states. [2018-02-02 18:48:56,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:56,023 INFO L93 Difference]: Finished difference Result 423 states and 539 transitions. [2018-02-02 18:48:56,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:48:56,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-02-02 18:48:56,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:56,024 INFO L225 Difference]: With dead ends: 423 [2018-02-02 18:48:56,024 INFO L226 Difference]: Without dead ends: 423 [2018-02-02 18:48:56,025 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 18:48:56,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-02-02 18:48:56,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2018-02-02 18:48:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-02-02 18:48:56,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 539 transitions. [2018-02-02 18:48:56,028 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 539 transitions. Word has length 60 [2018-02-02 18:48:56,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:56,028 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 539 transitions. [2018-02-02 18:48:56,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:48:56,028 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 539 transitions. [2018-02-02 18:48:56,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 18:48:56,029 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:56,029 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 18:48:56,029 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 18:48:56,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1820997833, now seen corresponding path program 1 times [2018-02-02 18:48:56,029 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:56,029 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:56,029 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:56,029 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:56,030 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:56,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:48:56,681 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 18:48:56,681 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:48:56,681 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:48:56,686 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:48:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:48:56,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:48:56,732 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 18:48:56,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:56,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:56,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-02 18:48:56,793 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 18:48:56,794 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 18:48:56,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:56,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:56,799 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 18:48:56,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-02 18:48:56,808 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 18:48:56,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:56,815 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 18:48:56,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:56,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:56,821 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 18:48:56,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2018-02-02 18:48:56,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:56,837 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:56,838 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:56,838 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 18:48:56,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:56,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:56,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:35 [2018-02-02 18:48:56,898 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 18:48:56,900 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 18:48:56,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:56,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:56,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:56,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2018-02-02 18:48:56,940 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 18:48:56,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:56,946 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 18:48:56,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:56,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:56,965 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 18:48:56,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:44 [2018-02-02 18:48:56,999 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 18:48:56,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:57,006 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 18:48:57,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:52 [2018-02-02 18:48:57,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:57,134 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 18:48:57,145 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 18:48:57,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:48:57,209 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 18:48:57,210 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:57,264 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:48:57,264 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 18:48:57,265 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 18:48:57,289 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 18:48:57,325 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 18:48:57,325 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:254 [2018-02-02 18:48:57,464 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 18:48:57,465 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 18:48:57,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:57,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:57,477 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 18:48:57,479 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 18:48:57,479 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:57,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:57,491 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 18:48:57,493 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 18:48:57,493 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:57,519 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:57,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:57,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:57,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:57,578 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 18:48:57,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:57,608 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 18:48:57,611 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 18:48:57,802 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 18:48:57,930 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:57,931 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 18:48:57,931 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:58,071 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 18:48:58,277 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 18:48:58,279 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:58,279 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 18:48:58,279 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:58,293 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:58,514 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:58,514 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:58,515 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:58,517 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 18:48:58,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:58,527 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 18:48:58,529 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 18:48:58,566 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:58,655 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 18:48:58,655 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:230, output treesize:230 [2018-02-02 18:48:59,457 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 18:48:59,459 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 18:48:59,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:59,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:59,527 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 18:48:59,529 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 18:48:59,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:59,541 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:59,584 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 18:48:59,586 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 18:48:59,586 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:59,594 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:48:59,626 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 18:48:59,626 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:284, output treesize:239 [2018-02-02 18:48:59,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:59,843 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:59,843 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 18:48:59,851 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 18:48:59,853 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 18:48:59,875 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 18:48:59,876 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 18:48:59,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:59,878 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 18:48:59,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:59,879 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 18:48:59,880 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:48:59,900 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 18:48:59,948 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:59,949 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:48:59,953 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 18:48:59,964 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 18:48:59,965 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 18:48:59,999 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 18:49:00,000 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:00,029 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 18:49:00,030 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:00,052 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 18:49:00,053 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 18:49:00,087 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 18:49:00,089 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 18:49:00,142 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 18:49:00,221 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 18:49:00,222 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:49:00,222 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 18:49:00,223 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:00,229 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 18:49:00,230 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:00,234 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:00,309 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 18:49:00,309 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 11 variables, input treesize:242, output treesize:224 [2018-02-02 18:49:00,524 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 18:49:00,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:49:00,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [25] total 47 [2018-02-02 18:49:00,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 18:49:00,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 18:49:00,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2069, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 18:49:00,543 INFO L87 Difference]: Start difference. First operand 423 states and 539 transitions. Second operand 48 states. [2018-02-02 18:49:01,888 WARN L146 SmtUtils]: Spent 253ms on a formula simplification. DAG size of input: 107 DAG size of output 86 [2018-02-02 18:49:02,137 WARN L146 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 135 DAG size of output 109 [2018-02-02 18:49:02,613 WARN L146 SmtUtils]: Spent 393ms on a formula simplification. DAG size of input: 180 DAG size of output 154 [2018-02-02 18:49:02,897 WARN L146 SmtUtils]: Spent 225ms on a formula simplification. DAG size of input: 140 DAG size of output 114 [2018-02-02 18:49:03,232 WARN L146 SmtUtils]: Spent 255ms on a formula simplification. DAG size of input: 143 DAG size of output 118 [2018-02-02 18:49:03,730 WARN L146 SmtUtils]: Spent 404ms on a formula simplification. DAG size of input: 221 DAG size of output 157 [2018-02-02 18:49:04,318 WARN L146 SmtUtils]: Spent 471ms on a formula simplification. DAG size of input: 221 DAG size of output 158 [2018-02-02 18:49:04,485 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 116 DAG size of output 92 [2018-02-02 18:49:05,013 WARN L146 SmtUtils]: Spent 408ms on a formula simplification. DAG size of input: 227 DAG size of output 159 [2018-02-02 18:49:05,507 WARN L146 SmtUtils]: Spent 369ms on a formula simplification. DAG size of input: 221 DAG size of output 157 [2018-02-02 18:49:06,260 WARN L146 SmtUtils]: Spent 640ms on a formula simplification. DAG size of input: 274 DAG size of output 210 [2018-02-02 18:49:06,949 WARN L146 SmtUtils]: Spent 604ms on a formula simplification. DAG size of input: 252 DAG size of output 226 [2018-02-02 18:49:07,403 WARN L146 SmtUtils]: Spent 346ms on a formula simplification. DAG size of input: 213 DAG size of output 187 [2018-02-02 18:49:07,891 WARN L146 SmtUtils]: Spent 394ms on a formula simplification. DAG size of input: 226 DAG size of output 190 [2018-02-02 18:49:08,325 WARN L146 SmtUtils]: Spent 358ms on a formula simplification. DAG size of input: 226 DAG size of output 190 [2018-02-02 18:49:08,992 WARN L146 SmtUtils]: Spent 404ms on a formula simplification. DAG size of input: 233 DAG size of output 193 [2018-02-02 18:49:09,569 WARN L146 SmtUtils]: Spent 383ms on a formula simplification. DAG size of input: 225 DAG size of output 190 [2018-02-02 18:49:10,079 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 150 DAG size of output 112 [2018-02-02 18:49:10,651 WARN L146 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 146 DAG size of output 143 [2018-02-02 18:49:11,026 WARN L146 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 159 DAG size of output 146 [2018-02-02 18:49:11,910 WARN L146 SmtUtils]: Spent 202ms on a formula simplification. DAG size of input: 158 DAG size of output 146 [2018-02-02 18:49:22,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:49:22,309 INFO L93 Difference]: Finished difference Result 1401 states and 1758 transitions. [2018-02-02 18:49:22,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 18:49:22,309 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 60 [2018-02-02 18:49:22,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:49:22,312 INFO L225 Difference]: With dead ends: 1401 [2018-02-02 18:49:22,312 INFO L226 Difference]: Without dead ends: 1401 [2018-02-02 18:49:22,313 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=1104, Invalid=5702, Unknown=0, NotChecked=0, Total=6806 [2018-02-02 18:49:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-02-02 18:49:22,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 425. [2018-02-02 18:49:22,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-02 18:49:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 543 transitions. [2018-02-02 18:49:22,317 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 543 transitions. Word has length 60 [2018-02-02 18:49:22,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:49:22,317 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 543 transitions. [2018-02-02 18:49:22,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 18:49:22,317 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 543 transitions. [2018-02-02 18:49:22,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 18:49:22,318 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:49:22,318 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 18:49:22,318 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 18:49:22,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1820997832, now seen corresponding path program 1 times [2018-02-02 18:49:22,318 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:49:22,318 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:49:22,318 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:22,319 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:49:22,319 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:49:22,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:49:23,239 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 18:49:23,239 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:49:23,239 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:49:23,244 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:49:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:49:23,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:49:23,269 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 18:49:23,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 18:49:23,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:23,317 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 18:49:23,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:23,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:23,325 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 18:49:23,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-02-02 18:49:23,388 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 18:49:23,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, 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 18:49:23,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,405 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 18:49:23,407 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 18:49:23,407 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,408 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,422 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 18:49:23,423 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:58 [2018-02-02 18:49:23,464 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 18:49:23,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:23,468 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 18:49:23,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,498 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 18:49:23,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:23,501 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 18:49:23,501 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,506 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,518 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 18:49:23,518 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:58 [2018-02-02 18:49:23,555 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:23,556 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 18:49:23,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,572 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:23,573 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:23,574 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 18:49:23,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:64 [2018-02-02 18:49:23,735 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 18:49:23,737 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 18:49:23,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,776 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 18:49:23,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 18:49:23,778 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,785 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,808 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:90, output treesize:82 [2018-02-02 18:49:23,894 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 18:49:23,897 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:23,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 18:49:23,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,929 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 18:49:23,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:23,933 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 18:49:23,933 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,938 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:23,954 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:112, output treesize:82 [2018-02-02 18:49:23,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:23,982 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:23,983 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 18:49:23,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:24,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:24,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:24,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:24,009 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 18:49:24,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:24,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:24,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:88 [2018-02-02 18:49:24,185 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 18:49:24,188 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 18:49:24,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:24,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:24,234 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 18:49:24,256 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 18:49:24,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:24,275 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:24,299 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 18:49:24,299 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:113, output treesize:119 [2018-02-02 18:49:24,395 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 18:49:24,399 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:24,400 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 18:49:24,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:24,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:24,470 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 18:49:24,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:24,474 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 18:49:24,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:24,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:24,525 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 18:49:24,525 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:145, output treesize:203 [2018-02-02 18:49:25,160 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 18:49:25,162 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 18:49:25,163 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 18:49:25,214 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 18:49:25,214 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:25,229 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 18:49:25,229 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:25,241 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 18:49:25,263 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 18:49:25,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:25,266 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 18:49:25,267 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 18:49:25,279 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 18:49:25,280 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:25,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-02-02 18:49:25,286 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:25,290 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:25,300 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 18:49:25,300 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:241, output treesize:45 [2018-02-02 18:49:25,541 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 18:49:25,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:49:25,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 47 [2018-02-02 18:49:25,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 18:49:25,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 18:49:25,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2116, Unknown=9, NotChecked=0, Total=2256 [2018-02-02 18:49:25,561 INFO L87 Difference]: Start difference. First operand 425 states and 543 transitions. Second operand 48 states. [2018-02-02 18:49:42,710 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 134 DAG size of output 82 [2018-02-02 18:49:47,011 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 129 DAG size of output 76 [2018-02-02 18:50:00,493 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 145 DAG size of output 97 [2018-02-02 18:50:02,828 WARN L146 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 174 DAG size of output 117 [2018-02-02 18:50:03,275 WARN L146 SmtUtils]: Spent 307ms on a formula simplification. DAG size of input: 203 DAG size of output 139 Received shutdown request... [2018-02-02 18:50:03,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 18:50:03,835 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 18:50:03,839 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 18:50:03,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:50:03 BoogieIcfgContainer [2018-02-02 18:50:03,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:50:03,840 INFO L168 Benchmark]: Toolchain (without parser) took 89070.59 ms. Allocated memory was 404.2 MB in the beginning and 1.1 GB in the end (delta: 654.3 MB). Free memory was 360.9 MB in the beginning and 611.3 MB in the end (delta: -250.4 MB). Peak memory consumption was 403.9 MB. Max. memory is 5.3 GB. [2018-02-02 18:50:03,842 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:50:03,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.92 ms. Allocated memory is still 404.2 MB. Free memory was 360.9 MB in the beginning and 348.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-02-02 18:50:03,842 INFO L168 Benchmark]: Boogie Preprocessor took 34.81 ms. Allocated memory is still 404.2 MB. Free memory was 348.9 MB in the beginning and 346.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-02-02 18:50:03,842 INFO L168 Benchmark]: RCFGBuilder took 545.88 ms. Allocated memory is still 404.2 MB. Free memory was 346.2 MB in the beginning and 283.1 MB in the end (delta: 63.1 MB). Peak memory consumption was 63.1 MB. Max. memory is 5.3 GB. [2018-02-02 18:50:03,843 INFO L168 Benchmark]: TraceAbstraction took 88318.87 ms. Allocated memory was 404.2 MB in the beginning and 1.1 GB in the end (delta: 654.3 MB). Free memory was 283.1 MB in the beginning and 611.3 MB in the end (delta: -328.2 MB). Peak memory consumption was 326.1 MB. Max. memory is 5.3 GB. [2018-02-02 18:50:03,844 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 167.92 ms. Allocated memory is still 404.2 MB. Free memory was 360.9 MB in the beginning and 348.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.81 ms. Allocated memory is still 404.2 MB. Free memory was 348.9 MB in the beginning and 346.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 545.88 ms. Allocated memory is still 404.2 MB. Free memory was 346.2 MB in the beginning and 283.1 MB in the end (delta: 63.1 MB). Peak memory consumption was 63.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 88318.87 ms. Allocated memory was 404.2 MB in the beginning and 1.1 GB in the end (delta: 654.3 MB). Free memory was 283.1 MB in the beginning and 611.3 MB in the end (delta: -328.2 MB). Peak memory consumption was 326.1 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - 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 19 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 270. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 247 locations, 91 error locations. TIMEOUT Result, 88.2s OverallTime, 38 OverallIterations, 3 TraceHistogramMax, 75.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9158 SDtfs, 35056 SDslu, 43744 SDs, 0 SdLazy, 29463 SolverSat, 1232 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 55.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 916 GetRequests, 260 SyntacticMatches, 45 SemanticMatches, 610 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4310 ImplicationChecksByTransitivity, 22.4s 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.1s 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_18-50-03-852.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_18-50-03-852.csv Completed graceful shutdown