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/sll-01_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:33:11,378 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:33:11,380 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:33:11,395 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:33:11,395 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:33:11,396 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:33:11,397 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:33:11,399 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:33:11,401 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:33:11,402 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:33:11,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:33:11,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:33:11,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:33:11,405 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:33:11,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:33:11,408 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:33:11,410 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:33:11,413 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:33:11,414 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:33:11,415 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:33:11,417 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:33:11,418 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:33:11,418 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:33:11,419 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:33:11,420 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:33:11,421 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:33:11,421 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:33:11,422 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:33:11,422 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:33:11,422 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:33:11,423 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:33:11,423 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:33:11,431 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:33:11,432 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:33:11,433 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:33:11,433 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:33:11,433 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:33:11,433 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:33:11,433 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:33:11,434 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:33:11,434 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:33:11,434 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:33:11,434 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:33:11,434 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:33:11,434 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:33:11,434 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:33:11,434 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:33:11,435 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:33:11,435 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:33:11,435 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:33:11,435 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:33:11,435 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:33:11,435 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:33:11,435 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:33:11,436 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:33:11,436 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:33:11,436 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:33:11,436 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:33:11,436 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:33:11,436 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:33:11,437 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:33:11,437 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:33:11,437 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:33:11,437 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:33:11,438 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:33:11,438 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:33:11,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:33:11,481 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:33:11,485 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:33:11,486 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:33:11,486 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:33:11,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_true-unreach-call_true-valid-memsafety.i [2018-01-30 00:33:11,653 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:33:11,659 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:33:11,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:33:11,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:33:11,665 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:33:11,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:33:11" (1/1) ... [2018-01-30 00:33:11,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e3f01f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:33:11, skipping insertion in model container [2018-01-30 00:33:11,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:33:11" (1/1) ... [2018-01-30 00:33:11,684 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:33:11,724 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:33:11,852 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:33:11,879 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:33:11,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:33:11 WrapperNode [2018-01-30 00:33:11,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:33:11,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:33:11,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:33:11,892 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:33:11,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:33:11" (1/1) ... [2018-01-30 00:33:11,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:33:11" (1/1) ... [2018-01-30 00:33:11,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:33:11" (1/1) ... [2018-01-30 00:33:11,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:33:11" (1/1) ... [2018-01-30 00:33:11,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:33:11" (1/1) ... [2018-01-30 00:33:11,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:33:11" (1/1) ... [2018-01-30 00:33:11,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:33:11" (1/1) ... [2018-01-30 00:33:11,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:33:11,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:33:11,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:33:11,937 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:33:11,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:33:11" (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:33:11,993 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:33:11,993 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:33:11,993 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:33:11,993 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:33:11,993 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:33:11,994 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:33:11,994 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:33:11,994 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:33:11,994 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:33:11,994 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:33:11,994 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:33:11,994 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 00:33:11,994 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:33:11,994 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:33:11,994 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:33:12,667 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:33:12,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:33:12 BoogieIcfgContainer [2018-01-30 00:33:12,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:33:12,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:33:12,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:33:12,672 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:33:12,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:33:11" (1/3) ... [2018-01-30 00:33:12,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a1da1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:33:12, skipping insertion in model container [2018-01-30 00:33:12,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:33:11" (2/3) ... [2018-01-30 00:33:12,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a1da1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:33:12, skipping insertion in model container [2018-01-30 00:33:12,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:33:12" (3/3) ... [2018-01-30 00:33:12,676 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-01_true-unreach-call_true-valid-memsafety.i [2018-01-30 00:33:12,683 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:33:12,690 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-01-30 00:33:12,734 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:33:12,734 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:33:12,734 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:33:12,735 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:33:12,735 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:33:12,735 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:33:12,735 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:33:12,735 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:33:12,736 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:33:12,758 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states. [2018-01-30 00:33:12,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-30 00:33:12,764 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:12,765 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:33:12,765 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:12,769 INFO L82 PathProgramCache]: Analyzing trace with hash -355028435, now seen corresponding path program 1 times [2018-01-30 00:33:12,770 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:12,771 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:12,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:12,809 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:12,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:12,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:12,924 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:33:12,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:12,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:33:12,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:33:12,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:33:12,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:33:13,001 INFO L87 Difference]: Start difference. First operand 233 states. Second operand 4 states. [2018-01-30 00:33:13,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:13,293 INFO L93 Difference]: Finished difference Result 492 states and 619 transitions. [2018-01-30 00:33:13,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:33:13,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-01-30 00:33:13,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:13,309 INFO L225 Difference]: With dead ends: 492 [2018-01-30 00:33:13,309 INFO L226 Difference]: Without dead ends: 237 [2018-01-30 00:33:13,315 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:33:13,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-01-30 00:33:13,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 203. [2018-01-30 00:33:13,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-01-30 00:33:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 215 transitions. [2018-01-30 00:33:13,368 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 215 transitions. Word has length 9 [2018-01-30 00:33:13,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:13,369 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 215 transitions. [2018-01-30 00:33:13,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:33:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 215 transitions. [2018-01-30 00:33:13,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-30 00:33:13,370 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:13,370 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:33:13,370 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:13,370 INFO L82 PathProgramCache]: Analyzing trace with hash -355028434, now seen corresponding path program 1 times [2018-01-30 00:33:13,370 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:13,371 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:13,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:13,372 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:13,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:13,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:13,468 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:33:13,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:13,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:33:13,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:33:13,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:33:13,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:33:13,470 INFO L87 Difference]: Start difference. First operand 203 states and 215 transitions. Second operand 4 states. [2018-01-30 00:33:13,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:13,684 INFO L93 Difference]: Finished difference Result 240 states and 252 transitions. [2018-01-30 00:33:13,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:33:13,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-01-30 00:33:13,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:13,686 INFO L225 Difference]: With dead ends: 240 [2018-01-30 00:33:13,686 INFO L226 Difference]: Without dead ends: 230 [2018-01-30 00:33:13,687 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:33:13,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-01-30 00:33:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 219. [2018-01-30 00:33:13,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-01-30 00:33:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 238 transitions. [2018-01-30 00:33:13,701 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 238 transitions. Word has length 9 [2018-01-30 00:33:13,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:13,701 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 238 transitions. [2018-01-30 00:33:13,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:33:13,702 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 238 transitions. [2018-01-30 00:33:13,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-30 00:33:13,702 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:13,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] [2018-01-30 00:33:13,703 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:13,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1724456866, now seen corresponding path program 1 times [2018-01-30 00:33:13,703 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:13,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:13,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:13,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:13,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:13,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:33:13,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:13,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:33:13,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:33:13,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:33:13,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:33:13,770 INFO L87 Difference]: Start difference. First operand 219 states and 238 transitions. Second operand 5 states. [2018-01-30 00:33:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:14,218 INFO L93 Difference]: Finished difference Result 375 states and 402 transitions. [2018-01-30 00:33:14,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:33:14,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-30 00:33:14,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:14,221 INFO L225 Difference]: With dead ends: 375 [2018-01-30 00:33:14,221 INFO L226 Difference]: Without dead ends: 374 [2018-01-30 00:33:14,222 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:33:14,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-01-30 00:33:14,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 218. [2018-01-30 00:33:14,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-30 00:33:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2018-01-30 00:33:14,235 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 19 [2018-01-30 00:33:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:14,236 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2018-01-30 00:33:14,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:33:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2018-01-30 00:33:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-30 00:33:14,237 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:14,237 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:33:14,238 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:14,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1724456865, now seen corresponding path program 1 times [2018-01-30 00:33:14,238 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:14,239 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:14,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:14,240 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:14,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:14,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:14,330 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:33:14,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:14,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:33:14,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:33:14,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:33:14,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:33:14,331 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand 5 states. [2018-01-30 00:33:14,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:14,576 INFO L93 Difference]: Finished difference Result 408 states and 445 transitions. [2018-01-30 00:33:14,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:33:14,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-30 00:33:14,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:14,578 INFO L225 Difference]: With dead ends: 408 [2018-01-30 00:33:14,579 INFO L226 Difference]: Without dead ends: 407 [2018-01-30 00:33:14,579 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:33:14,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-01-30 00:33:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 217. [2018-01-30 00:33:14,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-01-30 00:33:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 236 transitions. [2018-01-30 00:33:14,590 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 236 transitions. Word has length 19 [2018-01-30 00:33:14,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:14,591 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 236 transitions. [2018-01-30 00:33:14,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:33:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 236 transitions. [2018-01-30 00:33:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-30 00:33:14,591 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:14,591 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] [2018-01-30 00:33:14,592 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:14,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1190646662, now seen corresponding path program 1 times [2018-01-30 00:33:14,592 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:14,592 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:14,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:14,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:14,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:14,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:14,740 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:33:14,740 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:14,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:33:14,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:33:14,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:33:14,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:33:14,741 INFO L87 Difference]: Start difference. First operand 217 states and 236 transitions. Second operand 8 states. [2018-01-30 00:33:15,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:15,080 INFO L93 Difference]: Finished difference Result 378 states and 403 transitions. [2018-01-30 00:33:15,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:33:15,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-30 00:33:15,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:15,083 INFO L225 Difference]: With dead ends: 378 [2018-01-30 00:33:15,083 INFO L226 Difference]: Without dead ends: 377 [2018-01-30 00:33:15,083 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:33:15,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-01-30 00:33:15,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 216. [2018-01-30 00:33:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-30 00:33:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 235 transitions. [2018-01-30 00:33:15,095 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 235 transitions. Word has length 22 [2018-01-30 00:33:15,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:15,095 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 235 transitions. [2018-01-30 00:33:15,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:33:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 235 transitions. [2018-01-30 00:33:15,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-30 00:33:15,097 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:15,097 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] [2018-01-30 00:33:15,097 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:15,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1190646661, now seen corresponding path program 1 times [2018-01-30 00:33:15,097 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:15,097 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:15,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:15,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:15,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:15,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:15,238 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:33:15,238 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:15,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:33:15,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:33:15,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:33:15,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:33:15,239 INFO L87 Difference]: Start difference. First operand 216 states and 235 transitions. Second operand 8 states. [2018-01-30 00:33:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:15,780 INFO L93 Difference]: Finished difference Result 380 states and 405 transitions. [2018-01-30 00:33:15,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:33:15,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-30 00:33:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:15,782 INFO L225 Difference]: With dead ends: 380 [2018-01-30 00:33:15,782 INFO L226 Difference]: Without dead ends: 379 [2018-01-30 00:33:15,783 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:33:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-01-30 00:33:15,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 215. [2018-01-30 00:33:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-30 00:33:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 234 transitions. [2018-01-30 00:33:15,790 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 234 transitions. Word has length 22 [2018-01-30 00:33:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:15,790 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 234 transitions. [2018-01-30 00:33:15,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:33:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 234 transitions. [2018-01-30 00:33:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-30 00:33:15,791 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:15,791 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:33:15,791 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:15,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1328822523, now seen corresponding path program 1 times [2018-01-30 00:33:15,791 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:15,792 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:15,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:15,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:15,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:15,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:15,862 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:33:15,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:15,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:33:15,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:33:15,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:33:15,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:33:15,863 INFO L87 Difference]: Start difference. First operand 215 states and 234 transitions. Second operand 5 states. [2018-01-30 00:33:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:15,966 INFO L93 Difference]: Finished difference Result 505 states and 547 transitions. [2018-01-30 00:33:15,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:33:15,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-30 00:33:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:15,968 INFO L225 Difference]: With dead ends: 505 [2018-01-30 00:33:15,968 INFO L226 Difference]: Without dead ends: 321 [2018-01-30 00:33:15,968 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:33:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-01-30 00:33:15,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 219. [2018-01-30 00:33:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-01-30 00:33:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 238 transitions. [2018-01-30 00:33:15,980 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 238 transitions. Word has length 32 [2018-01-30 00:33:15,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:15,980 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 238 transitions. [2018-01-30 00:33:15,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:33:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 238 transitions. [2018-01-30 00:33:15,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:33:15,982 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:15,982 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:33:15,982 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:15,982 INFO L82 PathProgramCache]: Analyzing trace with hash 727221888, now seen corresponding path program 1 times [2018-01-30 00:33:15,982 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:15,983 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:15,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:15,984 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:15,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:15,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:16,055 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:33:16,055 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:16,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:33:16,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:33:16,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:33:16,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:33:16,056 INFO L87 Difference]: Start difference. First operand 219 states and 238 transitions. Second operand 5 states. [2018-01-30 00:33:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:16,184 INFO L93 Difference]: Finished difference Result 243 states and 257 transitions. [2018-01-30 00:33:16,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:33:16,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-30 00:33:16,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:16,220 INFO L225 Difference]: With dead ends: 243 [2018-01-30 00:33:16,221 INFO L226 Difference]: Without dead ends: 231 [2018-01-30 00:33:16,221 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 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:33:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-01-30 00:33:16,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 212. [2018-01-30 00:33:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-01-30 00:33:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 231 transitions. [2018-01-30 00:33:16,232 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 231 transitions. Word has length 34 [2018-01-30 00:33:16,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:16,232 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 231 transitions. [2018-01-30 00:33:16,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:33:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 231 transitions. [2018-01-30 00:33:16,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:33:16,234 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:16,234 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:33:16,234 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:16,234 INFO L82 PathProgramCache]: Analyzing trace with hash 727221889, now seen corresponding path program 1 times [2018-01-30 00:33:16,234 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:16,234 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:16,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:16,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:16,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:16,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:16,361 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:33:16,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:16,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:33:16,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:33:16,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:33:16,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:33:16,362 INFO L87 Difference]: Start difference. First operand 212 states and 231 transitions. Second operand 7 states. [2018-01-30 00:33:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:16,603 INFO L93 Difference]: Finished difference Result 276 states and 291 transitions. [2018-01-30 00:33:16,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:33:16,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-30 00:33:16,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:16,605 INFO L225 Difference]: With dead ends: 276 [2018-01-30 00:33:16,605 INFO L226 Difference]: Without dead ends: 272 [2018-01-30 00:33:16,606 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:33:16,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-01-30 00:33:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 246. [2018-01-30 00:33:16,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-01-30 00:33:16,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 273 transitions. [2018-01-30 00:33:16,617 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 273 transitions. Word has length 34 [2018-01-30 00:33:16,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:16,618 INFO L432 AbstractCegarLoop]: Abstraction has 246 states and 273 transitions. [2018-01-30 00:33:16,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:33:16,618 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 273 transitions. [2018-01-30 00:33:16,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 00:33:16,619 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:16,619 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] [2018-01-30 00:33:16,619 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:16,620 INFO L82 PathProgramCache]: Analyzing trace with hash 651802564, now seen corresponding path program 1 times [2018-01-30 00:33:16,620 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:16,620 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:16,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:16,620 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:16,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:16,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:16,674 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:33:16,675 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:16,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:33:16,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:33:16,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:33:16,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:33:16,676 INFO L87 Difference]: Start difference. First operand 246 states and 273 transitions. Second operand 6 states. [2018-01-30 00:33:17,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:17,030 INFO L93 Difference]: Finished difference Result 356 states and 396 transitions. [2018-01-30 00:33:17,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:33:17,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-01-30 00:33:17,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:17,032 INFO L225 Difference]: With dead ends: 356 [2018-01-30 00:33:17,032 INFO L226 Difference]: Without dead ends: 355 [2018-01-30 00:33:17,033 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:33:17,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-01-30 00:33:17,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 245. [2018-01-30 00:33:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-01-30 00:33:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 272 transitions. [2018-01-30 00:33:17,048 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 272 transitions. Word has length 38 [2018-01-30 00:33:17,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:17,048 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 272 transitions. [2018-01-30 00:33:17,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:33:17,048 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 272 transitions. [2018-01-30 00:33:17,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 00:33:17,049 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:17,049 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] [2018-01-30 00:33:17,049 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:17,050 INFO L82 PathProgramCache]: Analyzing trace with hash 651802565, now seen corresponding path program 1 times [2018-01-30 00:33:17,050 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:17,050 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:17,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:17,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:17,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:17,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:17,190 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:33:17,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:17,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:33:17,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:33:17,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:33:17,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:33:17,192 INFO L87 Difference]: Start difference. First operand 245 states and 272 transitions. Second operand 6 states. [2018-01-30 00:33:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:17,661 INFO L93 Difference]: Finished difference Result 390 states and 438 transitions. [2018-01-30 00:33:17,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:33:17,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-01-30 00:33:17,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:17,664 INFO L225 Difference]: With dead ends: 390 [2018-01-30 00:33:17,664 INFO L226 Difference]: Without dead ends: 381 [2018-01-30 00:33:17,665 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:33:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-01-30 00:33:17,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 229. [2018-01-30 00:33:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-01-30 00:33:17,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 255 transitions. [2018-01-30 00:33:17,678 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 255 transitions. Word has length 38 [2018-01-30 00:33:17,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:17,678 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 255 transitions. [2018-01-30 00:33:17,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:33:17,678 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 255 transitions. [2018-01-30 00:33:17,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 00:33:17,679 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:17,679 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, 1, 1, 1] [2018-01-30 00:33:17,679 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:17,680 INFO L82 PathProgramCache]: Analyzing trace with hash -827939108, now seen corresponding path program 1 times [2018-01-30 00:33:17,680 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:17,680 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:17,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:17,681 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:17,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:17,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:17,729 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:33:17,730 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:17,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:33:17,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:33:17,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:33:17,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:33:17,730 INFO L87 Difference]: Start difference. First operand 229 states and 255 transitions. Second operand 5 states. [2018-01-30 00:33:17,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:17,967 INFO L93 Difference]: Finished difference Result 317 states and 342 transitions. [2018-01-30 00:33:17,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:33:17,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-30 00:33:17,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:17,970 INFO L225 Difference]: With dead ends: 317 [2018-01-30 00:33:17,970 INFO L226 Difference]: Without dead ends: 252 [2018-01-30 00:33:17,971 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:33:17,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-01-30 00:33:17,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 229. [2018-01-30 00:33:17,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-01-30 00:33:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 253 transitions. [2018-01-30 00:33:17,985 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 253 transitions. Word has length 43 [2018-01-30 00:33:17,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:17,986 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 253 transitions. [2018-01-30 00:33:17,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:33:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 253 transitions. [2018-01-30 00:33:17,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-30 00:33:17,987 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:17,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:33:17,987 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:17,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1097949650, now seen corresponding path program 1 times [2018-01-30 00:33:17,988 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:17,988 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:17,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:17,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:17,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:18,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:18,072 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:33:18,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:18,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:33:18,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:33:18,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:33:18,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:33:18,074 INFO L87 Difference]: Start difference. First operand 229 states and 253 transitions. Second operand 5 states. [2018-01-30 00:33:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:18,421 INFO L93 Difference]: Finished difference Result 369 states and 408 transitions. [2018-01-30 00:33:18,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:33:18,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-01-30 00:33:18,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:18,423 INFO L225 Difference]: With dead ends: 369 [2018-01-30 00:33:18,423 INFO L226 Difference]: Without dead ends: 368 [2018-01-30 00:33:18,423 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:33:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-01-30 00:33:18,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 228. [2018-01-30 00:33:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-01-30 00:33:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 252 transitions. [2018-01-30 00:33:18,431 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 252 transitions. Word has length 51 [2018-01-30 00:33:18,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:18,431 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 252 transitions. [2018-01-30 00:33:18,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:33:18,431 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 252 transitions. [2018-01-30 00:33:18,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-30 00:33:18,432 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:18,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:33:18,432 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:18,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1097949651, now seen corresponding path program 1 times [2018-01-30 00:33:18,432 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:18,433 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:18,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:18,434 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:18,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:18,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:18,583 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:33:18,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:18,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:33:18,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:33:18,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:33:18,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:33:18,585 INFO L87 Difference]: Start difference. First operand 228 states and 252 transitions. Second operand 5 states. [2018-01-30 00:33:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:19,019 INFO L93 Difference]: Finished difference Result 405 states and 451 transitions. [2018-01-30 00:33:19,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:33:19,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-01-30 00:33:19,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:19,021 INFO L225 Difference]: With dead ends: 405 [2018-01-30 00:33:19,021 INFO L226 Difference]: Without dead ends: 404 [2018-01-30 00:33:19,021 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:33:19,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-01-30 00:33:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 227. [2018-01-30 00:33:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-01-30 00:33:19,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 251 transitions. [2018-01-30 00:33:19,032 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 251 transitions. Word has length 51 [2018-01-30 00:33:19,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:19,032 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 251 transitions. [2018-01-30 00:33:19,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:33:19,033 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 251 transitions. [2018-01-30 00:33:19,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-30 00:33:19,033 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:19,034 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:33:19,034 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:19,034 INFO L82 PathProgramCache]: Analyzing trace with hash 499175845, now seen corresponding path program 1 times [2018-01-30 00:33:19,034 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:19,034 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:19,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:19,035 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:19,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:19,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:19,233 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:33:19,233 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:19,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-30 00:33:19,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:33:19,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:33:19,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:33:19,234 INFO L87 Difference]: Start difference. First operand 227 states and 251 transitions. Second operand 10 states. [2018-01-30 00:33:19,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:19,767 INFO L93 Difference]: Finished difference Result 505 states and 552 transitions. [2018-01-30 00:33:19,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:33:19,768 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-01-30 00:33:19,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:19,770 INFO L225 Difference]: With dead ends: 505 [2018-01-30 00:33:19,770 INFO L226 Difference]: Without dead ends: 373 [2018-01-30 00:33:19,771 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-01-30 00:33:19,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-01-30 00:33:19,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 281. [2018-01-30 00:33:19,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-01-30 00:33:19,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 309 transitions. [2018-01-30 00:33:19,790 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 309 transitions. Word has length 52 [2018-01-30 00:33:19,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:19,790 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 309 transitions. [2018-01-30 00:33:19,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:33:19,791 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 309 transitions. [2018-01-30 00:33:19,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 00:33:19,791 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:19,791 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:33:19,792 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:19,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1452752215, now seen corresponding path program 1 times [2018-01-30 00:33:19,792 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:19,792 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:19,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:19,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:19,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:19,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:19,909 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:33:19,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:19,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:33:19,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:33:19,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:33:19,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:33:19,911 INFO L87 Difference]: Start difference. First operand 281 states and 309 transitions. Second operand 8 states. [2018-01-30 00:33:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:20,239 INFO L93 Difference]: Finished difference Result 312 states and 343 transitions. [2018-01-30 00:33:20,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:33:20,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-01-30 00:33:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:20,241 INFO L225 Difference]: With dead ends: 312 [2018-01-30 00:33:20,241 INFO L226 Difference]: Without dead ends: 311 [2018-01-30 00:33:20,241 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:33:20,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-01-30 00:33:20,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 280. [2018-01-30 00:33:20,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-01-30 00:33:20,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 308 transitions. [2018-01-30 00:33:20,260 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 308 transitions. Word has length 54 [2018-01-30 00:33:20,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:20,260 INFO L432 AbstractCegarLoop]: Abstraction has 280 states and 308 transitions. [2018-01-30 00:33:20,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:33:20,260 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 308 transitions. [2018-01-30 00:33:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 00:33:20,261 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:20,261 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:33:20,261 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:20,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1452752214, now seen corresponding path program 1 times [2018-01-30 00:33:20,262 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:20,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:20,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:20,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:20,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:20,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:20,411 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:33:20,411 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:20,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:33:20,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:33:20,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:33:20,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:33:20,412 INFO L87 Difference]: Start difference. First operand 280 states and 308 transitions. Second operand 8 states. [2018-01-30 00:33:20,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:20,775 INFO L93 Difference]: Finished difference Result 311 states and 342 transitions. [2018-01-30 00:33:20,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:33:20,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-01-30 00:33:20,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:20,777 INFO L225 Difference]: With dead ends: 311 [2018-01-30 00:33:20,777 INFO L226 Difference]: Without dead ends: 310 [2018-01-30 00:33:20,777 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:33:20,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-01-30 00:33:20,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 279. [2018-01-30 00:33:20,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-01-30 00:33:20,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 307 transitions. [2018-01-30 00:33:20,788 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 307 transitions. Word has length 54 [2018-01-30 00:33:20,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:20,788 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 307 transitions. [2018-01-30 00:33:20,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:33:20,788 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 307 transitions. [2018-01-30 00:33:20,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-30 00:33:20,789 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:20,789 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, 1, 1] [2018-01-30 00:33:20,789 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:20,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1752830861, now seen corresponding path program 1 times [2018-01-30 00:33:20,789 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:20,789 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:20,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:20,790 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:20,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:20,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:20,874 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:33:20,874 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:33:20,874 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:33:20,882 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:20,937 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:33:21,053 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:33:21,057 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:33:21,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:21,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:21,072 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:33:21,075 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:33:21,075 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:21,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:21,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:21,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-01-30 00:33:21,133 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:33:21,137 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:33:21,140 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:33:21,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:21,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:21,165 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:33:21,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:33:21,170 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:33:21,170 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:21,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:21,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:21,188 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-01-30 00:33:21,279 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 24 treesize of output 18 [2018-01-30 00:33:21,283 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:33:21,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-30 00:33:21,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:21,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:21,302 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 24 treesize of output 18 [2018-01-30 00:33:21,306 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:33:21,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-30 00:33:21,308 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:21,312 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:21,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:21,319 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-01-30 00:33:21,356 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:33:21,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:33:21,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2018-01-30 00:33:21,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:33:21,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:33:21,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:33:21,393 INFO L87 Difference]: Start difference. First operand 279 states and 307 transitions. Second operand 11 states. [2018-01-30 00:33:21,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:21,952 INFO L93 Difference]: Finished difference Result 558 states and 600 transitions. [2018-01-30 00:33:21,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 00:33:21,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-01-30 00:33:21,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:21,955 INFO L225 Difference]: With dead ends: 558 [2018-01-30 00:33:21,955 INFO L226 Difference]: Without dead ends: 451 [2018-01-30 00:33:21,956 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2018-01-30 00:33:21,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-01-30 00:33:21,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 337. [2018-01-30 00:33:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-01-30 00:33:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 374 transitions. [2018-01-30 00:33:21,985 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 374 transitions. Word has length 55 [2018-01-30 00:33:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:21,985 INFO L432 AbstractCegarLoop]: Abstraction has 337 states and 374 transitions. [2018-01-30 00:33:21,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:33:21,985 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 374 transitions. [2018-01-30 00:33:21,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-30 00:33:21,986 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:21,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:33:21,987 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:21,987 INFO L82 PathProgramCache]: Analyzing trace with hash -963704105, now seen corresponding path program 1 times [2018-01-30 00:33:21,987 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:21,987 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:21,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:21,988 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:21,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:22,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:22,458 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:33:22,458 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:22,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-30 00:33:22,459 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 00:33:22,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 00:33:22,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:33:22,459 INFO L87 Difference]: Start difference. First operand 337 states and 374 transitions. Second operand 17 states. [2018-01-30 00:33:24,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:24,057 INFO L93 Difference]: Finished difference Result 715 states and 770 transitions. [2018-01-30 00:33:24,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 00:33:24,057 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-01-30 00:33:24,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:24,061 INFO L225 Difference]: With dead ends: 715 [2018-01-30 00:33:24,061 INFO L226 Difference]: Without dead ends: 712 [2018-01-30 00:33:24,062 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=423, Invalid=1137, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 00:33:24,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2018-01-30 00:33:24,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 345. [2018-01-30 00:33:24,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-01-30 00:33:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 381 transitions. [2018-01-30 00:33:24,091 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 381 transitions. Word has length 57 [2018-01-30 00:33:24,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:24,091 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 381 transitions. [2018-01-30 00:33:24,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 00:33:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 381 transitions. [2018-01-30 00:33:24,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-30 00:33:24,092 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:24,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:33:24,093 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:24,093 INFO L82 PathProgramCache]: Analyzing trace with hash -963704104, now seen corresponding path program 1 times [2018-01-30 00:33:24,093 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:24,093 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:24,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:24,094 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:24,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:24,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:24,547 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:33:24,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:24,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-30 00:33:24,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 00:33:24,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 00:33:24,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:33:24,548 INFO L87 Difference]: Start difference. First operand 345 states and 381 transitions. Second operand 17 states. [2018-01-30 00:33:26,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:26,293 INFO L93 Difference]: Finished difference Result 783 states and 832 transitions. [2018-01-30 00:33:26,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-30 00:33:26,294 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-01-30 00:33:26,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:26,296 INFO L225 Difference]: With dead ends: 783 [2018-01-30 00:33:26,297 INFO L226 Difference]: Without dead ends: 780 [2018-01-30 00:33:26,297 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=459, Invalid=1263, Unknown=0, NotChecked=0, Total=1722 [2018-01-30 00:33:26,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2018-01-30 00:33:26,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 354. [2018-01-30 00:33:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-01-30 00:33:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 389 transitions. [2018-01-30 00:33:26,326 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 389 transitions. Word has length 57 [2018-01-30 00:33:26,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:26,326 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 389 transitions. [2018-01-30 00:33:26,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 00:33:26,326 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 389 transitions. [2018-01-30 00:33:26,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-30 00:33:26,327 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:26,328 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:26,328 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:26,328 INFO L82 PathProgramCache]: Analyzing trace with hash -881382529, now seen corresponding path program 1 times [2018-01-30 00:33:26,328 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:26,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:26,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:26,329 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:26,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:26,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 00:33:26,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:26,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:33:26,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:33:26,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:33:26,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:33:26,493 INFO L87 Difference]: Start difference. First operand 354 states and 389 transitions. Second operand 7 states. [2018-01-30 00:33:26,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:26,665 INFO L93 Difference]: Finished difference Result 431 states and 474 transitions. [2018-01-30 00:33:26,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:33:26,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-01-30 00:33:26,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:26,667 INFO L225 Difference]: With dead ends: 431 [2018-01-30 00:33:26,667 INFO L226 Difference]: Without dead ends: 373 [2018-01-30 00:33:26,667 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:33:26,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-01-30 00:33:26,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 368. [2018-01-30 00:33:26,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-01-30 00:33:26,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 403 transitions. [2018-01-30 00:33:26,693 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 403 transitions. Word has length 64 [2018-01-30 00:33:26,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:26,693 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 403 transitions. [2018-01-30 00:33:26,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:33:26,693 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 403 transitions. [2018-01-30 00:33:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-30 00:33:26,694 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:26,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:33:26,695 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:26,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1314124087, now seen corresponding path program 1 times [2018-01-30 00:33:26,695 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:26,695 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:26,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:26,696 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:26,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:26,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:33:26,822 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:33:26,822 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:33:26,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:26,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:33:26,883 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:33:26,885 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:33:26,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:26,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:26,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:26,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-30 00:33:27,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-30 00:33:27,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:33:27,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:33:27,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:33:27,099 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 24 treesize of output 18 [2018-01-30 00:33:27,103 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:33:27,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:33:27,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-01-30 00:33:27,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-30 00:33:27,136 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:33:27,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:33:27,154 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-01-30 00:33:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:33:27,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:33:27,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2018-01-30 00:33:27,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 00:33:27,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 00:33:27,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=227, Unknown=2, NotChecked=0, Total=272 [2018-01-30 00:33:27,302 INFO L87 Difference]: Start difference. First operand 368 states and 403 transitions. Second operand 17 states. [2018-01-30 00:33:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:28,564 INFO L93 Difference]: Finished difference Result 739 states and 780 transitions. [2018-01-30 00:33:28,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-30 00:33:28,565 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-01-30 00:33:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:28,567 INFO L225 Difference]: With dead ends: 739 [2018-01-30 00:33:28,567 INFO L226 Difference]: Without dead ends: 700 [2018-01-30 00:33:28,567 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=284, Invalid=1349, Unknown=7, NotChecked=0, Total=1640 [2018-01-30 00:33:28,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2018-01-30 00:33:28,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 401. [2018-01-30 00:33:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-01-30 00:33:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 443 transitions. [2018-01-30 00:33:28,596 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 443 transitions. Word has length 67 [2018-01-30 00:33:28,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:28,597 INFO L432 AbstractCegarLoop]: Abstraction has 401 states and 443 transitions. [2018-01-30 00:33:28,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 00:33:28,597 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 443 transitions. [2018-01-30 00:33:28,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-30 00:33:28,598 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:28,598 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:33:28,598 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:28,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2083139647, now seen corresponding path program 1 times [2018-01-30 00:33:28,598 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:28,599 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:28,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:28,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:28,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:28,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 00:33:28,749 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:33:28,749 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:33:28,756 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:28,780 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:33:28,862 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~list~5.base Int)) (and (= 0 (select |c_old(#valid)| main_~list~5.base)) (= |c_#valid| (store |c_old(#valid)| main_~list~5.base 0)) (not (= 0 main_~list~5.base)))) is different from true [2018-01-30 00:33:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-01-30 00:33:28,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:33:28,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2018-01-30 00:33:28,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:33:28,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:33:28,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2018-01-30 00:33:28,896 INFO L87 Difference]: Start difference. First operand 401 states and 443 transitions. Second operand 10 states. [2018-01-30 00:33:29,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:29,253 INFO L93 Difference]: Finished difference Result 452 states and 494 transitions. [2018-01-30 00:33:29,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:33:29,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2018-01-30 00:33:29,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:29,254 INFO L225 Difference]: With dead ends: 452 [2018-01-30 00:33:29,254 INFO L226 Difference]: Without dead ends: 414 [2018-01-30 00:33:29,255 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=134, Unknown=1, NotChecked=24, Total=210 [2018-01-30 00:33:29,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-01-30 00:33:29,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 412. [2018-01-30 00:33:29,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-01-30 00:33:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 454 transitions. [2018-01-30 00:33:29,282 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 454 transitions. Word has length 68 [2018-01-30 00:33:29,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:29,283 INFO L432 AbstractCegarLoop]: Abstraction has 412 states and 454 transitions. [2018-01-30 00:33:29,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:33:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 454 transitions. [2018-01-30 00:33:29,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-30 00:33:29,284 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:29,284 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:29,284 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:29,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1901013425, now seen corresponding path program 1 times [2018-01-30 00:33:29,284 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:29,285 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:29,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:29,285 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:29,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:29,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:33:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 00:33:29,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:29,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-30 00:33:29,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 00:33:29,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 00:33:29,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:33:29,608 INFO L87 Difference]: Start difference. First operand 412 states and 454 transitions. Second operand 16 states. [2018-01-30 00:33:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:30,604 INFO L93 Difference]: Finished difference Result 688 states and 745 transitions. [2018-01-30 00:33:30,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-30 00:33:30,604 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 69 [2018-01-30 00:33:30,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:30,606 INFO L225 Difference]: With dead ends: 688 [2018-01-30 00:33:30,606 INFO L226 Difference]: Without dead ends: 687 [2018-01-30 00:33:30,607 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=405, Invalid=1235, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 00:33:30,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-01-30 00:33:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 423. [2018-01-30 00:33:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-01-30 00:33:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 467 transitions. [2018-01-30 00:33:30,626 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 467 transitions. Word has length 69 [2018-01-30 00:33:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:30,627 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 467 transitions. [2018-01-30 00:33:30,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 00:33:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 467 transitions. [2018-01-30 00:33:30,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-30 00:33:30,627 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:30,628 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:30,628 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:30,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1901013426, now seen corresponding path program 1 times [2018-01-30 00:33:30,628 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:30,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:30,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:30,629 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:30,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:30,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 00:33:31,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:31,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-30 00:33:31,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 00:33:31,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 00:33:31,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:33:31,053 INFO L87 Difference]: Start difference. First operand 423 states and 467 transitions. Second operand 17 states. [2018-01-30 00:33:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:31,989 INFO L93 Difference]: Finished difference Result 686 states and 743 transitions. [2018-01-30 00:33:31,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-30 00:33:31,989 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2018-01-30 00:33:31,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:31,991 INFO L225 Difference]: With dead ends: 686 [2018-01-30 00:33:31,991 INFO L226 Difference]: Without dead ends: 683 [2018-01-30 00:33:31,992 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2018-01-30 00:33:31,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-01-30 00:33:32,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 432. [2018-01-30 00:33:32,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-01-30 00:33:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 475 transitions. [2018-01-30 00:33:32,010 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 475 transitions. Word has length 69 [2018-01-30 00:33:32,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:32,010 INFO L432 AbstractCegarLoop]: Abstraction has 432 states and 475 transitions. [2018-01-30 00:33:32,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 00:33:32,010 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 475 transitions. [2018-01-30 00:33:32,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-30 00:33:32,011 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:32,011 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:33:32,012 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:32,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1681876211, now seen corresponding path program 1 times [2018-01-30 00:33:32,012 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:32,012 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:32,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:32,013 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:32,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:32,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 00:33:32,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:32,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:33:32,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:33:32,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:33:32,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:33:32,164 INFO L87 Difference]: Start difference. First operand 432 states and 475 transitions. Second operand 7 states. [2018-01-30 00:33:32,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:32,380 INFO L93 Difference]: Finished difference Result 458 states and 496 transitions. [2018-01-30 00:33:32,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:33:32,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-01-30 00:33:32,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:32,382 INFO L225 Difference]: With dead ends: 458 [2018-01-30 00:33:32,382 INFO L226 Difference]: Without dead ends: 448 [2018-01-30 00:33:32,383 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:33:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-01-30 00:33:32,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 432. [2018-01-30 00:33:32,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-01-30 00:33:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 474 transitions. [2018-01-30 00:33:32,412 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 474 transitions. Word has length 73 [2018-01-30 00:33:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:32,413 INFO L432 AbstractCegarLoop]: Abstraction has 432 states and 474 transitions. [2018-01-30 00:33:32,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:33:32,413 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 474 transitions. [2018-01-30 00:33:32,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-30 00:33:32,414 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:32,414 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:33:32,414 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:32,414 INFO L82 PathProgramCache]: Analyzing trace with hash 992055160, now seen corresponding path program 1 times [2018-01-30 00:33:32,414 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:32,415 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:32,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:32,415 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:32,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:32,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 00:33:32,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:32,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-30 00:33:32,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:33:32,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:33:32,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:33:32,644 INFO L87 Difference]: Start difference. First operand 432 states and 474 transitions. Second operand 11 states. [2018-01-30 00:33:33,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:33,216 INFO L93 Difference]: Finished difference Result 887 states and 974 transitions. [2018-01-30 00:33:33,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 00:33:33,217 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-01-30 00:33:33,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:33,218 INFO L225 Difference]: With dead ends: 887 [2018-01-30 00:33:33,219 INFO L226 Difference]: Without dead ends: 588 [2018-01-30 00:33:33,219 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2018-01-30 00:33:33,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-01-30 00:33:33,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 393. [2018-01-30 00:33:33,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-01-30 00:33:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 433 transitions. [2018-01-30 00:33:33,236 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 433 transitions. Word has length 75 [2018-01-30 00:33:33,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:33,236 INFO L432 AbstractCegarLoop]: Abstraction has 393 states and 433 transitions. [2018-01-30 00:33:33,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:33:33,236 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 433 transitions. [2018-01-30 00:33:33,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-30 00:33:33,237 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:33,237 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:33,237 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:33,237 INFO L82 PathProgramCache]: Analyzing trace with hash 776683596, now seen corresponding path program 1 times [2018-01-30 00:33:33,237 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:33,237 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:33,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:33,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:33,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:33,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:33:33,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:33,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:33:33,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:33:33,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:33:33,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:33:33,268 INFO L87 Difference]: Start difference. First operand 393 states and 433 transitions. Second operand 3 states. [2018-01-30 00:33:33,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:33,317 INFO L93 Difference]: Finished difference Result 823 states and 923 transitions. [2018-01-30 00:33:33,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:33:33,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-01-30 00:33:33,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:33,319 INFO L225 Difference]: With dead ends: 823 [2018-01-30 00:33:33,319 INFO L226 Difference]: Without dead ends: 611 [2018-01-30 00:33:33,320 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:33:33,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-01-30 00:33:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 464. [2018-01-30 00:33:33,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-01-30 00:33:33,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 519 transitions. [2018-01-30 00:33:33,339 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 519 transitions. Word has length 77 [2018-01-30 00:33:33,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:33,339 INFO L432 AbstractCegarLoop]: Abstraction has 464 states and 519 transitions. [2018-01-30 00:33:33,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:33:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 519 transitions. [2018-01-30 00:33:33,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-30 00:33:33,340 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:33,340 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:33,340 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:33,340 INFO L82 PathProgramCache]: Analyzing trace with hash -769885204, now seen corresponding path program 1 times [2018-01-30 00:33:33,340 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:33,340 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:33,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:33,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:33,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:33,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:33:33,414 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:33,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:33:33,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:33:33,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:33:33,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:33:33,415 INFO L87 Difference]: Start difference. First operand 464 states and 519 transitions. Second operand 6 states. [2018-01-30 00:33:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:33,515 INFO L93 Difference]: Finished difference Result 703 states and 796 transitions. [2018-01-30 00:33:33,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:33:33,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-01-30 00:33:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:33,517 INFO L225 Difference]: With dead ends: 703 [2018-01-30 00:33:33,517 INFO L226 Difference]: Without dead ends: 434 [2018-01-30 00:33:33,517 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:33:33,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-01-30 00:33:33,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 378. [2018-01-30 00:33:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-01-30 00:33:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 412 transitions. [2018-01-30 00:33:33,546 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 412 transitions. Word has length 77 [2018-01-30 00:33:33,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:33,546 INFO L432 AbstractCegarLoop]: Abstraction has 378 states and 412 transitions. [2018-01-30 00:33:33,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:33:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 412 transitions. [2018-01-30 00:33:33,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-30 00:33:33,547 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:33,547 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:33,548 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:33,548 INFO L82 PathProgramCache]: Analyzing trace with hash 499885585, now seen corresponding path program 1 times [2018-01-30 00:33:33,548 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:33,548 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:33,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:33,549 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:33,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:33,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 00:33:33,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:33,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 00:33:33,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:33:33,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:33:33,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:33:33,744 INFO L87 Difference]: Start difference. First operand 378 states and 412 transitions. Second operand 10 states. [2018-01-30 00:33:34,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:34,101 INFO L93 Difference]: Finished difference Result 572 states and 625 transitions. [2018-01-30 00:33:34,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 00:33:34,101 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2018-01-30 00:33:34,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:34,103 INFO L225 Difference]: With dead ends: 572 [2018-01-30 00:33:34,103 INFO L226 Difference]: Without dead ends: 571 [2018-01-30 00:33:34,103 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-01-30 00:33:34,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-01-30 00:33:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 379. [2018-01-30 00:33:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-01-30 00:33:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 413 transitions. [2018-01-30 00:33:34,124 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 413 transitions. Word has length 80 [2018-01-30 00:33:34,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:34,124 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 413 transitions. [2018-01-30 00:33:34,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:33:34,124 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 413 transitions. [2018-01-30 00:33:34,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-30 00:33:34,125 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:34,125 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:34,125 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:34,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1424772722, now seen corresponding path program 1 times [2018-01-30 00:33:34,125 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:34,125 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:34,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:34,126 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:34,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:34,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:34,215 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 00:33:34,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:33:34,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:33:34,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:33:34,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:33:34,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:33:34,216 INFO L87 Difference]: Start difference. First operand 379 states and 413 transitions. Second operand 5 states. [2018-01-30 00:33:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:34,308 INFO L93 Difference]: Finished difference Result 639 states and 703 transitions. [2018-01-30 00:33:34,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:33:34,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2018-01-30 00:33:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:34,309 INFO L225 Difference]: With dead ends: 639 [2018-01-30 00:33:34,310 INFO L226 Difference]: Without dead ends: 400 [2018-01-30 00:33:34,310 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:33:34,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-01-30 00:33:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 383. [2018-01-30 00:33:34,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-01-30 00:33:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 416 transitions. [2018-01-30 00:33:34,327 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 416 transitions. Word has length 84 [2018-01-30 00:33:34,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:34,327 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 416 transitions. [2018-01-30 00:33:34,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:33:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 416 transitions. [2018-01-30 00:33:34,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-30 00:33:34,328 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:34,328 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:34,328 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:34,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1392020685, now seen corresponding path program 1 times [2018-01-30 00:33:34,328 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:34,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:34,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:34,329 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:34,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:34,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:34,525 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:33:34,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:33:34,525 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:33:34,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:34,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:33:34,566 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:33:34,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:33:34,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-30 00:33:34,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:34,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:34,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-01-30 00:33:34,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:33:34,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:33:34,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:34,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:34,623 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:33:34,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-01-30 00:33:34,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:33:34,685 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 36 treesize of output 37 [2018-01-30 00:33:34,687 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:33:34,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:34,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:34,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:34,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-01-30 00:33:34,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-01-30 00:33:34,723 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:33:34,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-01-30 00:33:34,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:34,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:34,735 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:33:34,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 [2018-01-30 00:33:34,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 31 [2018-01-30 00:33:34,819 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:33:34,820 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 13 treesize of output 6 [2018-01-30 00:33:34,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:34,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-01-30 00:33:34,825 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:34,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:34,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:33:34,830 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:15 [2018-01-30 00:33:34,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:33:34,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:33:34,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2018-01-30 00:33:34,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-30 00:33:34,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-30 00:33:34,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-01-30 00:33:34,913 INFO L87 Difference]: Start difference. First operand 383 states and 416 transitions. Second operand 23 states. [2018-01-30 00:33:35,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:35,706 INFO L93 Difference]: Finished difference Result 593 states and 636 transitions. [2018-01-30 00:33:35,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-30 00:33:35,706 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2018-01-30 00:33:35,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:35,708 INFO L225 Difference]: With dead ends: 593 [2018-01-30 00:33:35,708 INFO L226 Difference]: Without dead ends: 592 [2018-01-30 00:33:35,709 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=886, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 00:33:35,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-01-30 00:33:35,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 459. [2018-01-30 00:33:35,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-01-30 00:33:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 502 transitions. [2018-01-30 00:33:35,731 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 502 transitions. Word has length 86 [2018-01-30 00:33:35,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:35,732 INFO L432 AbstractCegarLoop]: Abstraction has 459 states and 502 transitions. [2018-01-30 00:33:35,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-30 00:33:35,732 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 502 transitions. [2018-01-30 00:33:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-30 00:33:35,732 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:35,733 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:35,733 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:35,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1392020684, now seen corresponding path program 1 times [2018-01-30 00:33:35,733 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:35,733 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:35,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:35,734 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:35,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:35,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:35,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:33:35,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:33:35,945 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:33:35,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:35,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:33:35,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:33:35,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:35,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:33:36,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:33:36,005 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:33:36,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-01-30 00:33:36,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:33:36,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:33:36,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:33:36,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:33:36,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,039 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:33:36,039 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-01-30 00:33:36,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:33:36,089 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 36 treesize of output 37 [2018-01-30 00:33:36,091 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:33:36,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,106 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:33:36,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-01-30 00:33:36,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 00:33:36,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,115 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,122 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-01-30 00:33:36,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-01-30 00:33:36,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:33:36,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-01-30 00:33:36,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2018-01-30 00:33:36,175 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:33:36,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-01-30 00:33:36,176 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,184 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:33:36,193 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:73 [2018-01-30 00:33:36,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 51 [2018-01-30 00:33:36,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-01-30 00:33:36,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,315 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:33:36,315 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 13 treesize of output 6 [2018-01-30 00:33:36,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-01-30 00:33:36,333 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:33:36,333 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 13 treesize of output 6 [2018-01-30 00:33:36,334 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-30 00:33:36,339 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,340 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:33:36,344 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:87, output treesize:9 [2018-01-30 00:33:36,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:33:36,408 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:33:36,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-01-30 00:33:36,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 00:33:36,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 00:33:36,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-01-30 00:33:36,409 INFO L87 Difference]: Start difference. First operand 459 states and 502 transitions. Second operand 19 states. [2018-01-30 00:33:37,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:33:37,503 INFO L93 Difference]: Finished difference Result 618 states and 663 transitions. [2018-01-30 00:33:37,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-30 00:33:37,503 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2018-01-30 00:33:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:33:37,506 INFO L225 Difference]: With dead ends: 618 [2018-01-30 00:33:37,506 INFO L226 Difference]: Without dead ends: 616 [2018-01-30 00:33:37,506 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=917, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 00:33:37,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-01-30 00:33:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 488. [2018-01-30 00:33:37,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-01-30 00:33:37,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 536 transitions. [2018-01-30 00:33:37,546 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 536 transitions. Word has length 86 [2018-01-30 00:33:37,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:33:37,546 INFO L432 AbstractCegarLoop]: Abstraction has 488 states and 536 transitions. [2018-01-30 00:33:37,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 00:33:37,546 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 536 transitions. [2018-01-30 00:33:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-30 00:33:37,547 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:33:37,547 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, 1, 1, 1, 1, 1, 1, 1, 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:33:37,547 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:33:37,547 INFO L82 PathProgramCache]: Analyzing trace with hash 965526734, now seen corresponding path program 1 times [2018-01-30 00:33:37,547 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:33:37,547 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:33:37,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:37,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:33:37,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:33:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:33:37,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:33:37,810 ERROR L119 erpolLogProxyWrapper]: Could not assert interpolant [2018-01-30 00:33:37,811 ERROR L119 erpolLogProxyWrapper]: Interpolant 32 not inductive: (Check returned sat) [2018-01-30 00:33:37,812 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:33:37,816 INFO L168 Benchmark]: Toolchain (without parser) took 26162.90 ms. Allocated memory was 307.8 MB in the beginning and 785.4 MB in the end (delta: 477.6 MB). Free memory was 264.5 MB in the beginning and 465.3 MB in the end (delta: -200.8 MB). Peak memory consumption was 276.8 MB. Max. memory is 5.3 GB. [2018-01-30 00:33:37,818 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 307.8 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:33:37,818 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.40 ms. Allocated memory is still 307.8 MB. Free memory was 264.5 MB in the beginning and 250.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:33:37,818 INFO L168 Benchmark]: Boogie Preprocessor took 45.57 ms. Allocated memory is still 307.8 MB. Free memory was 250.5 MB in the beginning and 248.6 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:33:37,819 INFO L168 Benchmark]: RCFGBuilder took 730.88 ms. Allocated memory is still 307.8 MB. Free memory was 248.6 MB in the beginning and 201.1 MB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 5.3 GB. [2018-01-30 00:33:37,819 INFO L168 Benchmark]: TraceAbstraction took 25146.45 ms. Allocated memory was 307.8 MB in the beginning and 785.4 MB in the end (delta: 477.6 MB). Free memory was 199.2 MB in the beginning and 465.3 MB in the end (delta: -266.2 MB). Peak memory consumption was 211.5 MB. Max. memory is 5.3 GB. [2018-01-30 00:33:37,821 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 307.8 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 231.40 ms. Allocated memory is still 307.8 MB. Free memory was 264.5 MB in the beginning and 250.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.57 ms. Allocated memory is still 307.8 MB. Free memory was 250.5 MB in the beginning and 248.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 730.88 ms. Allocated memory is still 307.8 MB. Free memory was 248.6 MB in the beginning and 201.1 MB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 25146.45 ms. Allocated memory was 307.8 MB in the beginning and 785.4 MB in the end (delta: 477.6 MB). Free memory was 199.2 MB in the beginning and 465.3 MB in the end (delta: -266.2 MB). Peak memory consumption was 211.5 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/sll-01_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-33-37-829.csv Received shutdown request...