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_SS.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-optional_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:26:52,171 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:26:52,172 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:26:52,184 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:26:52,185 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:26:52,185 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:26:52,187 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:26:52,188 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:26:52,190 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:26:52,191 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:26:52,191 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:26:52,192 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:26:52,192 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:26:52,193 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:26:52,194 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:26:52,197 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:26:52,199 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:26:52,201 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:26:52,202 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:26:52,203 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:26:52,206 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:26:52,206 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:26:52,206 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:26:52,207 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:26:52,208 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:26:52,209 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:26:52,209 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:26:52,210 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:26:52,210 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:26:52,210 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:26:52,211 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:26:52,211 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_SS.epf [2018-01-30 00:26:52,221 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:26:52,221 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:26:52,222 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:26:52,222 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:26:52,223 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:26:52,223 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:26:52,223 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:26:52,224 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:26:52,224 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:26:52,224 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:26:52,224 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:26:52,224 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:26:52,225 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:26:52,225 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:26:52,225 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:26:52,225 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:26:52,225 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:26:52,226 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:26:52,226 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:26:52,226 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:26:52,226 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:26:52,226 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:26:52,227 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:26:52,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:26:52,227 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:26:52,227 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:26:52,227 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:26:52,228 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:26:52,228 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:26:52,228 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:26:52,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:26:52,228 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:26:52,229 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:26:52,229 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:26:52,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:26:52,276 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:26:52,280 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:26:52,282 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:26:52,282 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:26:52,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-30 00:26:52,447 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:26:52,452 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:26:52,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:26:52,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:26:52,457 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:26:52,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:26:52" (1/1) ... [2018-01-30 00:26:52,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580878cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:26:52, skipping insertion in model container [2018-01-30 00:26:52,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:26:52" (1/1) ... [2018-01-30 00:26:52,473 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:26:52,511 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:26:52,633 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:26:52,657 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:26:52,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:26:52 WrapperNode [2018-01-30 00:26:52,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:26:52,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:26:52,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:26:52,668 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:26:52,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:26:52" (1/1) ... [2018-01-30 00:26:52,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:26:52" (1/1) ... [2018-01-30 00:26:52,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:26:52" (1/1) ... [2018-01-30 00:26:52,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:26:52" (1/1) ... [2018-01-30 00:26:52,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:26:52" (1/1) ... [2018-01-30 00:26:52,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:26:52" (1/1) ... [2018-01-30 00:26:52,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:26:52" (1/1) ... [2018-01-30 00:26:52,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:26:52,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:26:52,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:26:52,711 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:26:52,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:26:52" (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-30 00:26:52,758 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:26:52,759 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:26:52,759 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:26:52,759 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:26:52,759 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:26:52,759 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 00:26:52,759 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 00:26:52,759 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:26:52,759 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:26:52,759 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:26:52,760 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:26:52,760 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:26:52,760 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:26:52,760 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 00:26:52,760 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:26:52,760 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:26:52,760 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:26:53,280 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:26:53,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:26:53 BoogieIcfgContainer [2018-01-30 00:26:53,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:26:53,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:26:53,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:26:53,285 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:26:53,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:26:52" (1/3) ... [2018-01-30 00:26:53,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b4420d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:26:53, skipping insertion in model container [2018-01-30 00:26:53,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:26:52" (2/3) ... [2018-01-30 00:26:53,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b4420d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:26:53, skipping insertion in model container [2018-01-30 00:26:53,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:26:53" (3/3) ... [2018-01-30 00:26:53,288 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-30 00:26:53,295 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:26:53,301 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 69 error locations. [2018-01-30 00:26:53,341 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:26:53,341 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:26:53,341 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:26:53,342 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:26:53,342 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:26:53,342 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:26:53,342 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:26:53,342 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:26:53,343 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:26:53,361 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states. [2018-01-30 00:26:53,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-30 00:26:53,366 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:26:53,367 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:26:53,367 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:26:53,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1531089115, now seen corresponding path program 1 times [2018-01-30 00:26:53,372 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:26:53,373 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:26:53,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:53,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:26:53,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:26:53,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:26:53,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:26:53,517 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:26:53,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:26:53,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:26:53,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:26:53,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:26:53,617 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 4 states. [2018-01-30 00:26:53,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:26:53,914 INFO L93 Difference]: Finished difference Result 299 states and 332 transitions. [2018-01-30 00:26:53,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:26:53,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-01-30 00:26:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:26:53,925 INFO L225 Difference]: With dead ends: 299 [2018-01-30 00:26:53,925 INFO L226 Difference]: Without dead ends: 194 [2018-01-30 00:26:53,929 INFO L553 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-30 00:26:53,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-30 00:26:53,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 169. [2018-01-30 00:26:53,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-30 00:26:53,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 180 transitions. [2018-01-30 00:26:53,965 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 180 transitions. Word has length 9 [2018-01-30 00:26:53,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:26:53,965 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 180 transitions. [2018-01-30 00:26:53,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:26:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 180 transitions. [2018-01-30 00:26:53,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-30 00:26:53,966 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:26:53,966 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:26:53,966 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:26:53,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1531089114, now seen corresponding path program 1 times [2018-01-30 00:26:53,966 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:26:53,967 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:26:53,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:53,968 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:26:53,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:26:53,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:26:54,030 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-30 00:26:54,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:26:54,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:26:54,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:26:54,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:26:54,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:26:54,032 INFO L87 Difference]: Start difference. First operand 169 states and 180 transitions. Second operand 4 states. [2018-01-30 00:26:54,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:26:54,243 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2018-01-30 00:26:54,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:26:54,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-01-30 00:26:54,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:26:54,246 INFO L225 Difference]: With dead ends: 175 [2018-01-30 00:26:54,246 INFO L226 Difference]: Without dead ends: 166 [2018-01-30 00:26:54,247 INFO L553 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-30 00:26:54,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-30 00:26:54,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 160. [2018-01-30 00:26:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-30 00:26:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2018-01-30 00:26:54,260 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 9 [2018-01-30 00:26:54,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:26:54,260 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2018-01-30 00:26:54,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:26:54,261 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2018-01-30 00:26:54,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-30 00:26:54,261 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:26:54,262 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:26:54,262 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:26:54,262 INFO L82 PathProgramCache]: Analyzing trace with hash 297818218, now seen corresponding path program 1 times [2018-01-30 00:26:54,262 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:26:54,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:26:54,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:54,264 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:26:54,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:26:54,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:26:54,337 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-30 00:26:54,337 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:26:54,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:26:54,337 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:26:54,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:26:54,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:26:54,338 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand 5 states. [2018-01-30 00:26:54,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:26:54,727 INFO L93 Difference]: Finished difference Result 346 states and 370 transitions. [2018-01-30 00:26:54,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:26:54,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-30 00:26:54,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:26:54,757 INFO L225 Difference]: With dead ends: 346 [2018-01-30 00:26:54,757 INFO L226 Difference]: Without dead ends: 345 [2018-01-30 00:26:54,758 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:26:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-01-30 00:26:54,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 159. [2018-01-30 00:26:54,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-30 00:26:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2018-01-30 00:26:54,773 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 18 [2018-01-30 00:26:54,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:26:54,774 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2018-01-30 00:26:54,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:26:54,774 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2018-01-30 00:26:54,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-30 00:26:54,775 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:26:54,775 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:26:54,775 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:26:54,775 INFO L82 PathProgramCache]: Analyzing trace with hash 297818219, now seen corresponding path program 1 times [2018-01-30 00:26:54,776 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:26:54,776 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:26:54,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:54,777 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:26:54,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:26:54,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:26:54,874 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-30 00:26:54,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:26:54,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:26:54,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:26:54,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:26:54,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:26:54,876 INFO L87 Difference]: Start difference. First operand 159 states and 170 transitions. Second operand 5 states. [2018-01-30 00:26:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:26:55,168 INFO L93 Difference]: Finished difference Result 289 states and 309 transitions. [2018-01-30 00:26:55,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:26:55,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-30 00:26:55,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:26:55,170 INFO L225 Difference]: With dead ends: 289 [2018-01-30 00:26:55,170 INFO L226 Difference]: Without dead ends: 288 [2018-01-30 00:26:55,170 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:26:55,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-01-30 00:26:55,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 158. [2018-01-30 00:26:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-30 00:26:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2018-01-30 00:26:55,181 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 18 [2018-01-30 00:26:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:26:55,182 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2018-01-30 00:26:55,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:26:55,182 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2018-01-30 00:26:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:26:55,183 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:26:55,183 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:26:55,183 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:26:55,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1619029890, now seen corresponding path program 1 times [2018-01-30 00:26:55,183 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:26:55,183 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:26:55,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:55,184 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:26:55,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:26:55,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:26:55,263 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-30 00:26:55,263 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:26:55,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:26:55,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:26:55,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:26:55,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:26:55,264 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand 4 states. [2018-01-30 00:26:55,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:26:55,445 INFO L93 Difference]: Finished difference Result 180 states and 191 transitions. [2018-01-30 00:26:55,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:26:55,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-30 00:26:55,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:26:55,446 INFO L225 Difference]: With dead ends: 180 [2018-01-30 00:26:55,446 INFO L226 Difference]: Without dead ends: 163 [2018-01-30 00:26:55,447 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:26:55,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-30 00:26:55,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2018-01-30 00:26:55,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-30 00:26:55,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2018-01-30 00:26:55,455 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 25 [2018-01-30 00:26:55,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:26:55,456 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2018-01-30 00:26:55,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:26:55,456 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2018-01-30 00:26:55,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:26:55,457 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:26:55,457 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:26:55,457 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:26:55,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1619029889, now seen corresponding path program 1 times [2018-01-30 00:26:55,458 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:26:55,458 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:26:55,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:55,459 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:26:55,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:26:55,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:26:55,543 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-30 00:26:55,543 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:26:55,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:26:55,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:26:55,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:26:55,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:26:55,544 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand 7 states. [2018-01-30 00:26:55,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:26:55,771 INFO L93 Difference]: Finished difference Result 230 states and 248 transitions. [2018-01-30 00:26:55,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:26:55,772 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-01-30 00:26:55,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:26:55,773 INFO L225 Difference]: With dead ends: 230 [2018-01-30 00:26:55,774 INFO L226 Difference]: Without dead ends: 218 [2018-01-30 00:26:55,774 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:26:55,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-30 00:26:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 197. [2018-01-30 00:26:55,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-30 00:26:55,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 222 transitions. [2018-01-30 00:26:55,785 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 222 transitions. Word has length 25 [2018-01-30 00:26:55,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:26:55,786 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 222 transitions. [2018-01-30 00:26:55,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:26:55,786 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 222 transitions. [2018-01-30 00:26:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-30 00:26:55,787 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:26:55,787 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:26:55,787 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:26:55,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1109561887, now seen corresponding path program 1 times [2018-01-30 00:26:55,788 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:26:55,788 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:26:55,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:55,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:26:55,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:26:55,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:26:55,847 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-30 00:26:55,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:26:55,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:26:55,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:26:55,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:26:55,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:26:55,848 INFO L87 Difference]: Start difference. First operand 197 states and 222 transitions. Second operand 5 states. [2018-01-30 00:26:56,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:26:56,024 INFO L93 Difference]: Finished difference Result 284 states and 320 transitions. [2018-01-30 00:26:56,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:26:56,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-30 00:26:56,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:26:56,025 INFO L225 Difference]: With dead ends: 284 [2018-01-30 00:26:56,026 INFO L226 Difference]: Without dead ends: 283 [2018-01-30 00:26:56,026 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:26:56,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-01-30 00:26:56,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 196. [2018-01-30 00:26:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-01-30 00:26:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 220 transitions. [2018-01-30 00:26:56,037 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 220 transitions. Word has length 27 [2018-01-30 00:26:56,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:26:56,038 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 220 transitions. [2018-01-30 00:26:56,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:26:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 220 transitions. [2018-01-30 00:26:56,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-30 00:26:56,039 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:26:56,039 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:26:56,039 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:26:56,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1109561886, now seen corresponding path program 1 times [2018-01-30 00:26:56,040 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:26:56,040 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:26:56,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:56,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:26:56,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:26:56,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:26:56,119 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-30 00:26:56,120 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:26:56,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:26:56,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:26:56,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:26:56,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:26:56,121 INFO L87 Difference]: Start difference. First operand 196 states and 220 transitions. Second operand 5 states. [2018-01-30 00:26:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:26:56,333 INFO L93 Difference]: Finished difference Result 307 states and 348 transitions. [2018-01-30 00:26:56,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:26:56,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-30 00:26:56,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:26:56,335 INFO L225 Difference]: With dead ends: 307 [2018-01-30 00:26:56,335 INFO L226 Difference]: Without dead ends: 306 [2018-01-30 00:26:56,336 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:26:56,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-01-30 00:26:56,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 195. [2018-01-30 00:26:56,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-30 00:26:56,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 218 transitions. [2018-01-30 00:26:56,344 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 218 transitions. Word has length 27 [2018-01-30 00:26:56,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:26:56,345 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 218 transitions. [2018-01-30 00:26:56,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:26:56,345 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 218 transitions. [2018-01-30 00:26:56,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-30 00:26:56,346 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:26:56,346 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:26:56,346 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:26:56,346 INFO L82 PathProgramCache]: Analyzing trace with hash -438897733, now seen corresponding path program 1 times [2018-01-30 00:26:56,346 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:26:56,347 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:26:56,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:56,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:26:56,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:26:56,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:26:56,432 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-30 00:26:56,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:26:56,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:26:56,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:26:56,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:26:56,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:26:56,433 INFO L87 Difference]: Start difference. First operand 195 states and 218 transitions. Second operand 5 states. [2018-01-30 00:26:56,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:26:56,691 INFO L93 Difference]: Finished difference Result 252 states and 278 transitions. [2018-01-30 00:26:56,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:26:56,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-30 00:26:56,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:26:56,692 INFO L225 Difference]: With dead ends: 252 [2018-01-30 00:26:56,692 INFO L226 Difference]: Without dead ends: 209 [2018-01-30 00:26:56,692 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:26:56,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-30 00:26:56,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 195. [2018-01-30 00:26:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-30 00:26:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 216 transitions. [2018-01-30 00:26:56,701 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 216 transitions. Word has length 31 [2018-01-30 00:26:56,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:26:56,702 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 216 transitions. [2018-01-30 00:26:56,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:26:56,702 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 216 transitions. [2018-01-30 00:26:56,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-30 00:26:56,703 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:26:56,703 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:26:56,703 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:26:56,703 INFO L82 PathProgramCache]: Analyzing trace with hash -419373136, now seen corresponding path program 1 times [2018-01-30 00:26:56,703 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:26:56,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:26:56,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:56,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:26:56,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:26:56,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:26:56,817 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-30 00:26:56,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:26:56,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:26:56,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:26:56,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:26:56,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:26:56,818 INFO L87 Difference]: Start difference. First operand 195 states and 216 transitions. Second operand 9 states. [2018-01-30 00:26:57,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:26:57,206 INFO L93 Difference]: Finished difference Result 196 states and 216 transitions. [2018-01-30 00:26:57,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:26:57,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-01-30 00:26:57,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:26:57,208 INFO L225 Difference]: With dead ends: 196 [2018-01-30 00:26:57,208 INFO L226 Difference]: Without dead ends: 195 [2018-01-30 00:26:57,209 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:26:57,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-30 00:26:57,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-01-30 00:26:57,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-01-30 00:26:57,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 215 transitions. [2018-01-30 00:26:57,220 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 215 transitions. Word has length 32 [2018-01-30 00:26:57,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:26:57,220 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 215 transitions. [2018-01-30 00:26:57,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:26:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 215 transitions. [2018-01-30 00:26:57,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-30 00:26:57,221 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:26:57,221 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:26:57,222 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:26:57,222 INFO L82 PathProgramCache]: Analyzing trace with hash -419373135, now seen corresponding path program 1 times [2018-01-30 00:26:57,222 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:26:57,222 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:26:57,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:57,223 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:26:57,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:26:57,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:26:57,382 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-30 00:26:57,382 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:26:57,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 00:26:57,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:26:57,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:26:57,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:26:57,383 INFO L87 Difference]: Start difference. First operand 194 states and 215 transitions. Second operand 10 states. [2018-01-30 00:26:57,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:26:57,981 INFO L93 Difference]: Finished difference Result 198 states and 218 transitions. [2018-01-30 00:26:57,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:26:57,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-01-30 00:26:57,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:26:57,982 INFO L225 Difference]: With dead ends: 198 [2018-01-30 00:26:57,982 INFO L226 Difference]: Without dead ends: 187 [2018-01-30 00:26:57,983 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2018-01-30 00:26:57,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-30 00:26:57,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 173. [2018-01-30 00:26:57,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-30 00:26:57,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 193 transitions. [2018-01-30 00:26:57,993 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 193 transitions. Word has length 32 [2018-01-30 00:26:57,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:26:57,993 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 193 transitions. [2018-01-30 00:26:57,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:26:57,994 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 193 transitions. [2018-01-30 00:26:57,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:26:57,995 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:26:57,995 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:26:57,995 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:26:57,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1171127069, now seen corresponding path program 1 times [2018-01-30 00:26:57,995 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:26:57,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:26:57,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:57,996 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:26:57,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:26:58,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:26:58,070 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-30 00:26:58,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:26:58,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:26:58,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:26:58,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:26:58,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:26:58,072 INFO L87 Difference]: Start difference. First operand 173 states and 193 transitions. Second operand 4 states. [2018-01-30 00:26:58,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:26:58,106 INFO L93 Difference]: Finished difference Result 316 states and 355 transitions. [2018-01-30 00:26:58,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:26:58,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-30 00:26:58,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:26:58,108 INFO L225 Difference]: With dead ends: 316 [2018-01-30 00:26:58,108 INFO L226 Difference]: Without dead ends: 217 [2018-01-30 00:26:58,109 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:26:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-01-30 00:26:58,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 177. [2018-01-30 00:26:58,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-01-30 00:26:58,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 197 transitions. [2018-01-30 00:26:58,119 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 197 transitions. Word has length 34 [2018-01-30 00:26:58,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:26:58,120 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 197 transitions. [2018-01-30 00:26:58,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:26:58,120 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 197 transitions. [2018-01-30 00:26:58,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 00:26:58,121 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:26:58,121 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:26:58,121 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:26:58,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1065360486, now seen corresponding path program 1 times [2018-01-30 00:26:58,122 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:26:58,122 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:26:58,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:58,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:26:58,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:26:58,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:26:58,229 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-30 00:26:58,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:26:58,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:26:58,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:26:58,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:26:58,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:26:58,230 INFO L87 Difference]: Start difference. First operand 177 states and 197 transitions. Second operand 8 states. [2018-01-30 00:26:58,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:26:58,549 INFO L93 Difference]: Finished difference Result 342 states and 377 transitions. [2018-01-30 00:26:58,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:26:58,549 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-01-30 00:26:58,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:26:58,551 INFO L225 Difference]: With dead ends: 342 [2018-01-30 00:26:58,551 INFO L226 Difference]: Without dead ends: 341 [2018-01-30 00:26:58,552 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:26:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-01-30 00:26:58,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 195. [2018-01-30 00:26:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-30 00:26:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 219 transitions. [2018-01-30 00:26:58,564 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 219 transitions. Word has length 36 [2018-01-30 00:26:58,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:26:58,565 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 219 transitions. [2018-01-30 00:26:58,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:26:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 219 transitions. [2018-01-30 00:26:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 00:26:58,566 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:26:58,566 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:26:58,566 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:26:58,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1065360485, now seen corresponding path program 1 times [2018-01-30 00:26:58,567 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:26:58,567 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:26:58,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:58,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:26:58,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:26:58,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:26:58,892 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-30 00:26:58,892 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:26:58,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 00:26:58,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:26:58,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:26:58,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:26:58,893 INFO L87 Difference]: Start difference. First operand 195 states and 219 transitions. Second operand 9 states. [2018-01-30 00:26:59,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:26:59,589 INFO L93 Difference]: Finished difference Result 392 states and 434 transitions. [2018-01-30 00:26:59,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:26:59,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-01-30 00:26:59,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:26:59,590 INFO L225 Difference]: With dead ends: 392 [2018-01-30 00:26:59,590 INFO L226 Difference]: Without dead ends: 291 [2018-01-30 00:26:59,591 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2018-01-30 00:26:59,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-01-30 00:26:59,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 191. [2018-01-30 00:26:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-30 00:26:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 213 transitions. [2018-01-30 00:26:59,603 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 213 transitions. Word has length 36 [2018-01-30 00:26:59,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:26:59,603 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 213 transitions. [2018-01-30 00:26:59,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:26:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 213 transitions. [2018-01-30 00:26:59,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-30 00:26:59,604 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:26:59,605 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:26:59,605 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:26:59,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2043097809, now seen corresponding path program 1 times [2018-01-30 00:26:59,605 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:26:59,605 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:26:59,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:59,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:26:59,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:26:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:26:59,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:26:59,733 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-30 00:26:59,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:26:59,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:26:59,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:26:59,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:26:59,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:26:59,765 INFO L87 Difference]: Start difference. First operand 191 states and 213 transitions. Second operand 9 states. [2018-01-30 00:27:00,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:27:00,343 INFO L93 Difference]: Finished difference Result 556 states and 612 transitions. [2018-01-30 00:27:00,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:27:00,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-01-30 00:27:00,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:27:00,346 INFO L225 Difference]: With dead ends: 556 [2018-01-30 00:27:00,347 INFO L226 Difference]: Without dead ends: 555 [2018-01-30 00:27:00,347 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-01-30 00:27:00,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-01-30 00:27:00,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 208. [2018-01-30 00:27:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-30 00:27:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 234 transitions. [2018-01-30 00:27:00,366 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 234 transitions. Word has length 37 [2018-01-30 00:27:00,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:27:00,366 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 234 transitions. [2018-01-30 00:27:00,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:27:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 234 transitions. [2018-01-30 00:27:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-30 00:27:00,368 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:27:00,368 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:27:00,368 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:27:00,368 INFO L82 PathProgramCache]: Analyzing trace with hash 2043097810, now seen corresponding path program 1 times [2018-01-30 00:27:00,368 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:27:00,368 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:27:00,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:27:00,369 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:27:00,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:27:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:27:00,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:27:00,640 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-30 00:27:00,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:27:00,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-30 00:27:00,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:27:00,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:27:00,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:27:00,641 INFO L87 Difference]: Start difference. First operand 208 states and 234 transitions. Second operand 11 states. [2018-01-30 00:27:01,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:27:01,540 INFO L93 Difference]: Finished difference Result 416 states and 460 transitions. [2018-01-30 00:27:01,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:27:01,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-01-30 00:27:01,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:27:01,542 INFO L225 Difference]: With dead ends: 416 [2018-01-30 00:27:01,542 INFO L226 Difference]: Without dead ends: 415 [2018-01-30 00:27:01,543 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:27:01,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-01-30 00:27:01,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 208. [2018-01-30 00:27:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-30 00:27:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 233 transitions. [2018-01-30 00:27:01,559 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 233 transitions. Word has length 37 [2018-01-30 00:27:01,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:27:01,559 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 233 transitions. [2018-01-30 00:27:01,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:27:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 233 transitions. [2018-01-30 00:27:01,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-30 00:27:01,560 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:27:01,560 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:27:01,560 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:27:01,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1982432584, now seen corresponding path program 1 times [2018-01-30 00:27:01,561 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:27:01,561 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:27:01,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:27:01,562 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:27:01,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:27:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:27:01,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:27:01,631 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-30 00:27:01,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:27:01,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:27:01,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:27:01,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:27:01,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:27:01,632 INFO L87 Difference]: Start difference. First operand 208 states and 233 transitions. Second operand 5 states. [2018-01-30 00:27:01,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:27:01,989 INFO L93 Difference]: Finished difference Result 344 states and 383 transitions. [2018-01-30 00:27:01,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:27:01,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-01-30 00:27:01,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:27:01,991 INFO L225 Difference]: With dead ends: 344 [2018-01-30 00:27:01,992 INFO L226 Difference]: Without dead ends: 343 [2018-01-30 00:27:01,992 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:27:01,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-01-30 00:27:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 207. [2018-01-30 00:27:02,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-01-30 00:27:02,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 232 transitions. [2018-01-30 00:27:02,008 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 232 transitions. Word has length 40 [2018-01-30 00:27:02,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:27:02,008 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 232 transitions. [2018-01-30 00:27:02,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:27:02,009 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 232 transitions. [2018-01-30 00:27:02,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-30 00:27:02,009 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:27:02,009 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:27:02,010 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:27:02,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1982432583, now seen corresponding path program 1 times [2018-01-30 00:27:02,010 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:27:02,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:27:02,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:27:02,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:27:02,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:27:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:27:02,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:27:02,078 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-30 00:27:02,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:27:02,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:27:02,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:27:02,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:27:02,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:27:02,079 INFO L87 Difference]: Start difference. First operand 207 states and 232 transitions. Second operand 5 states. [2018-01-30 00:27:02,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:27:02,404 INFO L93 Difference]: Finished difference Result 349 states and 392 transitions. [2018-01-30 00:27:02,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:27:02,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-01-30 00:27:02,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:27:02,406 INFO L225 Difference]: With dead ends: 349 [2018-01-30 00:27:02,406 INFO L226 Difference]: Without dead ends: 348 [2018-01-30 00:27:02,407 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:27:02,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-01-30 00:27:02,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 206. [2018-01-30 00:27:02,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-30 00:27:02,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 231 transitions. [2018-01-30 00:27:02,422 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 231 transitions. Word has length 40 [2018-01-30 00:27:02,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:27:02,423 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 231 transitions. [2018-01-30 00:27:02,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:27:02,423 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 231 transitions. [2018-01-30 00:27:02,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-30 00:27:02,424 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:27:02,424 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:27:02,424 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:27:02,424 INFO L82 PathProgramCache]: Analyzing trace with hash 874397683, now seen corresponding path program 1 times [2018-01-30 00:27:02,424 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:27:02,424 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:27:02,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:27:02,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:27:02,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:27:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:27:02,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:27:02,456 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-30 00:27:02,456 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:27:02,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:27:02,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:27:02,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:27:02,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:27:02,457 INFO L87 Difference]: Start difference. First operand 206 states and 231 transitions. Second operand 4 states. [2018-01-30 00:27:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:27:02,484 INFO L93 Difference]: Finished difference Result 323 states and 360 transitions. [2018-01-30 00:27:02,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:27:02,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-01-30 00:27:02,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:27:02,486 INFO L225 Difference]: With dead ends: 323 [2018-01-30 00:27:02,486 INFO L226 Difference]: Without dead ends: 229 [2018-01-30 00:27:02,486 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:27:02,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-01-30 00:27:02,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 210. [2018-01-30 00:27:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-30 00:27:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 235 transitions. [2018-01-30 00:27:02,501 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 235 transitions. Word has length 51 [2018-01-30 00:27:02,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:27:02,501 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 235 transitions. [2018-01-30 00:27:02,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:27:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 235 transitions. [2018-01-30 00:27:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-30 00:27:02,502 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:27:02,502 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:27:02,502 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:27:02,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1286133230, now seen corresponding path program 1 times [2018-01-30 00:27:02,503 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:27:02,503 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:27:02,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:27:02,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:27:02,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:27:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:27:02,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:27:02,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:27:02,637 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:27:02,637 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-30 00:27:02,645 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:27:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:27:02,690 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:27:02,840 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-30 00:27:02,844 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-30 00:27:02,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:27:02,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:02,857 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-30 00:27:02,860 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-30 00:27:02,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:27:02,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:02,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:02,872 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-01-30 00:27:02,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-30 00:27:02,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:02,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-30 00:27:02,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:27:02,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:02,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-30 00:27:02,932 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:02,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-30 00:27:02,933 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:27:02,939 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:02,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:02,949 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:36 [2018-01-30 00:27:02,987 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 36 treesize of output 29 [2018-01-30 00:27:02,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:02,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:02,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:02,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-30 00:27:02,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:27:03,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:03,085 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 36 treesize of output 29 [2018-01-30 00:27:03,100 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:03,101 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:03,102 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:03,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-30 00:27:03,117 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:27:03,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:03,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:03,206 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:36 [2018-01-30 00:27:03,222 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 30 treesize of output 23 [2018-01-30 00:27:03,238 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:03,239 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:03,239 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:03,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-30 00:27:03,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:27:03,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:03,377 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 30 treesize of output 23 [2018-01-30 00:27:03,382 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:03,383 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:03,383 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:03,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-30 00:27:03,386 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:27:03,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:03,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:03,405 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:54 [2018-01-30 00:27:03,455 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 29 treesize of output 21 [2018-01-30 00:27:03,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-01-30 00:27:03,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:27:03,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:03,477 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 29 treesize of output 21 [2018-01-30 00:27:03,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-01-30 00:27:03,480 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:27:03,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:03,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:03,485 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2018-01-30 00:27:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:27:03,534 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:27:03,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 12 [2018-01-30 00:27:03,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 00:27:03,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 00:27:03,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:27:03,534 INFO L87 Difference]: Start difference. First operand 210 states and 235 transitions. Second operand 12 states. [2018-01-30 00:27:04,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:27:04,304 INFO L93 Difference]: Finished difference Result 396 states and 436 transitions. [2018-01-30 00:27:04,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-30 00:27:04,304 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-01-30 00:27:04,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:27:04,306 INFO L225 Difference]: With dead ends: 396 [2018-01-30 00:27:04,306 INFO L226 Difference]: Without dead ends: 311 [2018-01-30 00:27:04,307 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=578, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:27:04,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-01-30 00:27:04,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 234. [2018-01-30 00:27:04,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-01-30 00:27:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 260 transitions. [2018-01-30 00:27:04,326 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 260 transitions. Word has length 53 [2018-01-30 00:27:04,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:27:04,326 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 260 transitions. [2018-01-30 00:27:04,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 00:27:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 260 transitions. [2018-01-30 00:27:04,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-30 00:27:04,327 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:27:04,327 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:27:04,328 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:27:04,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1995648683, now seen corresponding path program 1 times [2018-01-30 00:27:04,328 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:27:04,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:27:04,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:27:04,329 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:27:04,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:27:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:27:04,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:27:04,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:27:04,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:27:04,975 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-30 00:27:04,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:27:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:27:05,017 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:27:05,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:27:05,060 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-30 00:27:05,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:27:05,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:05,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:05,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-30 00:27:05,097 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:05,098 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:05,098 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-30 00:27:05,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:27:05,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:05,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-01-30 00:27:05,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-01-30 00:27:05,137 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:05,138 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-30 00:27:05,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:27:05,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:05,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:05,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2018-01-30 00:27:05,229 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:05,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2018-01-30 00:27:05,233 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-30 00:27:05,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:27:05,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:05,245 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-30 00:27:05,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-01-30 00:27:05,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-01-30 00:27:05,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-30 00:27:05,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:27:05,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:27:05,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 00:27:05,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:90 [2018-01-30 00:27:05,493 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:05,515 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 51 treesize of output 50 [2018-01-30 00:27:05,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:05,519 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-30 00:27:05,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:27:05,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:05,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:05,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:36 [2018-01-30 00:27:05,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-01-30 00:27:05,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:05,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 35 [2018-01-30 00:27:05,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:27:05,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:05,605 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-30 00:27:05,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-01-30 00:27:05,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 36 [2018-01-30 00:27:05,707 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:27:05,708 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 15 treesize of output 6 [2018-01-30 00:27:05,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:27:05,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-01-30 00:27:05,715 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:27:05,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:05,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:27:05,719 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:56, output treesize:5 [2018-01-30 00:27:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:27:05,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:27:05,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 27 [2018-01-30 00:27:05,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-30 00:27:05,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-30 00:27:05,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2018-01-30 00:27:05,756 INFO L87 Difference]: Start difference. First operand 234 states and 260 transitions. Second operand 28 states. [2018-01-30 00:27:07,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:27:07,245 INFO L93 Difference]: Finished difference Result 476 states and 513 transitions. [2018-01-30 00:27:07,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-30 00:27:07,245 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 57 [2018-01-30 00:27:07,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:27:07,247 INFO L225 Difference]: With dead ends: 476 [2018-01-30 00:27:07,247 INFO L226 Difference]: Without dead ends: 475 [2018-01-30 00:27:07,248 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=624, Invalid=2346, Unknown=0, NotChecked=0, Total=2970 [2018-01-30 00:27:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-01-30 00:27:07,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 272. [2018-01-30 00:27:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-01-30 00:27:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 304 transitions. [2018-01-30 00:27:07,271 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 304 transitions. Word has length 57 [2018-01-30 00:27:07,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:27:07,272 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 304 transitions. [2018-01-30 00:27:07,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-30 00:27:07,272 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 304 transitions. [2018-01-30 00:27:07,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-30 00:27:07,273 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:27:07,273 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:27:07,273 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, 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, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:27:07,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1995648684, now seen corresponding path program 1 times [2018-01-30 00:27:07,274 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:27:07,274 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:27:07,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:27:07,275 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:27:07,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:27:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:27:07,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:27:07,471 ERROR L119 erpolLogProxyWrapper]: Could not assert interpolant [2018-01-30 00:27:07,472 ERROR L119 erpolLogProxyWrapper]: Interpolant 23 not inductive: (Check returned sat) [2018-01-30 00:27:07,473 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Asserted terms must be closed at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:956) 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:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) 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:396) 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:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) 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-30 00:27:07,477 INFO L168 Benchmark]: Toolchain (without parser) took 15029.43 ms. Allocated memory was 300.9 MB in the beginning and 625.5 MB in the end (delta: 324.5 MB). Free memory was 261.0 MB in the beginning and 553.4 MB in the end (delta: -292.5 MB). Peak memory consumption was 285.9 MB. Max. memory is 5.3 GB. [2018-01-30 00:27:07,478 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 300.9 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:27:07,478 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.35 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 247.8 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-30 00:27:07,479 INFO L168 Benchmark]: Boogie Preprocessor took 42.47 ms. Allocated memory is still 300.9 MB. Free memory was 247.8 MB in the beginning and 245.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:27:07,479 INFO L168 Benchmark]: RCFGBuilder took 570.17 ms. Allocated memory is still 300.9 MB. Free memory was 245.8 MB in the beginning and 202.7 MB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 5.3 GB. [2018-01-30 00:27:07,479 INFO L168 Benchmark]: TraceAbstraction took 14194.03 ms. Allocated memory was 300.9 MB in the beginning and 625.5 MB in the end (delta: 324.5 MB). Free memory was 202.7 MB in the beginning and 553.4 MB in the end (delta: -350.7 MB). Peak memory consumption was 227.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:27:07,481 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.17 ms. Allocated memory is still 300.9 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.35 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 247.8 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.47 ms. Allocated memory is still 300.9 MB. Free memory was 247.8 MB in the beginning and 245.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 570.17 ms. Allocated memory is still 300.9 MB. Free memory was 245.8 MB in the beginning and 202.7 MB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 14194.03 ms. Allocated memory was 300.9 MB in the beginning and 625.5 MB in the end (delta: 324.5 MB). Free memory was 202.7 MB in the beginning and 553.4 MB in the end (delta: -350.7 MB). Peak memory consumption was 227.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Asserted terms must be closed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Asserted terms must be closed: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) 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/dll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-27-07-490.csv Received shutdown request...