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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0513_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:15:32,528 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:15:32,529 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:15:32,545 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:15:32,545 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:15:32,546 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:15:32,547 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:15:32,549 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:15:32,551 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:15:32,552 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:15:32,553 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:15:32,553 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:15:32,554 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:15:32,555 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:15:32,556 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:15:32,559 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:15:32,561 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:15:32,563 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:15:32,564 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:15:32,565 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:15:32,568 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:15:32,568 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:15:32,568 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:15:32,569 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:15:32,570 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:15:32,571 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:15:32,572 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:15:32,572 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:15:32,572 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:15:32,573 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:15:32,573 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:15:32,574 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:15:32,582 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:15:32,582 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:15:32,583 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:15:32,583 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:15:32,583 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:15:32,583 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:15:32,583 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:15:32,584 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:15:32,584 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:15:32,584 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:15:32,584 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:15:32,584 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:15:32,584 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:15:32,584 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:15:32,585 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:15:32,585 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:15:32,585 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:15:32,585 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:15:32,585 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:15:32,585 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:15:32,585 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:15:32,585 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:15:32,586 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:15:32,586 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:15:32,586 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:15:32,586 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:15:32,586 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:15:32,587 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:15:32,587 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:15:32,587 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:15:32,587 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:15:32,587 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:15:32,588 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:15:32,588 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:15:32,621 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:15:32,633 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:15:32,636 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:15:32,637 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:15:32,637 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:15:32,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0513_1_true-valid-memsafety.i [2018-01-24 12:15:32,824 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:15:32,828 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:15:32,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:15:32,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:15:32,835 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:15:32,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:15:32" (1/1) ... [2018-01-24 12:15:32,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41641836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:15:32, skipping insertion in model container [2018-01-24 12:15:32,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:15:32" (1/1) ... [2018-01-24 12:15:32,853 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:15:32,891 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:15:33,008 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:15:33,030 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:15:33,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:15:33 WrapperNode [2018-01-24 12:15:33,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:15:33,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:15:33,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:15:33,039 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:15:33,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:15:33" (1/1) ... [2018-01-24 12:15:33,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:15:33" (1/1) ... [2018-01-24 12:15:33,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:15:33" (1/1) ... [2018-01-24 12:15:33,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:15:33" (1/1) ... [2018-01-24 12:15:33,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:15:33" (1/1) ... [2018-01-24 12:15:33,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:15:33" (1/1) ... [2018-01-24 12:15:33,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:15:33" (1/1) ... [2018-01-24 12:15:33,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:15:33,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:15:33,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:15:33,078 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:15:33,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:15:33" (1/1) ... No working directory specified, using /storage/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-01-24 12:15:33,121 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:15:33,121 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:15:33,121 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:15:33,121 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:15:33,121 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:15:33,122 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:15:33,122 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:15:33,122 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:15:33,122 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:15:33,122 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:15:33,122 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:15:33,122 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:15:33,122 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 12:15:33,123 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:15:33,123 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:15:33,123 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:15:33,123 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:15:33,675 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:15:33,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:15:33 BoogieIcfgContainer [2018-01-24 12:15:33,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:15:33,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:15:33,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:15:33,678 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:15:33,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:15:32" (1/3) ... [2018-01-24 12:15:33,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd8d416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:15:33, skipping insertion in model container [2018-01-24 12:15:33,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:15:33" (2/3) ... [2018-01-24 12:15:33,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd8d416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:15:33, skipping insertion in model container [2018-01-24 12:15:33,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:15:33" (3/3) ... [2018-01-24 12:15:33,681 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0513_1_true-valid-memsafety.i [2018-01-24 12:15:33,688 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:15:33,696 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-01-24 12:15:33,748 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:15:33,748 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:15:33,748 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:15:33,748 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:15:33,749 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:15:33,749 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:15:33,749 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:15:33,749 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:15:33,750 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:15:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2018-01-24 12:15:33,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-24 12:15:33,783 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:33,784 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:33,785 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:33,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1366809009, now seen corresponding path program 1 times [2018-01-24 12:15:33,792 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:33,793 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:33,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:33,841 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:33,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:33,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:33,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:33,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:33,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:15:33,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 12:15:33,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 12:15:33,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 12:15:33,922 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 2 states. [2018-01-24 12:15:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:34,029 INFO L93 Difference]: Finished difference Result 304 states and 342 transitions. [2018-01-24 12:15:34,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 12:15:34,030 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-24 12:15:34,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:34,041 INFO L225 Difference]: With dead ends: 304 [2018-01-24 12:15:34,042 INFO L226 Difference]: Without dead ends: 152 [2018-01-24 12:15:34,047 INFO L525 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-01-24 12:15:34,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-24 12:15:34,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-01-24 12:15:34,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-24 12:15:34,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2018-01-24 12:15:34,089 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 9 [2018-01-24 12:15:34,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:34,089 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2018-01-24 12:15:34,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 12:15:34,090 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2018-01-24 12:15:34,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 12:15:34,090 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:34,090 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:34,090 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:34,091 INFO L82 PathProgramCache]: Analyzing trace with hash -26359990, now seen corresponding path program 1 times [2018-01-24 12:15:34,091 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:34,091 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:34,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:34,092 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:34,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:34,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:34,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:34,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:15:34,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:15:34,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:15:34,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:15:34,152 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand 3 states. [2018-01-24 12:15:34,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:34,389 INFO L93 Difference]: Finished difference Result 197 states and 214 transitions. [2018-01-24 12:15:34,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:15:34,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 12:15:34,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:34,394 INFO L225 Difference]: With dead ends: 197 [2018-01-24 12:15:34,394 INFO L226 Difference]: Without dead ends: 195 [2018-01-24 12:15:34,395 INFO L525 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-01-24 12:15:34,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-24 12:15:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2018-01-24 12:15:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-24 12:15:34,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2018-01-24 12:15:34,409 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 12 [2018-01-24 12:15:34,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:34,410 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2018-01-24 12:15:34,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:15:34,410 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2018-01-24 12:15:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 12:15:34,411 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:34,411 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:34,411 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:34,411 INFO L82 PathProgramCache]: Analyzing trace with hash -817163438, now seen corresponding path program 1 times [2018-01-24 12:15:34,411 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:34,411 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:34,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:34,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:34,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:34,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:34,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:34,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:34,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:15:34,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:15:34,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:15:34,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:15:34,467 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand 3 states. [2018-01-24 12:15:34,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:34,565 INFO L93 Difference]: Finished difference Result 326 states and 359 transitions. [2018-01-24 12:15:34,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:15:34,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-24 12:15:34,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:34,567 INFO L225 Difference]: With dead ends: 326 [2018-01-24 12:15:34,567 INFO L226 Difference]: Without dead ends: 179 [2018-01-24 12:15:34,569 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:15:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-24 12:15:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 169. [2018-01-24 12:15:34,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-24 12:15:34,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 195 transitions. [2018-01-24 12:15:34,581 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 195 transitions. Word has length 13 [2018-01-24 12:15:34,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:34,581 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 195 transitions. [2018-01-24 12:15:34,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:15:34,581 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 195 transitions. [2018-01-24 12:15:34,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:15:34,582 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:34,582 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:34,582 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:34,582 INFO L82 PathProgramCache]: Analyzing trace with hash 437426512, now seen corresponding path program 1 times [2018-01-24 12:15:34,583 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:34,583 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:34,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:34,584 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:34,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:34,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:34,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:34,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:15:34,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:15:34,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:15:34,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:15:34,639 INFO L87 Difference]: Start difference. First operand 169 states and 195 transitions. Second operand 4 states. [2018-01-24 12:15:34,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:34,863 INFO L93 Difference]: Finished difference Result 245 states and 275 transitions. [2018-01-24 12:15:34,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:15:34,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 12:15:34,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:34,865 INFO L225 Difference]: With dead ends: 245 [2018-01-24 12:15:34,865 INFO L226 Difference]: Without dead ends: 239 [2018-01-24 12:15:34,866 INFO L525 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-01-24 12:15:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-01-24 12:15:34,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 169. [2018-01-24 12:15:34,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-24 12:15:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 195 transitions. [2018-01-24 12:15:34,878 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 195 transitions. Word has length 14 [2018-01-24 12:15:34,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:34,878 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 195 transitions. [2018-01-24 12:15:34,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:15:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 195 transitions. [2018-01-24 12:15:34,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:15:34,879 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:34,879 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:34,879 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:34,880 INFO L82 PathProgramCache]: Analyzing trace with hash 437426513, now seen corresponding path program 1 times [2018-01-24 12:15:34,880 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:34,880 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:34,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:34,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:34,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:34,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:34,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:34,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:15:34,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:15:34,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:15:34,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:15:34,953 INFO L87 Difference]: Start difference. First operand 169 states and 195 transitions. Second operand 4 states. [2018-01-24 12:15:35,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:35,078 INFO L93 Difference]: Finished difference Result 169 states and 195 transitions. [2018-01-24 12:15:35,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:15:35,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 12:15:35,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:35,079 INFO L225 Difference]: With dead ends: 169 [2018-01-24 12:15:35,079 INFO L226 Difference]: Without dead ends: 165 [2018-01-24 12:15:35,080 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-01-24 12:15:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-24 12:15:35,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-01-24 12:15:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-24 12:15:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions. [2018-01-24 12:15:35,090 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 14 [2018-01-24 12:15:35,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:35,091 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 187 transitions. [2018-01-24 12:15:35,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:15:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions. [2018-01-24 12:15:35,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 12:15:35,092 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:35,092 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:35,093 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:35,093 INFO L82 PathProgramCache]: Analyzing trace with hash 809095649, now seen corresponding path program 1 times [2018-01-24 12:15:35,093 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:35,093 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:35,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:35,094 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:35,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:35,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:35,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:35,148 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:35,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:15:35,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:15:35,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:15:35,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:15:35,149 INFO L87 Difference]: Start difference. First operand 165 states and 187 transitions. Second operand 5 states. [2018-01-24 12:15:35,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:35,191 INFO L93 Difference]: Finished difference Result 451 states and 510 transitions. [2018-01-24 12:15:35,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:15:35,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-24 12:15:35,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:35,196 INFO L225 Difference]: With dead ends: 451 [2018-01-24 12:15:35,197 INFO L226 Difference]: Without dead ends: 306 [2018-01-24 12:15:35,198 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:15:35,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-01-24 12:15:35,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 165. [2018-01-24 12:15:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-24 12:15:35,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2018-01-24 12:15:35,207 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 21 [2018-01-24 12:15:35,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:35,208 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2018-01-24 12:15:35,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:15:35,208 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2018-01-24 12:15:35,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:15:35,209 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:35,209 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:35,209 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:35,210 INFO L82 PathProgramCache]: Analyzing trace with hash -836569732, now seen corresponding path program 1 times [2018-01-24 12:15:35,210 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:35,210 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:35,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:35,211 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:35,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:35,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:35,266 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:35,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:15:35,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:15:35,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:15:35,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:15:35,267 INFO L87 Difference]: Start difference. First operand 165 states and 185 transitions. Second operand 4 states. [2018-01-24 12:15:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:35,430 INFO L93 Difference]: Finished difference Result 203 states and 224 transitions. [2018-01-24 12:15:35,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:15:35,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-24 12:15:35,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:35,437 INFO L225 Difference]: With dead ends: 203 [2018-01-24 12:15:35,437 INFO L226 Difference]: Without dead ends: 199 [2018-01-24 12:15:35,438 INFO L525 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-01-24 12:15:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-01-24 12:15:35,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 161. [2018-01-24 12:15:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-24 12:15:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 181 transitions. [2018-01-24 12:15:35,445 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 181 transitions. Word has length 22 [2018-01-24 12:15:35,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:35,446 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 181 transitions. [2018-01-24 12:15:35,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:15:35,446 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 181 transitions. [2018-01-24 12:15:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:15:35,447 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:35,447 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:35,447 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:35,447 INFO L82 PathProgramCache]: Analyzing trace with hash -836569731, now seen corresponding path program 1 times [2018-01-24 12:15:35,447 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:35,448 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:35,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:35,449 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:35,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:35,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:35,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:35,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:35,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:15:35,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:15:35,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:15:35,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:15:35,521 INFO L87 Difference]: Start difference. First operand 161 states and 181 transitions. Second operand 4 states. [2018-01-24 12:15:35,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:35,638 INFO L93 Difference]: Finished difference Result 161 states and 181 transitions. [2018-01-24 12:15:35,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:15:35,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-24 12:15:35,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:35,639 INFO L225 Difference]: With dead ends: 161 [2018-01-24 12:15:35,639 INFO L226 Difference]: Without dead ends: 158 [2018-01-24 12:15:35,639 INFO L525 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-01-24 12:15:35,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-24 12:15:35,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-01-24 12:15:35,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-24 12:15:35,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 178 transitions. [2018-01-24 12:15:35,646 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 178 transitions. Word has length 22 [2018-01-24 12:15:35,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:35,646 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 178 transitions. [2018-01-24 12:15:35,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:15:35,646 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 178 transitions. [2018-01-24 12:15:35,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:15:35,647 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:35,647 INFO L322 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] [2018-01-24 12:15:35,647 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:35,647 INFO L82 PathProgramCache]: Analyzing trace with hash 261861212, now seen corresponding path program 1 times [2018-01-24 12:15:35,647 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:35,648 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:35,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:35,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:35,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:35,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:35,735 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:35,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:15:35,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:15:35,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:15:35,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:15:35,736 INFO L87 Difference]: Start difference. First operand 158 states and 178 transitions. Second operand 5 states. [2018-01-24 12:15:35,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:35,866 INFO L93 Difference]: Finished difference Result 397 states and 446 transitions. [2018-01-24 12:15:35,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:15:35,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-24 12:15:35,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:35,868 INFO L225 Difference]: With dead ends: 397 [2018-01-24 12:15:35,868 INFO L226 Difference]: Without dead ends: 262 [2018-01-24 12:15:35,869 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-01-24 12:15:35,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-01-24 12:15:35,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 158. [2018-01-24 12:15:35,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-24 12:15:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions. [2018-01-24 12:15:35,878 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 31 [2018-01-24 12:15:35,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:35,878 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions. [2018-01-24 12:15:35,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:15:35,879 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2018-01-24 12:15:35,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 12:15:35,879 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:35,880 INFO L322 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] [2018-01-24 12:15:35,880 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:35,880 INFO L82 PathProgramCache]: Analyzing trace with hash -472240768, now seen corresponding path program 1 times [2018-01-24 12:15:35,880 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:35,880 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:35,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:35,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:35,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:35,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:35,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:35,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:15:35,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:15:35,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:15:35,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:15:35,990 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand 5 states. [2018-01-24 12:15:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:36,307 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2018-01-24 12:15:36,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:15:36,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-24 12:15:36,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:36,309 INFO L225 Difference]: With dead ends: 263 [2018-01-24 12:15:36,310 INFO L226 Difference]: Without dead ends: 253 [2018-01-24 12:15:36,310 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:15:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-01-24 12:15:36,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 200. [2018-01-24 12:15:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-01-24 12:15:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 257 transitions. [2018-01-24 12:15:36,320 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 257 transitions. Word has length 32 [2018-01-24 12:15:36,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:36,321 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 257 transitions. [2018-01-24 12:15:36,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:15:36,321 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 257 transitions. [2018-01-24 12:15:36,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 12:15:36,322 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:36,322 INFO L322 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] [2018-01-24 12:15:36,322 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:36,322 INFO L82 PathProgramCache]: Analyzing trace with hash -472240769, now seen corresponding path program 1 times [2018-01-24 12:15:36,322 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:36,323 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:36,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:36,324 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:36,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:36,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:36,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:36,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:15:36,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:15:36,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:15:36,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:15:36,379 INFO L87 Difference]: Start difference. First operand 200 states and 257 transitions. Second operand 5 states. [2018-01-24 12:15:36,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:36,502 INFO L93 Difference]: Finished difference Result 203 states and 259 transitions. [2018-01-24 12:15:36,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:15:36,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-24 12:15:36,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:36,504 INFO L225 Difference]: With dead ends: 203 [2018-01-24 12:15:36,504 INFO L226 Difference]: Without dead ends: 194 [2018-01-24 12:15:36,505 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:15:36,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-24 12:15:36,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-01-24 12:15:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-01-24 12:15:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 242 transitions. [2018-01-24 12:15:36,514 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 242 transitions. Word has length 32 [2018-01-24 12:15:36,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:36,514 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 242 transitions. [2018-01-24 12:15:36,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:15:36,514 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 242 transitions. [2018-01-24 12:15:36,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 12:15:36,515 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:36,516 INFO L322 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] [2018-01-24 12:15:36,516 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:36,516 INFO L82 PathProgramCache]: Analyzing trace with hash 456903790, now seen corresponding path program 1 times [2018-01-24 12:15:36,516 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:36,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:36,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:36,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:36,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:36,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:36,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:36,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:15:36,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:15:36,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:15:36,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:15:36,576 INFO L87 Difference]: Start difference. First operand 192 states and 242 transitions. Second operand 4 states. [2018-01-24 12:15:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:36,619 INFO L93 Difference]: Finished difference Result 529 states and 673 transitions. [2018-01-24 12:15:36,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:15:36,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-01-24 12:15:36,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:36,621 INFO L225 Difference]: With dead ends: 529 [2018-01-24 12:15:36,621 INFO L226 Difference]: Without dead ends: 353 [2018-01-24 12:15:36,622 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:15:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-01-24 12:15:36,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 193. [2018-01-24 12:15:36,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-24 12:15:36,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 241 transitions. [2018-01-24 12:15:36,633 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 241 transitions. Word has length 37 [2018-01-24 12:15:36,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:36,634 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 241 transitions. [2018-01-24 12:15:36,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:15:36,634 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 241 transitions. [2018-01-24 12:15:36,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 12:15:36,635 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:36,635 INFO L322 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] [2018-01-24 12:15:36,635 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:36,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1168751179, now seen corresponding path program 1 times [2018-01-24 12:15:36,636 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:36,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:36,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:36,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:36,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:36,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:36,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:36,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:15:36,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:15:36,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:15:36,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:15:36,808 INFO L87 Difference]: Start difference. First operand 193 states and 241 transitions. Second operand 6 states. [2018-01-24 12:15:36,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:36,990 INFO L93 Difference]: Finished difference Result 369 states and 464 transitions. [2018-01-24 12:15:36,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:15:36,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-01-24 12:15:36,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:36,992 INFO L225 Difference]: With dead ends: 369 [2018-01-24 12:15:36,992 INFO L226 Difference]: Without dead ends: 232 [2018-01-24 12:15:36,993 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:15:36,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-24 12:15:37,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 203. [2018-01-24 12:15:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-01-24 12:15:37,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 253 transitions. [2018-01-24 12:15:37,005 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 253 transitions. Word has length 39 [2018-01-24 12:15:37,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:37,005 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 253 transitions. [2018-01-24 12:15:37,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:15:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 253 transitions. [2018-01-24 12:15:37,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 12:15:37,006 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:37,006 INFO L322 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] [2018-01-24 12:15:37,006 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:37,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1118408649, now seen corresponding path program 1 times [2018-01-24 12:15:37,006 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:37,006 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:37,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:37,007 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:37,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:37,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:37,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:37,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:15:37,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:15:37,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:15:37,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:15:37,432 INFO L87 Difference]: Start difference. First operand 203 states and 253 transitions. Second operand 11 states. [2018-01-24 12:15:38,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:38,201 INFO L93 Difference]: Finished difference Result 289 states and 345 transitions. [2018-01-24 12:15:38,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:15:38,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-01-24 12:15:38,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:38,202 INFO L225 Difference]: With dead ends: 289 [2018-01-24 12:15:38,202 INFO L226 Difference]: Without dead ends: 288 [2018-01-24 12:15:38,203 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-01-24 12:15:38,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-01-24 12:15:38,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 209. [2018-01-24 12:15:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-24 12:15:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 261 transitions. [2018-01-24 12:15:38,216 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 261 transitions. Word has length 41 [2018-01-24 12:15:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:38,217 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 261 transitions. [2018-01-24 12:15:38,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:15:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 261 transitions. [2018-01-24 12:15:38,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 12:15:38,218 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:38,218 INFO L322 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] [2018-01-24 12:15:38,218 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:38,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1118408648, now seen corresponding path program 1 times [2018-01-24 12:15:38,218 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:38,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:38,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:38,220 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:38,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:38,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:38,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:38,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 12:15:38,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:15:38,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:15:38,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:15:38,654 INFO L87 Difference]: Start difference. First operand 209 states and 261 transitions. Second operand 12 states. [2018-01-24 12:15:39,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:39,423 INFO L93 Difference]: Finished difference Result 259 states and 313 transitions. [2018-01-24 12:15:39,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 12:15:39,423 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-01-24 12:15:39,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:39,425 INFO L225 Difference]: With dead ends: 259 [2018-01-24 12:15:39,425 INFO L226 Difference]: Without dead ends: 258 [2018-01-24 12:15:39,426 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=471, Unknown=0, NotChecked=0, Total=650 [2018-01-24 12:15:39,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-01-24 12:15:39,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 209. [2018-01-24 12:15:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-24 12:15:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 260 transitions. [2018-01-24 12:15:39,439 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 260 transitions. Word has length 41 [2018-01-24 12:15:39,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:39,440 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 260 transitions. [2018-01-24 12:15:39,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:15:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 260 transitions. [2018-01-24 12:15:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 12:15:39,441 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:39,441 INFO L322 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] [2018-01-24 12:15:39,441 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:39,441 INFO L82 PathProgramCache]: Analyzing trace with hash -310930527, now seen corresponding path program 1 times [2018-01-24 12:15:39,442 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:39,442 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:39,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:39,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:39,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:39,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:39,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:39,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:39,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:15:39,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:15:39,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:15:39,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:15:39,764 INFO L87 Difference]: Start difference. First operand 209 states and 260 transitions. Second operand 10 states. [2018-01-24 12:15:40,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:40,011 INFO L93 Difference]: Finished difference Result 239 states and 291 transitions. [2018-01-24 12:15:40,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:15:40,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-01-24 12:15:40,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:40,012 INFO L225 Difference]: With dead ends: 239 [2018-01-24 12:15:40,013 INFO L226 Difference]: Without dead ends: 236 [2018-01-24 12:15:40,013 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:15:40,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-01-24 12:15:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 209. [2018-01-24 12:15:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-24 12:15:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 259 transitions. [2018-01-24 12:15:40,026 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 259 transitions. Word has length 42 [2018-01-24 12:15:40,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:40,027 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 259 transitions. [2018-01-24 12:15:40,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:15:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 259 transitions. [2018-01-24 12:15:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 12:15:40,027 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:40,028 INFO L322 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] [2018-01-24 12:15:40,028 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:40,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1048881672, now seen corresponding path program 1 times [2018-01-24 12:15:40,028 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:40,028 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:40,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:40,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:40,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:40,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:15:40,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:40,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:15:40,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:15:40,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:15:40,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:15:40,073 INFO L87 Difference]: Start difference. First operand 209 states and 259 transitions. Second operand 4 states. [2018-01-24 12:15:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:40,357 INFO L93 Difference]: Finished difference Result 270 states and 334 transitions. [2018-01-24 12:15:40,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:15:40,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-01-24 12:15:40,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:40,359 INFO L225 Difference]: With dead ends: 270 [2018-01-24 12:15:40,359 INFO L226 Difference]: Without dead ends: 265 [2018-01-24 12:15:40,359 INFO L525 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-01-24 12:15:40,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-01-24 12:15:40,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 213. [2018-01-24 12:15:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-01-24 12:15:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 270 transitions. [2018-01-24 12:15:40,372 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 270 transitions. Word has length 43 [2018-01-24 12:15:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:40,373 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 270 transitions. [2018-01-24 12:15:40,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:15:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 270 transitions. [2018-01-24 12:15:40,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 12:15:40,373 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:40,374 INFO L322 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] [2018-01-24 12:15:40,374 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:40,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1048881671, now seen corresponding path program 1 times [2018-01-24 12:15:40,374 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:40,374 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:40,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:40,375 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:40,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:40,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:40,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:40,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 12:15:40,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:15:40,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:15:40,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:15:40,876 INFO L87 Difference]: Start difference. First operand 213 states and 270 transitions. Second operand 13 states. [2018-01-24 12:15:41,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:41,822 INFO L93 Difference]: Finished difference Result 271 states and 334 transitions. [2018-01-24 12:15:41,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:15:41,823 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-01-24 12:15:41,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:41,824 INFO L225 Difference]: With dead ends: 271 [2018-01-24 12:15:41,824 INFO L226 Difference]: Without dead ends: 269 [2018-01-24 12:15:41,824 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2018-01-24 12:15:41,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-01-24 12:15:41,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 218. [2018-01-24 12:15:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-24 12:15:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 276 transitions. [2018-01-24 12:15:41,835 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 276 transitions. Word has length 43 [2018-01-24 12:15:41,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:41,835 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 276 transitions. [2018-01-24 12:15:41,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:15:41,836 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 276 transitions. [2018-01-24 12:15:41,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:15:41,836 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:41,836 INFO L322 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] [2018-01-24 12:15:41,836 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:41,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1204415842, now seen corresponding path program 1 times [2018-01-24 12:15:41,836 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:41,837 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:41,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:41,837 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:41,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:41,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:15:41,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:41,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:15:41,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:15:41,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:15:41,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:15:41,878 INFO L87 Difference]: Start difference. First operand 218 states and 276 transitions. Second operand 3 states. [2018-01-24 12:15:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:41,892 INFO L93 Difference]: Finished difference Result 238 states and 299 transitions. [2018-01-24 12:15:41,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:15:41,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-01-24 12:15:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:41,894 INFO L225 Difference]: With dead ends: 238 [2018-01-24 12:15:41,894 INFO L226 Difference]: Without dead ends: 219 [2018-01-24 12:15:41,895 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:15:41,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-01-24 12:15:41,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-01-24 12:15:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-01-24 12:15:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 277 transitions. [2018-01-24 12:15:41,906 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 277 transitions. Word has length 47 [2018-01-24 12:15:41,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:41,906 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 277 transitions. [2018-01-24 12:15:41,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:15:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 277 transitions. [2018-01-24 12:15:41,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-24 12:15:41,907 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:41,907 INFO L322 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] [2018-01-24 12:15:41,907 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:41,908 INFO L82 PathProgramCache]: Analyzing trace with hash 2091612127, now seen corresponding path program 1 times [2018-01-24 12:15:41,908 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:41,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:41,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:41,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:41,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:41,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:42,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:42,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:42,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 12:15:42,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:15:42,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:15:42,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:15:42,396 INFO L87 Difference]: Start difference. First operand 219 states and 277 transitions. Second operand 12 states. [2018-01-24 12:15:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:42,989 INFO L93 Difference]: Finished difference Result 290 states and 355 transitions. [2018-01-24 12:15:42,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:15:42,990 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-01-24 12:15:42,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:42,991 INFO L225 Difference]: With dead ends: 290 [2018-01-24 12:15:42,991 INFO L226 Difference]: Without dead ends: 289 [2018-01-24 12:15:42,992 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2018-01-24 12:15:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-01-24 12:15:43,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 222. [2018-01-24 12:15:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-01-24 12:15:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 281 transitions. [2018-01-24 12:15:43,005 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 281 transitions. Word has length 49 [2018-01-24 12:15:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:43,005 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 281 transitions. [2018-01-24 12:15:43,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:15:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 281 transitions. [2018-01-24 12:15:43,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-24 12:15:43,006 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:43,006 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:43,006 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:43,007 INFO L82 PathProgramCache]: Analyzing trace with hash 2097549474, now seen corresponding path program 1 times [2018-01-24 12:15:43,007 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:43,007 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:43,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:43,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:43,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:43,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:43,509 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 54 DAG size of output 34 [2018-01-24 12:15:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:43,773 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:15:43,773 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:15:43,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:43,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:15:44,108 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 17 treesize of output 14 [2018-01-24 12:15:44,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-24 12:15:44,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:44,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:44,135 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-01-24 12:15:44,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-24 12:15:44,215 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:44,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:44,219 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-01-24 12:15:44,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:44,236 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-01-24 12:15:44,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:30 [2018-01-24 12:15:44,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-24 12:15:44,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-24 12:15:44,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:44,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:44,424 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-01-24 12:15:44,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2018-01-24 12:15:44,499 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 33 treesize of output 34 [2018-01-24 12:15:44,502 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 16 treesize of output 1 [2018-01-24 12:15:44,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:44,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:44,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 12:15:44,523 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-01-24 12:15:44,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:44,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:44,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 12:15:44,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 12:15:44,543 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:44,544 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:44,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:15:44,558 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:78, output treesize:63 [2018-01-24 12:15:44,678 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 45 treesize of output 39 [2018-01-24 12:15:44,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 36 [2018-01-24 12:15:44,697 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 12:15:44,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 12:15:44,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-01-24 12:15:44,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2018-01-24 12:15:44,738 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 12:15:44,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 12:15:44,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2018-01-24 12:15:44,759 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:44,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-01-24 12:15:44,763 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:15:44,773 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:15:44,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-01-24 12:15:44,805 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:84, output treesize:97 [2018-01-24 12:15:45,076 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 23 treesize of output 19 [2018-01-24 12:15:45,078 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 19 treesize of output 7 [2018-01-24 12:15:45,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:45,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:45,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:15:45,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:11 [2018-01-24 12:15:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:45,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:15:45,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2018-01-24 12:15:45,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-24 12:15:45,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-24 12:15:45,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1144, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 12:15:45,154 INFO L87 Difference]: Start difference. First operand 222 states and 281 transitions. Second operand 36 states. [2018-01-24 12:15:46,074 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 107 DAG size of output 61 [2018-01-24 12:15:46,586 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 58 DAG size of output 42 [2018-01-24 12:15:47,260 WARN L146 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 86 DAG size of output 56 [2018-01-24 12:15:48,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:48,625 INFO L93 Difference]: Finished difference Result 286 states and 351 transitions. [2018-01-24 12:15:48,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-24 12:15:48,626 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 49 [2018-01-24 12:15:48,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:48,627 INFO L225 Difference]: With dead ends: 286 [2018-01-24 12:15:48,627 INFO L226 Difference]: Without dead ends: 266 [2018-01-24 12:15:48,628 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=595, Invalid=3065, Unknown=0, NotChecked=0, Total=3660 [2018-01-24 12:15:48,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-24 12:15:48,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 222. [2018-01-24 12:15:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-01-24 12:15:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 280 transitions. [2018-01-24 12:15:48,645 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 280 transitions. Word has length 49 [2018-01-24 12:15:48,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:48,645 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 280 transitions. [2018-01-24 12:15:48,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-24 12:15:48,646 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 280 transitions. [2018-01-24 12:15:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-24 12:15:48,646 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:48,647 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:48,647 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:48,647 INFO L82 PathProgramCache]: Analyzing trace with hash -5312545, now seen corresponding path program 1 times [2018-01-24 12:15:48,647 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:48,647 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:48,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:48,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:48,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:48,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:49,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:49,300 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:49,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-01-24 12:15:49,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 12:15:49,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 12:15:49,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:15:49,301 INFO L87 Difference]: Start difference. First operand 222 states and 280 transitions. Second operand 20 states. [2018-01-24 12:15:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:50,827 INFO L93 Difference]: Finished difference Result 314 states and 381 transitions. [2018-01-24 12:15:50,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-24 12:15:50,827 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2018-01-24 12:15:50,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:50,829 INFO L225 Difference]: With dead ends: 314 [2018-01-24 12:15:50,829 INFO L226 Difference]: Without dead ends: 294 [2018-01-24 12:15:50,830 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=398, Invalid=2052, Unknown=0, NotChecked=0, Total=2450 [2018-01-24 12:15:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-01-24 12:15:50,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 222. [2018-01-24 12:15:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-01-24 12:15:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 279 transitions. [2018-01-24 12:15:50,845 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 279 transitions. Word has length 51 [2018-01-24 12:15:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:50,846 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 279 transitions. [2018-01-24 12:15:50,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 12:15:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 279 transitions. [2018-01-24 12:15:50,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 12:15:50,847 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:50,847 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:50,847 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:15:50,847 INFO L82 PathProgramCache]: Analyzing trace with hash -168477964, now seen corresponding path program 1 times [2018-01-24 12:15:50,847 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:50,847 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:50,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:50,848 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:50,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:50,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:51,370 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:15:51,370 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:15:51,375 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:51,403 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:15:51,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:15:51,431 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-01-24 12:15:51,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,440 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-01-24 12:15:51,442 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-01-24 12:15:51,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,444 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,450 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-24 12:15:51,472 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 27 treesize of output 22 [2018-01-24 12:15:51,475 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:51,477 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 22 treesize of output 14 [2018-01-24 12:15:51,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,515 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 27 treesize of output 22 [2018-01-24 12:15:51,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:51,521 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 22 treesize of output 14 [2018-01-24 12:15:51,522 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,535 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:26 [2018-01-24 12:15:51,546 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 27 treesize of output 22 [2018-01-24 12:15:51,550 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:51,552 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 22 treesize of output 14 [2018-01-24 12:15:51,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,576 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 27 treesize of output 22 [2018-01-24 12:15:51,601 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:51,604 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 22 treesize of output 14 [2018-01-24 12:15:51,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,614 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:26 [2018-01-24 12:15:51,618 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 27 treesize of output 22 [2018-01-24 12:15:51,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:51,623 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 22 treesize of output 14 [2018-01-24 12:15:51,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,637 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 27 treesize of output 22 [2018-01-24 12:15:51,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:51,641 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 22 treesize of output 14 [2018-01-24 12:15:51,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,649 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:26 [2018-01-24 12:15:51,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:51,653 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:51,653 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-01-24 12:15:51,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2018-01-24 12:15:51,712 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 19 treesize of output 20 [2018-01-24 12:15:51,714 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-01-24 12:15:51,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,732 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 19 treesize of output 20 [2018-01-24 12:15:51,734 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-01-24 12:15:51,734 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,749 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-01-24 12:15:51,817 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 28 treesize of output 27 [2018-01-24 12:15:51,832 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:51,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 12:15:51,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,858 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 28 treesize of output 33 [2018-01-24 12:15:51,860 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:51,861 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:51,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-01-24 12:15:51,862 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,869 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:51,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:15:51,882 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:71, output treesize:99 [2018-01-24 12:15:52,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:52,122 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:52,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 84 [2018-01-24 12:15:52,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-01-24 12:15:52,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:15:52,143 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:52,143 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:52,144 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-01-24 12:15:52,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:15:52,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 12:15:52,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 54 [2018-01-24 12:15:52,183 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:52,183 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 28 [2018-01-24 12:15:52,184 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:15:52,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:15:52,194 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:52,199 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:52,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2018-01-24 12:15:52,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 12:15:52,208 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-24 12:15:52,219 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:52,219 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2018-01-24 12:15:52,220 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-01-24 12:15:52,222 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:52,223 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-01-24 12:15:52,224 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-01-24 12:15:52,238 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:15:52,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:15:52,258 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:137, output treesize:28 [2018-01-24 12:15:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:52,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:15:52,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2018-01-24 12:15:52,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-24 12:15:52,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-24 12:15:52,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2018-01-24 12:15:52,356 INFO L87 Difference]: Start difference. First operand 222 states and 279 transitions. Second operand 31 states. [2018-01-24 12:16:13,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:16:13,590 INFO L93 Difference]: Finished difference Result 275 states and 338 transitions. [2018-01-24 12:16:13,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 12:16:13,590 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 52 [2018-01-24 12:16:13,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:16:13,591 INFO L225 Difference]: With dead ends: 275 [2018-01-24 12:16:13,591 INFO L226 Difference]: Without dead ends: 255 [2018-01-24 12:16:13,592 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=414, Invalid=2136, Unknown=0, NotChecked=0, Total=2550 [2018-01-24 12:16:13,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-24 12:16:13,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 224. [2018-01-24 12:16:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-01-24 12:16:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 281 transitions. [2018-01-24 12:16:13,604 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 281 transitions. Word has length 52 [2018-01-24 12:16:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:16:13,605 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 281 transitions. [2018-01-24 12:16:13,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-24 12:16:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 281 transitions. [2018-01-24 12:16:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-24 12:16:13,606 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:16:13,606 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-24 12:16:13,606 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:16:13,606 INFO L82 PathProgramCache]: Analyzing trace with hash -927850364, now seen corresponding path program 1 times [2018-01-24 12:16:13,606 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:16:13,606 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:16:13,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:16:13,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:16:13,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:16:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:16:13,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:16:13,733 ERROR L119 erpolLogProxyWrapper]: Interpolant 40 not inductive: (Check returned sat) [2018-01-24 12:16:13,738 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1003) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-24 12:16:13,742 INFO L168 Benchmark]: Toolchain (without parser) took 40916.99 ms. Allocated memory was 303.6 MB in the beginning and 687.3 MB in the end (delta: 383.8 MB). Free memory was 262.5 MB in the beginning and 395.4 MB in the end (delta: -132.9 MB). Peak memory consumption was 250.9 MB. Max. memory is 5.3 GB. [2018-01-24 12:16:13,743 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 303.6 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:16:13,743 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.33 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 250.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:16:13,744 INFO L168 Benchmark]: Boogie Preprocessor took 38.68 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 248.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:16:13,744 INFO L168 Benchmark]: RCFGBuilder took 597.80 ms. Allocated memory is still 303.6 MB. Free memory was 248.5 MB in the beginning and 209.4 MB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:16:13,744 INFO L168 Benchmark]: TraceAbstraction took 40064.90 ms. Allocated memory was 303.6 MB in the beginning and 687.3 MB in the end (delta: 383.8 MB). Free memory was 209.4 MB in the beginning and 395.4 MB in the end (delta: -185.9 MB). Peak memory consumption was 197.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:16:13,746 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 303.6 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 209.33 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 250.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.68 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 248.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 597.80 ms. Allocated memory is still 303.6 MB. Free memory was 248.5 MB in the beginning and 209.4 MB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 40064.90 ms. Allocated memory was 303.6 MB in the beginning and 687.3 MB in the end (delta: 383.8 MB). Free memory was 209.4 MB in the beginning and 395.4 MB in the end (delta: -185.9 MB). Peak memory consumption was 197.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1003) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-16-13-755.csv Received shutdown request...