java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:23:43,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:23:43,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:23:43,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:23:43,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:23:43,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:23:43,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:23:43,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:23:43,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:23:43,035 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:23:43,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:23:43,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:23:43,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:23:43,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:23:43,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:23:43,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:23:43,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:23:43,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:23:43,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:23:43,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:23:43,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:23:43,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:23:43,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:23:43,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:23:43,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:23:43,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:23:43,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:23:43,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:23:43,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:23:43,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:23:43,055 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:23:43,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:23:43,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:23:43,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:23:43,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:23:43,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:23:43,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:23:43,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:23:43,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:23:43,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:23:43,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:23:43,061 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 10:23:43,077 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:23:43,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:23:43,078 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:23:43,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:23:43,079 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:23:43,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:23:43,079 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:23:43,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:23:43,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:23:43,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:23:43,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:23:43,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:23:43,080 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:23:43,081 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:23:43,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:23:43,081 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:23:43,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:23:43,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:23:43,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:23:43,082 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:23:43,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:23:43,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:23:43,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:23:43,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:23:43,083 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:23:43,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:23:43,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:23:43,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:23:43,084 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:23:43,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:23:43,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:23:43,132 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:23:43,133 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:23:43,134 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:23:43,134 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-08 10:23:43,214 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0db6cf5f/3a4c9576ad0a40e4a23d7ef86e3a0c85/FLAGdc2a89f1e [2019-09-08 10:23:43,991 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:23:43,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-08 10:23:44,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0db6cf5f/3a4c9576ad0a40e4a23d7ef86e3a0c85/FLAGdc2a89f1e [2019-09-08 10:23:44,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0db6cf5f/3a4c9576ad0a40e4a23d7ef86e3a0c85 [2019-09-08 10:23:44,543 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:23:44,544 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:23:44,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:23:44,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:23:44,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:23:44,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:23:44" (1/1) ... [2019-09-08 10:23:44,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e83ef61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:44, skipping insertion in model container [2019-09-08 10:23:44,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:23:44" (1/1) ... [2019-09-08 10:23:44,561 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:23:44,721 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:23:45,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:23:45,839 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:23:46,176 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:23:46,201 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:23:46,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:46 WrapperNode [2019-09-08 10:23:46,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:23:46,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:23:46,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:23:46,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:23:46,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:46" (1/1) ... [2019-09-08 10:23:46,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:46" (1/1) ... [2019-09-08 10:23:46,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:46" (1/1) ... [2019-09-08 10:23:46,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:46" (1/1) ... [2019-09-08 10:23:46,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:46" (1/1) ... [2019-09-08 10:23:46,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:46" (1/1) ... [2019-09-08 10:23:46,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:46" (1/1) ... [2019-09-08 10:23:46,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:23:46,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:23:46,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:23:46,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:23:46,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:46" (1/1) ... No working directory specified, using /storage/repos/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 [2019-09-08 10:23:46,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:23:46,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:23:46,527 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:23:46,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:23:46,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:23:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:23:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:23:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:23:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:23:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:23:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:23:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:23:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:23:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:23:46,534 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:23:46,535 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:23:46,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:23:46,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:23:50,585 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:23:50,585 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:23:50,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:23:50 BoogieIcfgContainer [2019-09-08 10:23:50,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:23:50,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:23:50,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:23:50,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:23:50,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:23:44" (1/3) ... [2019-09-08 10:23:50,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c73a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:23:50, skipping insertion in model container [2019-09-08 10:23:50,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:46" (2/3) ... [2019-09-08 10:23:50,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c73a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:23:50, skipping insertion in model container [2019-09-08 10:23:50,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:23:50" (3/3) ... [2019-09-08 10:23:50,596 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-08 10:23:50,606 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:23:50,616 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-09-08 10:23:50,635 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-09-08 10:23:50,672 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:23:50,673 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:23:50,673 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:23:50,673 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:23:50,673 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:23:50,673 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:23:50,673 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:23:50,673 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:23:50,674 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:23:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states. [2019-09-08 10:23:50,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:23:50,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:50,735 INFO L399 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] [2019-09-08 10:23:50,738 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:50,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:50,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1212138476, now seen corresponding path program 1 times [2019-09-08 10:23:50,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:50,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:50,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:50,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:50,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:23:51,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:51,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:23:51,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:23:51,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:23:51,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:23:51,422 INFO L87 Difference]: Start difference. First operand 1195 states. Second operand 6 states. [2019-09-08 10:23:53,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:53,482 INFO L93 Difference]: Finished difference Result 2390 states and 4093 transitions. [2019-09-08 10:23:53,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:23:53,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-08 10:23:53,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:53,513 INFO L225 Difference]: With dead ends: 2390 [2019-09-08 10:23:53,513 INFO L226 Difference]: Without dead ends: 1617 [2019-09-08 10:23:53,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:23:53,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-09-08 10:23:53,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1594. [2019-09-08 10:23:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1594 states. [2019-09-08 10:23:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2070 transitions. [2019-09-08 10:23:53,695 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2070 transitions. Word has length 56 [2019-09-08 10:23:53,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:53,696 INFO L475 AbstractCegarLoop]: Abstraction has 1594 states and 2070 transitions. [2019-09-08 10:23:53,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:23:53,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2070 transitions. [2019-09-08 10:23:53,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:23:53,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:53,705 INFO L399 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] [2019-09-08 10:23:53,705 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:53,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:53,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1633149148, now seen corresponding path program 1 times [2019-09-08 10:23:53,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:53,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:53,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:53,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:53,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:23:53,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:53,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:23:53,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:23:53,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:23:53,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:23:53,957 INFO L87 Difference]: Start difference. First operand 1594 states and 2070 transitions. Second operand 6 states. [2019-09-08 10:23:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:55,415 INFO L93 Difference]: Finished difference Result 3490 states and 4654 transitions. [2019-09-08 10:23:55,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:23:55,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-08 10:23:55,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:55,435 INFO L225 Difference]: With dead ends: 3490 [2019-09-08 10:23:55,435 INFO L226 Difference]: Without dead ends: 2530 [2019-09-08 10:23:55,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:23:55,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2019-09-08 10:23:55,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2514. [2019-09-08 10:23:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2514 states. [2019-09-08 10:23:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 3354 transitions. [2019-09-08 10:23:55,594 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 3354 transitions. Word has length 56 [2019-09-08 10:23:55,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:55,595 INFO L475 AbstractCegarLoop]: Abstraction has 2514 states and 3354 transitions. [2019-09-08 10:23:55,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:23:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 3354 transitions. [2019-09-08 10:23:55,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:23:55,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:55,602 INFO L399 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] [2019-09-08 10:23:55,602 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:55,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:55,603 INFO L82 PathProgramCache]: Analyzing trace with hash -755922083, now seen corresponding path program 1 times [2019-09-08 10:23:55,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:55,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:55,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:55,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:55,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:23:55,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:55,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:23:55,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:23:55,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:23:55,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:23:55,746 INFO L87 Difference]: Start difference. First operand 2514 states and 3354 transitions. Second operand 5 states. [2019-09-08 10:23:57,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:57,165 INFO L93 Difference]: Finished difference Result 5219 states and 7042 transitions. [2019-09-08 10:23:57,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:23:57,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-08 10:23:57,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:57,186 INFO L225 Difference]: With dead ends: 5219 [2019-09-08 10:23:57,186 INFO L226 Difference]: Without dead ends: 3904 [2019-09-08 10:23:57,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:23:57,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2019-09-08 10:23:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 3898. [2019-09-08 10:23:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-09-08 10:23:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5174 transitions. [2019-09-08 10:23:57,359 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5174 transitions. Word has length 56 [2019-09-08 10:23:57,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:57,360 INFO L475 AbstractCegarLoop]: Abstraction has 3898 states and 5174 transitions. [2019-09-08 10:23:57,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:23:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5174 transitions. [2019-09-08 10:23:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:23:57,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:57,365 INFO L399 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, 1] [2019-09-08 10:23:57,365 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:57,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:57,366 INFO L82 PathProgramCache]: Analyzing trace with hash -418972447, now seen corresponding path program 1 times [2019-09-08 10:23:57,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:57,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:57,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:57,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:57,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:23:57,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:57,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:23:57,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:23:57,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:23:57,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:23:57,584 INFO L87 Difference]: Start difference. First operand 3898 states and 5174 transitions. Second operand 8 states. [2019-09-08 10:24:00,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:00,144 INFO L93 Difference]: Finished difference Result 10195 states and 14698 transitions. [2019-09-08 10:24:00,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:24:00,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-09-08 10:24:00,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:00,186 INFO L225 Difference]: With dead ends: 10195 [2019-09-08 10:24:00,187 INFO L226 Difference]: Without dead ends: 8853 [2019-09-08 10:24:00,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:24:00,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8853 states. [2019-09-08 10:24:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8853 to 3898. [2019-09-08 10:24:00,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-09-08 10:24:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5173 transitions. [2019-09-08 10:24:00,484 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5173 transitions. Word has length 58 [2019-09-08 10:24:00,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:00,486 INFO L475 AbstractCegarLoop]: Abstraction has 3898 states and 5173 transitions. [2019-09-08 10:24:00,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:24:00,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5173 transitions. [2019-09-08 10:24:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:24:00,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:00,492 INFO L399 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, 1] [2019-09-08 10:24:00,492 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:00,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:00,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1952539007, now seen corresponding path program 1 times [2019-09-08 10:24:00,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:00,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:00,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:00,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:00,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:00,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:24:00,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:00,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:24:00,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:24:00,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:24:00,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:24:00,801 INFO L87 Difference]: Start difference. First operand 3898 states and 5173 transitions. Second operand 9 states. [2019-09-08 10:24:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:04,148 INFO L93 Difference]: Finished difference Result 9560 states and 13666 transitions. [2019-09-08 10:24:04,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:24:04,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-08 10:24:04,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:04,195 INFO L225 Difference]: With dead ends: 9560 [2019-09-08 10:24:04,195 INFO L226 Difference]: Without dead ends: 9554 [2019-09-08 10:24:04,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:24:04,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9554 states. [2019-09-08 10:24:04,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9554 to 3898. [2019-09-08 10:24:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-09-08 10:24:04,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5172 transitions. [2019-09-08 10:24:04,545 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5172 transitions. Word has length 58 [2019-09-08 10:24:04,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:04,546 INFO L475 AbstractCegarLoop]: Abstraction has 3898 states and 5172 transitions. [2019-09-08 10:24:04,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:24:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5172 transitions. [2019-09-08 10:24:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:24:04,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:04,550 INFO L399 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, 1] [2019-09-08 10:24:04,551 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:04,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:04,551 INFO L82 PathProgramCache]: Analyzing trace with hash -215970595, now seen corresponding path program 1 times [2019-09-08 10:24:04,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:04,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:04,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:04,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:04,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:24:04,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:04,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:24:04,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:24:04,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:24:04,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:24:04,771 INFO L87 Difference]: Start difference. First operand 3898 states and 5172 transitions. Second operand 9 states. [2019-09-08 10:24:08,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:08,466 INFO L93 Difference]: Finished difference Result 10341 states and 14551 transitions. [2019-09-08 10:24:08,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:24:08,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-08 10:24:08,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:08,488 INFO L225 Difference]: With dead ends: 10341 [2019-09-08 10:24:08,488 INFO L226 Difference]: Without dead ends: 9285 [2019-09-08 10:24:08,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:24:08,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9285 states. [2019-09-08 10:24:08,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9285 to 3898. [2019-09-08 10:24:08,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-09-08 10:24:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5171 transitions. [2019-09-08 10:24:08,776 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5171 transitions. Word has length 58 [2019-09-08 10:24:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:08,778 INFO L475 AbstractCegarLoop]: Abstraction has 3898 states and 5171 transitions. [2019-09-08 10:24:08,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:24:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5171 transitions. [2019-09-08 10:24:08,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:24:08,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:08,784 INFO L399 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, 1, 1] [2019-09-08 10:24:08,785 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:08,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:08,785 INFO L82 PathProgramCache]: Analyzing trace with hash 834918715, now seen corresponding path program 1 times [2019-09-08 10:24:08,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:08,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:08,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:08,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:08,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:24:08,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:08,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:24:08,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:24:08,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:24:08,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:24:08,907 INFO L87 Difference]: Start difference. First operand 3898 states and 5171 transitions. Second operand 3 states. [2019-09-08 10:24:09,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:09,331 INFO L93 Difference]: Finished difference Result 5770 states and 8000 transitions. [2019-09-08 10:24:09,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:24:09,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-08 10:24:09,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:09,344 INFO L225 Difference]: With dead ends: 5770 [2019-09-08 10:24:09,344 INFO L226 Difference]: Without dead ends: 4287 [2019-09-08 10:24:09,349 INFO L628 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 [2019-09-08 10:24:09,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4287 states. [2019-09-08 10:24:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4287 to 3971. [2019-09-08 10:24:09,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-09-08 10:24:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 5314 transitions. [2019-09-08 10:24:09,634 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 5314 transitions. Word has length 59 [2019-09-08 10:24:09,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:09,636 INFO L475 AbstractCegarLoop]: Abstraction has 3971 states and 5314 transitions. [2019-09-08 10:24:09,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:24:09,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 5314 transitions. [2019-09-08 10:24:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:24:09,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:09,640 INFO L399 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, 1, 1] [2019-09-08 10:24:09,641 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:09,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:09,641 INFO L82 PathProgramCache]: Analyzing trace with hash 132280932, now seen corresponding path program 1 times [2019-09-08 10:24:09,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:09,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:09,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:09,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:09,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:09,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:24:09,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:09,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:24:09,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:24:09,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:24:09,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:24:09,766 INFO L87 Difference]: Start difference. First operand 3971 states and 5314 transitions. Second operand 3 states. [2019-09-08 10:24:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:10,326 INFO L93 Difference]: Finished difference Result 6729 states and 9451 transitions. [2019-09-08 10:24:10,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:24:10,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-08 10:24:10,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:10,353 INFO L225 Difference]: With dead ends: 6729 [2019-09-08 10:24:10,353 INFO L226 Difference]: Without dead ends: 4943 [2019-09-08 10:24:10,360 INFO L628 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 [2019-09-08 10:24:10,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4943 states. [2019-09-08 10:24:10,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4943 to 4463. [2019-09-08 10:24:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4463 states. [2019-09-08 10:24:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4463 states to 4463 states and 6066 transitions. [2019-09-08 10:24:10,868 INFO L78 Accepts]: Start accepts. Automaton has 4463 states and 6066 transitions. Word has length 59 [2019-09-08 10:24:10,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:10,869 INFO L475 AbstractCegarLoop]: Abstraction has 4463 states and 6066 transitions. [2019-09-08 10:24:10,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:24:10,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4463 states and 6066 transitions. [2019-09-08 10:24:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:24:10,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:10,872 INFO L399 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, 1, 1] [2019-09-08 10:24:10,873 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:10,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:10,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1642469980, now seen corresponding path program 1 times [2019-09-08 10:24:10,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:10,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:10,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:10,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:10,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:24:10,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:10,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:24:10,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:24:10,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:24:10,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:24:10,970 INFO L87 Difference]: Start difference. First operand 4463 states and 6066 transitions. Second operand 3 states. [2019-09-08 10:24:11,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:11,467 INFO L93 Difference]: Finished difference Result 8919 states and 12582 transitions. [2019-09-08 10:24:11,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:24:11,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-08 10:24:11,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:11,482 INFO L225 Difference]: With dead ends: 8919 [2019-09-08 10:24:11,482 INFO L226 Difference]: Without dead ends: 5699 [2019-09-08 10:24:11,493 INFO L628 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 [2019-09-08 10:24:11,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5699 states. [2019-09-08 10:24:12,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5699 to 5697. [2019-09-08 10:24:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5697 states. [2019-09-08 10:24:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5697 states to 5697 states and 7848 transitions. [2019-09-08 10:24:12,100 INFO L78 Accepts]: Start accepts. Automaton has 5697 states and 7848 transitions. Word has length 59 [2019-09-08 10:24:12,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:12,100 INFO L475 AbstractCegarLoop]: Abstraction has 5697 states and 7848 transitions. [2019-09-08 10:24:12,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:24:12,100 INFO L276 IsEmpty]: Start isEmpty. Operand 5697 states and 7848 transitions. [2019-09-08 10:24:12,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:24:12,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:12,103 INFO L399 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, 1, 1, 1] [2019-09-08 10:24:12,103 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:12,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:12,104 INFO L82 PathProgramCache]: Analyzing trace with hash 11887072, now seen corresponding path program 1 times [2019-09-08 10:24:12,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:12,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:12,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:12,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:12,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:12,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:24:12,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:12,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:24:12,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:24:12,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:24:12,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:24:12,177 INFO L87 Difference]: Start difference. First operand 5697 states and 7848 transitions. Second operand 3 states. [2019-09-08 10:24:12,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:12,991 INFO L93 Difference]: Finished difference Result 13367 states and 18972 transitions. [2019-09-08 10:24:12,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:24:12,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:24:12,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:13,013 INFO L225 Difference]: With dead ends: 13367 [2019-09-08 10:24:13,014 INFO L226 Difference]: Without dead ends: 8543 [2019-09-08 10:24:13,027 INFO L628 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 [2019-09-08 10:24:13,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8543 states. [2019-09-08 10:24:13,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8543 to 6757. [2019-09-08 10:24:13,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6757 states. [2019-09-08 10:24:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6757 states to 6757 states and 9505 transitions. [2019-09-08 10:24:13,791 INFO L78 Accepts]: Start accepts. Automaton has 6757 states and 9505 transitions. Word has length 60 [2019-09-08 10:24:13,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:13,791 INFO L475 AbstractCegarLoop]: Abstraction has 6757 states and 9505 transitions. [2019-09-08 10:24:13,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:24:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 6757 states and 9505 transitions. [2019-09-08 10:24:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:24:13,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:13,793 INFO L399 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, 1, 1, 1] [2019-09-08 10:24:13,794 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:13,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:13,794 INFO L82 PathProgramCache]: Analyzing trace with hash -2065078364, now seen corresponding path program 1 times [2019-09-08 10:24:13,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:13,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:13,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:13,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:13,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:24:13,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:13,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:24:13,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:24:13,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:24:13,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:24:13,878 INFO L87 Difference]: Start difference. First operand 6757 states and 9505 transitions. Second operand 3 states. [2019-09-08 10:24:14,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:14,942 INFO L93 Difference]: Finished difference Result 17110 states and 24518 transitions. [2019-09-08 10:24:14,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:24:14,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:24:14,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:14,965 INFO L225 Difference]: With dead ends: 17110 [2019-09-08 10:24:14,965 INFO L226 Difference]: Without dead ends: 10944 [2019-09-08 10:24:14,978 INFO L628 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 [2019-09-08 10:24:14,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10944 states. [2019-09-08 10:24:15,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10944 to 8515. [2019-09-08 10:24:15,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8515 states. [2019-09-08 10:24:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8515 states to 8515 states and 12125 transitions. [2019-09-08 10:24:15,857 INFO L78 Accepts]: Start accepts. Automaton has 8515 states and 12125 transitions. Word has length 60 [2019-09-08 10:24:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:15,857 INFO L475 AbstractCegarLoop]: Abstraction has 8515 states and 12125 transitions. [2019-09-08 10:24:15,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:24:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 8515 states and 12125 transitions. [2019-09-08 10:24:15,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:24:15,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:15,859 INFO L399 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, 1, 1, 1] [2019-09-08 10:24:15,859 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:15,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:15,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1780702045, now seen corresponding path program 1 times [2019-09-08 10:24:15,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:15,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:15,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:15,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:15,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:24:16,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:16,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:24:16,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:24:16,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:24:16,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:24:16,455 INFO L87 Difference]: Start difference. First operand 8515 states and 12125 transitions. Second operand 12 states. [2019-09-08 10:24:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:20,330 INFO L93 Difference]: Finished difference Result 22324 states and 31957 transitions. [2019-09-08 10:24:20,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 10:24:20,331 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-09-08 10:24:20,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:20,362 INFO L225 Difference]: With dead ends: 22324 [2019-09-08 10:24:20,362 INFO L226 Difference]: Without dead ends: 22129 [2019-09-08 10:24:20,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 10:24:20,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22129 states. [2019-09-08 10:24:21,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22129 to 8514. [2019-09-08 10:24:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8514 states. [2019-09-08 10:24:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8514 states to 8514 states and 12123 transitions. [2019-09-08 10:24:21,421 INFO L78 Accepts]: Start accepts. Automaton has 8514 states and 12123 transitions. Word has length 60 [2019-09-08 10:24:21,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:21,421 INFO L475 AbstractCegarLoop]: Abstraction has 8514 states and 12123 transitions. [2019-09-08 10:24:21,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:24:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand 8514 states and 12123 transitions. [2019-09-08 10:24:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:24:21,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:21,426 INFO L399 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, 1, 1, 1, 1] [2019-09-08 10:24:21,427 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:21,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1604028375, now seen corresponding path program 1 times [2019-09-08 10:24:21,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:21,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:21,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:21,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:21,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:24:22,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:22,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 10:24:22,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:24:22,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:24:22,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:24:22,050 INFO L87 Difference]: Start difference. First operand 8514 states and 12123 transitions. Second operand 13 states. [2019-09-08 10:24:26,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:26,407 INFO L93 Difference]: Finished difference Result 13120 states and 18661 transitions. [2019-09-08 10:24:26,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 10:24:26,408 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-09-08 10:24:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:26,422 INFO L225 Difference]: With dead ends: 13120 [2019-09-08 10:24:26,423 INFO L226 Difference]: Without dead ends: 13116 [2019-09-08 10:24:26,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-09-08 10:24:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13116 states. [2019-09-08 10:24:27,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13116 to 8510. [2019-09-08 10:24:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8510 states. [2019-09-08 10:24:27,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8510 states to 8510 states and 12119 transitions. [2019-09-08 10:24:27,347 INFO L78 Accepts]: Start accepts. Automaton has 8510 states and 12119 transitions. Word has length 61 [2019-09-08 10:24:27,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:27,347 INFO L475 AbstractCegarLoop]: Abstraction has 8510 states and 12119 transitions. [2019-09-08 10:24:27,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:24:27,348 INFO L276 IsEmpty]: Start isEmpty. Operand 8510 states and 12119 transitions. [2019-09-08 10:24:27,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:24:27,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:27,349 INFO L399 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, 1, 1, 1, 1] [2019-09-08 10:24:27,349 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:27,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:27,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1495356554, now seen corresponding path program 1 times [2019-09-08 10:24:27,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:27,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:27,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:27,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:27,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:24:27,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:27,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 10:24:27,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 10:24:27,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 10:24:27,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-08 10:24:27,905 INFO L87 Difference]: Start difference. First operand 8510 states and 12119 transitions. Second operand 14 states. [2019-09-08 10:24:31,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:31,181 INFO L93 Difference]: Finished difference Result 11045 states and 15632 transitions. [2019-09-08 10:24:31,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 10:24:31,182 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2019-09-08 10:24:31,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:31,192 INFO L225 Difference]: With dead ends: 11045 [2019-09-08 10:24:31,192 INFO L226 Difference]: Without dead ends: 10787 [2019-09-08 10:24:31,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:24:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10787 states. [2019-09-08 10:24:32,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10787 to 8450. [2019-09-08 10:24:32,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8450 states. [2019-09-08 10:24:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8450 states to 8450 states and 12044 transitions. [2019-09-08 10:24:32,079 INFO L78 Accepts]: Start accepts. Automaton has 8450 states and 12044 transitions. Word has length 61 [2019-09-08 10:24:32,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:32,079 INFO L475 AbstractCegarLoop]: Abstraction has 8450 states and 12044 transitions. [2019-09-08 10:24:32,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 10:24:32,079 INFO L276 IsEmpty]: Start isEmpty. Operand 8450 states and 12044 transitions. [2019-09-08 10:24:32,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 10:24:32,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:32,081 INFO L399 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, 1, 1, 1, 1, 1] [2019-09-08 10:24:32,081 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:32,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:32,081 INFO L82 PathProgramCache]: Analyzing trace with hash 113151698, now seen corresponding path program 1 times [2019-09-08 10:24:32,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:32,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:32,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:32,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:32,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:24:32,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:32,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 10:24:32,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:24:32,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:24:32,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:24:32,486 INFO L87 Difference]: Start difference. First operand 8450 states and 12044 transitions. Second operand 11 states. [2019-09-08 10:24:36,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:36,540 INFO L93 Difference]: Finished difference Result 23489 states and 33692 transitions. [2019-09-08 10:24:36,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:24:36,541 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-09-08 10:24:36,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:36,564 INFO L225 Difference]: With dead ends: 23489 [2019-09-08 10:24:36,564 INFO L226 Difference]: Without dead ends: 23485 [2019-09-08 10:24:36,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:24:36,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23485 states. [2019-09-08 10:24:37,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23485 to 8446. [2019-09-08 10:24:37,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8446 states. [2019-09-08 10:24:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8446 states to 8446 states and 12040 transitions. [2019-09-08 10:24:37,577 INFO L78 Accepts]: Start accepts. Automaton has 8446 states and 12040 transitions. Word has length 62 [2019-09-08 10:24:37,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:37,578 INFO L475 AbstractCegarLoop]: Abstraction has 8446 states and 12040 transitions. [2019-09-08 10:24:37,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:24:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 8446 states and 12040 transitions. [2019-09-08 10:24:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 10:24:37,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:37,580 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:24:37,580 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:37,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:37,580 INFO L82 PathProgramCache]: Analyzing trace with hash -287029914, now seen corresponding path program 1 times [2019-09-08 10:24:37,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:37,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:37,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:37,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:37,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:24:37,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:37,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:24:37,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:24:37,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:24:37,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:24:37,700 INFO L87 Difference]: Start difference. First operand 8446 states and 12040 transitions. Second operand 6 states. [2019-09-08 10:24:42,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:42,420 INFO L93 Difference]: Finished difference Result 37826 states and 54196 transitions. [2019-09-08 10:24:42,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:24:42,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-09-08 10:24:42,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:42,454 INFO L225 Difference]: With dead ends: 37826 [2019-09-08 10:24:42,455 INFO L226 Difference]: Without dead ends: 30096 [2019-09-08 10:24:42,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:24:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30096 states. [2019-09-08 10:24:45,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30096 to 26340. [2019-09-08 10:24:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26340 states. [2019-09-08 10:24:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26340 states to 26340 states and 36839 transitions. [2019-09-08 10:24:45,872 INFO L78 Accepts]: Start accepts. Automaton has 26340 states and 36839 transitions. Word has length 65 [2019-09-08 10:24:45,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:45,872 INFO L475 AbstractCegarLoop]: Abstraction has 26340 states and 36839 transitions. [2019-09-08 10:24:45,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:24:45,872 INFO L276 IsEmpty]: Start isEmpty. Operand 26340 states and 36839 transitions. [2019-09-08 10:24:45,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:24:45,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:45,874 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:24:45,875 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:45,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:45,875 INFO L82 PathProgramCache]: Analyzing trace with hash -586005098, now seen corresponding path program 1 times [2019-09-08 10:24:45,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:45,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:45,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:45,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:45,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:24:45,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:45,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:24:45,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:24:45,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:24:45,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:24:45,999 INFO L87 Difference]: Start difference. First operand 26340 states and 36839 transitions. Second operand 5 states. [2019-09-08 10:24:49,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:49,020 INFO L93 Difference]: Finished difference Result 41393 states and 57892 transitions. [2019-09-08 10:24:49,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:24:49,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-08 10:24:49,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:49,039 INFO L225 Difference]: With dead ends: 41393 [2019-09-08 10:24:49,039 INFO L226 Difference]: Without dead ends: 15737 [2019-09-08 10:24:49,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:24:49,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15737 states. [2019-09-08 10:24:51,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15737 to 12568. [2019-09-08 10:24:51,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12568 states. [2019-09-08 10:24:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12568 states to 12568 states and 17213 transitions. [2019-09-08 10:24:51,293 INFO L78 Accepts]: Start accepts. Automaton has 12568 states and 17213 transitions. Word has length 66 [2019-09-08 10:24:51,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:51,293 INFO L475 AbstractCegarLoop]: Abstraction has 12568 states and 17213 transitions. [2019-09-08 10:24:51,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:24:51,293 INFO L276 IsEmpty]: Start isEmpty. Operand 12568 states and 17213 transitions. [2019-09-08 10:24:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:24:51,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:51,296 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:24:51,296 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:51,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:51,296 INFO L82 PathProgramCache]: Analyzing trace with hash -584887692, now seen corresponding path program 1 times [2019-09-08 10:24:51,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:51,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:51,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:51,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:51,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:24:51,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:51,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:24:51,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:24:51,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:24:51,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:24:51,413 INFO L87 Difference]: Start difference. First operand 12568 states and 17213 transitions. Second operand 6 states. [2019-09-08 10:24:56,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:56,185 INFO L93 Difference]: Finished difference Result 22436 states and 30450 transitions. [2019-09-08 10:24:56,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:24:56,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:24:56,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:56,210 INFO L225 Difference]: With dead ends: 22436 [2019-09-08 10:24:56,211 INFO L226 Difference]: Without dead ends: 22434 [2019-09-08 10:24:56,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:24:56,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22434 states. [2019-09-08 10:24:58,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22434 to 12976. [2019-09-08 10:24:58,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12976 states. [2019-09-08 10:24:58,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12976 states to 12976 states and 17530 transitions. [2019-09-08 10:24:58,552 INFO L78 Accepts]: Start accepts. Automaton has 12976 states and 17530 transitions. Word has length 70 [2019-09-08 10:24:58,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:58,553 INFO L475 AbstractCegarLoop]: Abstraction has 12976 states and 17530 transitions. [2019-09-08 10:24:58,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:24:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 12976 states and 17530 transitions. [2019-09-08 10:24:58,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:24:58,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:58,555 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:24:58,555 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:58,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:58,556 INFO L82 PathProgramCache]: Analyzing trace with hash -793759712, now seen corresponding path program 1 times [2019-09-08 10:24:58,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:58,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:58,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:58,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:58,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:24:58,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:58,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:24:58,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:24:58,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:24:58,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:24:58,631 INFO L87 Difference]: Start difference. First operand 12976 states and 17530 transitions. Second operand 3 states. [2019-09-08 10:25:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:25:02,792 INFO L93 Difference]: Finished difference Result 34537 states and 46792 transitions. [2019-09-08 10:25:02,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:25:02,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-08 10:25:02,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:25:02,819 INFO L225 Difference]: With dead ends: 34537 [2019-09-08 10:25:02,820 INFO L226 Difference]: Without dead ends: 22178 [2019-09-08 10:25:02,835 INFO L628 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 [2019-09-08 10:25:02,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22178 states. [2019-09-08 10:25:06,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22178 to 22176. [2019-09-08 10:25:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22176 states. [2019-09-08 10:25:06,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22176 states to 22176 states and 29726 transitions. [2019-09-08 10:25:06,952 INFO L78 Accepts]: Start accepts. Automaton has 22176 states and 29726 transitions. Word has length 71 [2019-09-08 10:25:06,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:25:06,952 INFO L475 AbstractCegarLoop]: Abstraction has 22176 states and 29726 transitions. [2019-09-08 10:25:06,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:25:06,952 INFO L276 IsEmpty]: Start isEmpty. Operand 22176 states and 29726 transitions. [2019-09-08 10:25:06,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:25:06,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:25:06,956 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:25:06,956 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:25:06,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:25:06,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1879683765, now seen corresponding path program 1 times [2019-09-08 10:25:06,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:25:06,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:25:06,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:25:06,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:25:06,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:25:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:25:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:25:07,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:25:07,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:25:07,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:25:07,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:25:07,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:25:07,037 INFO L87 Difference]: Start difference. First operand 22176 states and 29726 transitions. Second operand 5 states. [2019-09-08 10:25:16,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:25:16,706 INFO L93 Difference]: Finished difference Result 70206 states and 94681 transitions. [2019-09-08 10:25:16,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:25:16,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-08 10:25:16,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:25:16,760 INFO L225 Difference]: With dead ends: 70206 [2019-09-08 10:25:16,761 INFO L226 Difference]: Without dead ends: 48617 [2019-09-08 10:25:16,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:25:16,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48617 states. [2019-09-08 10:25:21,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48617 to 29368. [2019-09-08 10:25:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29368 states. [2019-09-08 10:25:21,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29368 states to 29368 states and 38726 transitions. [2019-09-08 10:25:21,621 INFO L78 Accepts]: Start accepts. Automaton has 29368 states and 38726 transitions. Word has length 75 [2019-09-08 10:25:21,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:25:21,621 INFO L475 AbstractCegarLoop]: Abstraction has 29368 states and 38726 transitions. [2019-09-08 10:25:21,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:25:21,621 INFO L276 IsEmpty]: Start isEmpty. Operand 29368 states and 38726 transitions. [2019-09-08 10:25:21,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:25:21,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:25:21,625 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:25:21,625 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:25:21,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:25:21,626 INFO L82 PathProgramCache]: Analyzing trace with hash 435599465, now seen corresponding path program 1 times [2019-09-08 10:25:21,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:25:21,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:25:21,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:25:21,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:25:21,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:25:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:25:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:25:21,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:25:21,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:25:21,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:25:21,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:25:21,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:25:21,720 INFO L87 Difference]: Start difference. First operand 29368 states and 38726 transitions. Second operand 5 states. [2019-09-08 10:25:37,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:25:37,016 INFO L93 Difference]: Finished difference Result 102152 states and 134248 transitions. [2019-09-08 10:25:37,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:25:37,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 10:25:37,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:25:37,110 INFO L225 Difference]: With dead ends: 102152 [2019-09-08 10:25:37,110 INFO L226 Difference]: Without dead ends: 73391 [2019-09-08 10:25:37,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:25:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73391 states. [2019-09-08 10:25:46,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73391 to 49927. [2019-09-08 10:25:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49927 states. [2019-09-08 10:25:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49927 states to 49927 states and 65280 transitions. [2019-09-08 10:25:46,156 INFO L78 Accepts]: Start accepts. Automaton has 49927 states and 65280 transitions. Word has length 81 [2019-09-08 10:25:46,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:25:46,156 INFO L475 AbstractCegarLoop]: Abstraction has 49927 states and 65280 transitions. [2019-09-08 10:25:46,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:25:46,156 INFO L276 IsEmpty]: Start isEmpty. Operand 49927 states and 65280 transitions. [2019-09-08 10:25:46,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:25:46,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:25:46,160 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:25:46,161 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:25:46,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:25:46,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1991987475, now seen corresponding path program 1 times [2019-09-08 10:25:46,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:25:46,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:25:46,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:25:46,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:25:46,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:25:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:25:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:25:46,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:25:46,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:25:46,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:25:46,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:25:46,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:25:46,241 INFO L87 Difference]: Start difference. First operand 49927 states and 65280 transitions. Second operand 3 states. [2019-09-08 10:26:03,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:26:03,209 INFO L93 Difference]: Finished difference Result 138314 states and 180443 transitions. [2019-09-08 10:26:03,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:26:03,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-08 10:26:03,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:26:03,320 INFO L225 Difference]: With dead ends: 138314 [2019-09-08 10:26:03,320 INFO L226 Difference]: Without dead ends: 88998 [2019-09-08 10:26:03,368 INFO L628 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 [2019-09-08 10:26:03,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88998 states. [2019-09-08 10:26:17,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88998 to 67002. [2019-09-08 10:26:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67002 states. [2019-09-08 10:26:17,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67002 states to 67002 states and 86073 transitions. [2019-09-08 10:26:17,486 INFO L78 Accepts]: Start accepts. Automaton has 67002 states and 86073 transitions. Word has length 83 [2019-09-08 10:26:17,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:26:17,487 INFO L475 AbstractCegarLoop]: Abstraction has 67002 states and 86073 transitions. [2019-09-08 10:26:17,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:26:17,487 INFO L276 IsEmpty]: Start isEmpty. Operand 67002 states and 86073 transitions. [2019-09-08 10:26:17,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 10:26:17,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:26:17,492 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:26:17,492 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:26:17,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:26:17,492 INFO L82 PathProgramCache]: Analyzing trace with hash -530585101, now seen corresponding path program 1 times [2019-09-08 10:26:17,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:26:17,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:26:17,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:17,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:26:17,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:26:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:26:17,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:26:17,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:26:17,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:26:17,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:26:17,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:26:17,581 INFO L87 Difference]: Start difference. First operand 67002 states and 86073 transitions. Second operand 3 states. [2019-09-08 10:26:34,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:26:34,174 INFO L93 Difference]: Finished difference Result 155873 states and 199732 transitions. [2019-09-08 10:26:34,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:26:34,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-08 10:26:34,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:26:34,293 INFO L225 Difference]: With dead ends: 155873 [2019-09-08 10:26:34,294 INFO L226 Difference]: Without dead ends: 89482 [2019-09-08 10:26:34,348 INFO L628 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 [2019-09-08 10:26:34,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89482 states. [2019-09-08 10:26:49,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89482 to 67569. [2019-09-08 10:26:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67569 states. [2019-09-08 10:26:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67569 states to 67569 states and 85027 transitions. [2019-09-08 10:26:49,710 INFO L78 Accepts]: Start accepts. Automaton has 67569 states and 85027 transitions. Word has length 86 [2019-09-08 10:26:49,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:26:49,710 INFO L475 AbstractCegarLoop]: Abstraction has 67569 states and 85027 transitions. [2019-09-08 10:26:49,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:26:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand 67569 states and 85027 transitions. [2019-09-08 10:26:49,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 10:26:49,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:26:49,714 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:26:49,715 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:26:49,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:26:49,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2116981400, now seen corresponding path program 1 times [2019-09-08 10:26:49,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:26:49,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:26:49,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:49,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:26:49,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:26:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:26:49,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:26:49,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:26:49,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:26:49,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:26:49,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:26:49,792 INFO L87 Difference]: Start difference. First operand 67569 states and 85027 transitions. Second operand 3 states. [2019-09-08 10:27:05,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:27:05,226 INFO L93 Difference]: Finished difference Result 146137 states and 183069 transitions. [2019-09-08 10:27:05,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:27:05,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-08 10:27:05,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:27:05,330 INFO L225 Difference]: With dead ends: 146137 [2019-09-08 10:27:05,330 INFO L226 Difference]: Without dead ends: 79131 [2019-09-08 10:27:05,384 INFO L628 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 [2019-09-08 10:27:05,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79131 states. [2019-09-08 10:27:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79131 to 75582. [2019-09-08 10:27:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75582 states. [2019-09-08 10:27:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75582 states to 75582 states and 93754 transitions. [2019-09-08 10:27:22,827 INFO L78 Accepts]: Start accepts. Automaton has 75582 states and 93754 transitions. Word has length 89 [2019-09-08 10:27:22,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:27:22,827 INFO L475 AbstractCegarLoop]: Abstraction has 75582 states and 93754 transitions. [2019-09-08 10:27:22,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:27:22,827 INFO L276 IsEmpty]: Start isEmpty. Operand 75582 states and 93754 transitions. [2019-09-08 10:27:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 10:27:22,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:27:22,835 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:27:22,835 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:27:22,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:27:22,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1675942405, now seen corresponding path program 1 times [2019-09-08 10:27:22,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:27:22,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:27:22,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:22,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:27:22,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:27:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 10:27:23,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:27:23,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:27:23,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:27:23,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:27:23,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:27:23,017 INFO L87 Difference]: Start difference. First operand 75582 states and 93754 transitions. Second operand 9 states. [2019-09-08 10:27:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:27:59,157 INFO L93 Difference]: Finished difference Result 176049 states and 218167 transitions. [2019-09-08 10:27:59,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 10:27:59,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-08 10:27:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:27:59,375 INFO L225 Difference]: With dead ends: 176049 [2019-09-08 10:27:59,376 INFO L226 Difference]: Without dead ends: 173009 [2019-09-08 10:27:59,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-09-08 10:27:59,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173009 states. [2019-09-08 10:28:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173009 to 75567. [2019-09-08 10:28:18,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75567 states. [2019-09-08 10:28:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75567 states to 75567 states and 93738 transitions. [2019-09-08 10:28:18,274 INFO L78 Accepts]: Start accepts. Automaton has 75567 states and 93738 transitions. Word has length 95 [2019-09-08 10:28:18,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:28:18,275 INFO L475 AbstractCegarLoop]: Abstraction has 75567 states and 93738 transitions. [2019-09-08 10:28:18,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:28:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand 75567 states and 93738 transitions. [2019-09-08 10:28:18,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 10:28:18,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:28:18,282 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:28:18,282 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:28:18,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:28:18,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1439804858, now seen corresponding path program 1 times [2019-09-08 10:28:18,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:28:18,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:28:18,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:18,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:28:18,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:28:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:28:18,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:28:18,427 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-08 10:28:18,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:28:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:28:18,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 2045 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 10:28:18,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:28:18,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:28:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:28:19,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 10:28:19,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2019-09-08 10:28:19,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:28:19,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:28:19,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:28:19,157 INFO L87 Difference]: Start difference. First operand 75567 states and 93738 transitions. Second operand 13 states. [2019-09-08 10:29:22,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:22,059 INFO L93 Difference]: Finished difference Result 312946 states and 389330 transitions. [2019-09-08 10:29:22,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 10:29:22,059 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2019-09-08 10:29:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:22,754 INFO L225 Difference]: With dead ends: 312946 [2019-09-08 10:29:22,754 INFO L226 Difference]: Without dead ends: 237927 [2019-09-08 10:29:22,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=663, Invalid=2417, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 10:29:23,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237927 states. [2019-09-08 10:30:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237927 to 141741. [2019-09-08 10:30:01,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141741 states. [2019-09-08 10:30:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141741 states to 141741 states and 176100 transitions. [2019-09-08 10:30:01,748 INFO L78 Accepts]: Start accepts. Automaton has 141741 states and 176100 transitions. Word has length 95 [2019-09-08 10:30:01,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:01,748 INFO L475 AbstractCegarLoop]: Abstraction has 141741 states and 176100 transitions. [2019-09-08 10:30:01,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:30:01,748 INFO L276 IsEmpty]: Start isEmpty. Operand 141741 states and 176100 transitions. [2019-09-08 10:30:01,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 10:30:01,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:01,776 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:30:01,776 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:01,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:01,777 INFO L82 PathProgramCache]: Analyzing trace with hash 106004821, now seen corresponding path program 1 times [2019-09-08 10:30:01,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:01,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:01,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:01,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:01,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:30:01,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:01,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:30:01,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:30:01,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:30:01,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:30:01,876 INFO L87 Difference]: Start difference. First operand 141741 states and 176100 transitions. Second operand 5 states. [2019-09-08 10:30:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:42,075 INFO L93 Difference]: Finished difference Result 299469 states and 371046 transitions. [2019-09-08 10:30:42,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:30:42,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 10:30:42,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:42,348 INFO L225 Difference]: With dead ends: 299469 [2019-09-08 10:30:42,348 INFO L226 Difference]: Without dead ends: 159565 [2019-09-08 10:30:42,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:30:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-09-08 10:31:16,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 128788. [2019-09-08 10:31:16,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128788 states. [2019-09-08 10:31:17,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128788 states to 128788 states and 157148 transitions. [2019-09-08 10:31:17,126 INFO L78 Accepts]: Start accepts. Automaton has 128788 states and 157148 transitions. Word has length 99 [2019-09-08 10:31:17,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:31:17,126 INFO L475 AbstractCegarLoop]: Abstraction has 128788 states and 157148 transitions. [2019-09-08 10:31:17,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:31:17,126 INFO L276 IsEmpty]: Start isEmpty. Operand 128788 states and 157148 transitions. [2019-09-08 10:31:17,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 10:31:17,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:31:17,136 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:31:17,137 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:31:17,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:31:17,137 INFO L82 PathProgramCache]: Analyzing trace with hash -291839216, now seen corresponding path program 1 times [2019-09-08 10:31:17,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:31:17,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:31:17,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:17,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:31:17,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:31:17,256 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 10:31:17,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:31:17,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:31:17,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:31:17,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:31:17,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:31:17,257 INFO L87 Difference]: Start difference. First operand 128788 states and 157148 transitions. Second operand 3 states. [2019-09-08 10:31:50,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:31:50,746 INFO L93 Difference]: Finished difference Result 176120 states and 214529 transitions. [2019-09-08 10:31:50,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:31:50,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 10:31:50,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:31:50,887 INFO L225 Difference]: With dead ends: 176120 [2019-09-08 10:31:50,887 INFO L226 Difference]: Without dead ends: 126832 [2019-09-08 10:31:50,928 INFO L628 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 [2019-09-08 10:31:51,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126832 states. [2019-09-08 10:32:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126832 to 104140. [2019-09-08 10:32:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104140 states. [2019-09-08 10:32:18,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104140 states to 104140 states and 125380 transitions. [2019-09-08 10:32:18,471 INFO L78 Accepts]: Start accepts. Automaton has 104140 states and 125380 transitions. Word has length 99 [2019-09-08 10:32:18,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:18,471 INFO L475 AbstractCegarLoop]: Abstraction has 104140 states and 125380 transitions. [2019-09-08 10:32:18,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:32:18,471 INFO L276 IsEmpty]: Start isEmpty. Operand 104140 states and 125380 transitions. [2019-09-08 10:32:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 10:32:18,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:18,481 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:32:18,481 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:18,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:18,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1348348173, now seen corresponding path program 1 times [2019-09-08 10:32:18,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:18,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:18,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:18,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:18,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 10:32:18,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:18,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:32:18,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:32:18,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:32:18,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:32:18,564 INFO L87 Difference]: Start difference. First operand 104140 states and 125380 transitions. Second operand 3 states. [2019-09-08 10:32:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:45,821 INFO L93 Difference]: Finished difference Result 148928 states and 179212 transitions. [2019-09-08 10:32:45,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:32:45,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-08 10:32:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:45,949 INFO L225 Difference]: With dead ends: 148928 [2019-09-08 10:32:45,950 INFO L226 Difference]: Without dead ends: 104142 [2019-09-08 10:32:45,992 INFO L628 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 [2019-09-08 10:32:46,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104142 states. [2019-09-08 10:33:12,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104142 to 76623. [2019-09-08 10:33:12,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76623 states. [2019-09-08 10:33:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76623 states to 76623 states and 91718 transitions. [2019-09-08 10:33:12,438 INFO L78 Accepts]: Start accepts. Automaton has 76623 states and 91718 transitions. Word has length 101 [2019-09-08 10:33:12,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:33:12,439 INFO L475 AbstractCegarLoop]: Abstraction has 76623 states and 91718 transitions. [2019-09-08 10:33:12,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:33:12,439 INFO L276 IsEmpty]: Start isEmpty. Operand 76623 states and 91718 transitions. [2019-09-08 10:33:12,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 10:33:12,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:33:12,446 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:33:12,446 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:33:12,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:33:12,446 INFO L82 PathProgramCache]: Analyzing trace with hash 170954536, now seen corresponding path program 1 times [2019-09-08 10:33:12,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:33:12,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:33:12,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:12,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:33:12,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:33:12,569 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:33:12,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:33:12,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:33:12,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:33:12,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:33:12,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:33:12,571 INFO L87 Difference]: Start difference. First operand 76623 states and 91718 transitions. Second operand 5 states. [2019-09-08 10:33:50,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:33:50,198 INFO L93 Difference]: Finished difference Result 159929 states and 191826 transitions. [2019-09-08 10:33:50,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:33:50,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-08 10:33:50,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:33:50,344 INFO L225 Difference]: With dead ends: 159929 [2019-09-08 10:33:50,345 INFO L226 Difference]: Without dead ends: 122120 [2019-09-08 10:33:50,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:33:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122120 states. [2019-09-08 10:34:20,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122120 to 101546. [2019-09-08 10:34:20,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101546 states. [2019-09-08 10:34:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101546 states to 101546 states and 121365 transitions. [2019-09-08 10:34:20,865 INFO L78 Accepts]: Start accepts. Automaton has 101546 states and 121365 transitions. Word has length 104 [2019-09-08 10:34:20,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:20,866 INFO L475 AbstractCegarLoop]: Abstraction has 101546 states and 121365 transitions. [2019-09-08 10:34:20,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:34:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 101546 states and 121365 transitions. [2019-09-08 10:34:20,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 10:34:20,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:20,872 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:34:20,873 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:20,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:20,873 INFO L82 PathProgramCache]: Analyzing trace with hash -240157060, now seen corresponding path program 1 times [2019-09-08 10:34:20,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:20,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:20,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:20,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:20,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:21,040 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 10:34:21,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:21,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:34:21,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:34:21,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:34:21,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:34:21,042 INFO L87 Difference]: Start difference. First operand 101546 states and 121365 transitions. Second operand 5 states. [2019-09-08 10:35:04,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:04,372 INFO L93 Difference]: Finished difference Result 152533 states and 182931 transitions. [2019-09-08 10:35:04,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:35:04,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-08 10:35:04,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:04,525 INFO L225 Difference]: With dead ends: 152533 [2019-09-08 10:35:04,525 INFO L226 Difference]: Without dead ends: 131755 [2019-09-08 10:35:04,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:35:04,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131755 states. [2019-09-08 10:35:40,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131755 to 114942. [2019-09-08 10:35:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114942 states. [2019-09-08 10:35:40,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114942 states to 114942 states and 137352 transitions. [2019-09-08 10:35:40,233 INFO L78 Accepts]: Start accepts. Automaton has 114942 states and 137352 transitions. Word has length 104 [2019-09-08 10:35:40,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:40,233 INFO L475 AbstractCegarLoop]: Abstraction has 114942 states and 137352 transitions. [2019-09-08 10:35:40,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:35:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 114942 states and 137352 transitions. [2019-09-08 10:35:40,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 10:35:40,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:40,243 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:35:40,243 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:40,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:40,244 INFO L82 PathProgramCache]: Analyzing trace with hash 812250873, now seen corresponding path program 1 times [2019-09-08 10:35:40,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:40,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:40,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:40,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:40,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:40,513 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:35:40,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:35:40,513 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-08 10:35:40,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:35:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:40,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 2076 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 10:35:40,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:35:41,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:35:41,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:35:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:35:41,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:35:41,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2019-09-08 10:35:41,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 10:35:41,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 10:35:41,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:35:41,985 INFO L87 Difference]: Start difference. First operand 114942 states and 137352 transitions. Second operand 18 states. [2019-09-08 10:35:42,189 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-08 10:35:42,384 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-08 10:35:42,520 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-08 10:35:42,690 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-08 10:35:49,176 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-08 10:35:50,618 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 10:35:52,132 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 10:35:54,314 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 10:35:55,038 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 10:35:55,461 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 10:35:56,615 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-08 10:35:57,352 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-08 10:35:57,755 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 10:35:58,240 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 10:35:58,938 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-08 10:35:59,725 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-08 10:36:00,349 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 10:36:01,079 WARN L188 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-08 10:36:01,523 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 10:36:02,816 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-08 10:36:03,558 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 10:36:04,054 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 10:36:04,669 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 10:36:05,111 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-08 10:36:07,528 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-08 10:36:07,923 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-08 10:36:13,456 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-08 10:36:14,880 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 10:36:15,712 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-08 10:36:16,641 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 10:36:16,990 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 10:36:17,426 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-08 10:36:18,095 WARN L188 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-08 10:36:19,815 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-08 10:36:20,865 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-08 10:36:21,461 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 10:36:21,929 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 10:36:22,473 WARN L188 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 10:36:23,037 WARN L188 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-08 10:36:25,192 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-08 10:36:25,509 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-08 10:36:25,991 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-08 10:36:28,166 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-08 10:36:28,584 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 10:36:29,104 WARN L188 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 10:36:29,483 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-08 10:36:45,357 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62