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.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:25:55,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:25:55,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:25:55,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:25:55,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:25:55,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:25:55,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:25:55,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:25:55,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:25:55,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:25:55,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:25:55,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:25:55,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:25:55,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:25:55,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:25:55,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:25:55,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:25:55,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:25:55,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:25:55,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:25:55,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:25:55,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:25:55,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:25:55,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:25:55,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:25:55,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:25:55,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:25:55,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:25:55,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:25:55,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:25:55,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:25:55,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:25:55,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:25:55,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:25:55,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:25:55,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:25:55,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:25:55,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:25:55,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:25:55,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:25:55,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:25:55,661 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 12:25:55,675 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:25:55,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:25:55,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:25:55,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:25:55,677 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:25:55,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:25:55,677 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:25:55,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:25:55,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:25:55,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:25:55,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:25:55,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:25:55,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:25:55,679 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:25:55,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:25:55,679 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:25:55,679 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:25:55,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:25:55,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:25:55,680 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:25:55,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:25:55,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:25:55,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:25:55,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:25:55,681 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:25:55,681 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:25:55,681 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:25:55,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:25:55,682 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:25:55,729 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:25:55,744 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:25:55,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:25:55,749 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:25:55,750 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:25:55,750 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-08 12:25:55,820 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db8ff785c/98261fc379bd449684c2e8b3859b4e62/FLAG66afedbca [2019-09-08 12:25:56,329 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:25:56,330 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-08 12:25:56,348 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db8ff785c/98261fc379bd449684c2e8b3859b4e62/FLAG66afedbca [2019-09-08 12:25:56,670 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db8ff785c/98261fc379bd449684c2e8b3859b4e62 [2019-09-08 12:25:56,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:25:56,681 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:25:56,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:25:56,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:25:56,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:25:56,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:25:56" (1/1) ... [2019-09-08 12:25:56,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1332b692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:25:56, skipping insertion in model container [2019-09-08 12:25:56,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:25:56" (1/1) ... [2019-09-08 12:25:56,696 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:25:56,756 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:25:57,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:25:57,156 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:25:57,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:25:57,257 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:25:57,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:25:57 WrapperNode [2019-09-08 12:25:57,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:25:57,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:25:57,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:25:57,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:25:57,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:25:57" (1/1) ... [2019-09-08 12:25:57,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:25:57" (1/1) ... [2019-09-08 12:25:57,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:25:57" (1/1) ... [2019-09-08 12:25:57,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:25:57" (1/1) ... [2019-09-08 12:25:57,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:25:57" (1/1) ... [2019-09-08 12:25:57,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:25:57" (1/1) ... [2019-09-08 12:25:57,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:25:57" (1/1) ... [2019-09-08 12:25:57,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:25:57,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:25:57,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:25:57,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:25:57,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:25:57" (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 12:25:57,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:25:57,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:25:57,371 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:25:57,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:25:57,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:25:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:25:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:25:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:25:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:25:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:25:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:25:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:25:57,373 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:25:57,373 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:25:57,373 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:25:57,373 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:25:57,373 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:25:57,373 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:25:57,374 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:25:57,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:25:57,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:25:58,078 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:25:58,079 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:25:58,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:25:58 BoogieIcfgContainer [2019-09-08 12:25:58,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:25:58,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:25:58,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:25:58,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:25:58,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:25:56" (1/3) ... [2019-09-08 12:25:58,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f561864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:25:58, skipping insertion in model container [2019-09-08 12:25:58,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:25:57" (2/3) ... [2019-09-08 12:25:58,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f561864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:25:58, skipping insertion in model container [2019-09-08 12:25:58,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:25:58" (3/3) ... [2019-09-08 12:25:58,092 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-08 12:25:58,102 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:25:58,110 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:25:58,126 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:25:58,155 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:25:58,156 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:25:58,156 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:25:58,156 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:25:58,156 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:25:58,156 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:25:58,156 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:25:58,157 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:25:58,157 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:25:58,175 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2019-09-08 12:25:58,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 12:25:58,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:58,185 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] [2019-09-08 12:25:58,187 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:58,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:58,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1596383191, now seen corresponding path program 1 times [2019-09-08 12:25:58,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:58,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:58,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:58,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:58,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:58,683 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 12:25:58,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:58,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:25:58,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:25:58,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:25:58,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:25:58,708 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 3 states. [2019-09-08 12:25:58,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:58,801 INFO L93 Difference]: Finished difference Result 261 states and 423 transitions. [2019-09-08 12:25:58,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:25:58,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 12:25:58,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:58,826 INFO L225 Difference]: With dead ends: 261 [2019-09-08 12:25:58,827 INFO L226 Difference]: Without dead ends: 179 [2019-09-08 12:25:58,834 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 12:25:58,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-08 12:25:58,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-09-08 12:25:58,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-08 12:25:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 254 transitions. [2019-09-08 12:25:58,925 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 254 transitions. Word has length 76 [2019-09-08 12:25:58,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:58,926 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 254 transitions. [2019-09-08 12:25:58,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:25:58,926 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 254 transitions. [2019-09-08 12:25:58,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:25:58,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:58,932 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] [2019-09-08 12:25:58,932 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:58,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:58,932 INFO L82 PathProgramCache]: Analyzing trace with hash 959202196, now seen corresponding path program 1 times [2019-09-08 12:25:58,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:58,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:58,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:58,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:58,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:59,100 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 12:25:59,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:59,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:25:59,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:25:59,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:25:59,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:25:59,104 INFO L87 Difference]: Start difference. First operand 177 states and 254 transitions. Second operand 3 states. [2019-09-08 12:25:59,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:59,168 INFO L93 Difference]: Finished difference Result 421 states and 642 transitions. [2019-09-08 12:25:59,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:25:59,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 12:25:59,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:59,172 INFO L225 Difference]: With dead ends: 421 [2019-09-08 12:25:59,172 INFO L226 Difference]: Without dead ends: 291 [2019-09-08 12:25:59,174 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 12:25:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-08 12:25:59,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2019-09-08 12:25:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-08 12:25:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 432 transitions. [2019-09-08 12:25:59,206 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 432 transitions. Word has length 77 [2019-09-08 12:25:59,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:59,207 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 432 transitions. [2019-09-08 12:25:59,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:25:59,207 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 432 transitions. [2019-09-08 12:25:59,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 12:25:59,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:59,210 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] [2019-09-08 12:25:59,211 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:59,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:59,211 INFO L82 PathProgramCache]: Analyzing trace with hash -927003067, now seen corresponding path program 1 times [2019-09-08 12:25:59,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:59,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:59,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:59,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:59,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:59,381 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 12:25:59,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:59,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:25:59,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:25:59,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:25:59,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:25:59,384 INFO L87 Difference]: Start difference. First operand 289 states and 432 transitions. Second operand 3 states. [2019-09-08 12:25:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:59,459 INFO L93 Difference]: Finished difference Result 741 states and 1150 transitions. [2019-09-08 12:25:59,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:25:59,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 12:25:59,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:59,469 INFO L225 Difference]: With dead ends: 741 [2019-09-08 12:25:59,471 INFO L226 Difference]: Without dead ends: 499 [2019-09-08 12:25:59,473 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 12:25:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-08 12:25:59,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2019-09-08 12:25:59,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-09-08 12:25:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 760 transitions. [2019-09-08 12:25:59,538 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 760 transitions. Word has length 78 [2019-09-08 12:25:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:59,539 INFO L475 AbstractCegarLoop]: Abstraction has 497 states and 760 transitions. [2019-09-08 12:25:59,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:25:59,539 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 760 transitions. [2019-09-08 12:25:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 12:25:59,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:59,541 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] [2019-09-08 12:25:59,541 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:59,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:59,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1219899588, now seen corresponding path program 1 times [2019-09-08 12:25:59,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:59,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:59,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:59,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:59,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:59,623 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 12:25:59,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:59,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:25:59,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:25:59,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:25:59,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:25:59,625 INFO L87 Difference]: Start difference. First operand 497 states and 760 transitions. Second operand 3 states. [2019-09-08 12:25:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:59,674 INFO L93 Difference]: Finished difference Result 1333 states and 2082 transitions. [2019-09-08 12:25:59,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:25:59,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 12:25:59,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:59,680 INFO L225 Difference]: With dead ends: 1333 [2019-09-08 12:25:59,680 INFO L226 Difference]: Without dead ends: 883 [2019-09-08 12:25:59,683 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 12:25:59,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-09-08 12:25:59,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 881. [2019-09-08 12:25:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-09-08 12:25:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1360 transitions. [2019-09-08 12:25:59,735 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1360 transitions. Word has length 79 [2019-09-08 12:25:59,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:59,736 INFO L475 AbstractCegarLoop]: Abstraction has 881 states and 1360 transitions. [2019-09-08 12:25:59,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:25:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1360 transitions. [2019-09-08 12:25:59,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 12:25:59,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:59,738 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] [2019-09-08 12:25:59,739 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:59,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:59,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1078210598, now seen corresponding path program 1 times [2019-09-08 12:25:59,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:59,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:59,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:59,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:59,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:59,859 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 12:25:59,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:59,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:25:59,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:25:59,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:25:59,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:25:59,861 INFO L87 Difference]: Start difference. First operand 881 states and 1360 transitions. Second operand 3 states. [2019-09-08 12:25:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:59,938 INFO L93 Difference]: Finished difference Result 2421 states and 3778 transitions. [2019-09-08 12:25:59,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:25:59,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-08 12:25:59,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:59,949 INFO L225 Difference]: With dead ends: 2421 [2019-09-08 12:25:59,949 INFO L226 Difference]: Without dead ends: 1587 [2019-09-08 12:25:59,952 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 12:25:59,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2019-09-08 12:26:00,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1585. [2019-09-08 12:26:00,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2019-09-08 12:26:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2448 transitions. [2019-09-08 12:26:00,045 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2448 transitions. Word has length 80 [2019-09-08 12:26:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:00,047 INFO L475 AbstractCegarLoop]: Abstraction has 1585 states and 2448 transitions. [2019-09-08 12:26:00,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:26:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2448 transitions. [2019-09-08 12:26:00,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:26:00,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:00,055 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 12:26:00,056 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:00,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:00,056 INFO L82 PathProgramCache]: Analyzing trace with hash 847671569, now seen corresponding path program 1 times [2019-09-08 12:26:00,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:00,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:00,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:00,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:00,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:00,168 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 12:26:00,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:00,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:26:00,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:26:00,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:26:00,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:26:00,171 INFO L87 Difference]: Start difference. First operand 1585 states and 2448 transitions. Second operand 3 states. [2019-09-08 12:26:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:00,336 INFO L93 Difference]: Finished difference Result 4405 states and 6834 transitions. [2019-09-08 12:26:00,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:26:00,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 12:26:00,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:00,354 INFO L225 Difference]: With dead ends: 4405 [2019-09-08 12:26:00,355 INFO L226 Difference]: Without dead ends: 2867 [2019-09-08 12:26:00,359 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 12:26:00,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2019-09-08 12:26:00,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 2865. [2019-09-08 12:26:00,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2865 states. [2019-09-08 12:26:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4400 transitions. [2019-09-08 12:26:00,557 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4400 transitions. Word has length 81 [2019-09-08 12:26:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:00,558 INFO L475 AbstractCegarLoop]: Abstraction has 2865 states and 4400 transitions. [2019-09-08 12:26:00,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:26:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4400 transitions. [2019-09-08 12:26:00,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:26:00,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:00,561 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] [2019-09-08 12:26:00,561 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:00,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:00,561 INFO L82 PathProgramCache]: Analyzing trace with hash 12169119, now seen corresponding path program 1 times [2019-09-08 12:26:00,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:00,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:00,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:00,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:00,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:00,663 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 12:26:00,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:00,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:26:00,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:26:00,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:26:00,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:26:00,665 INFO L87 Difference]: Start difference. First operand 2865 states and 4400 transitions. Second operand 5 states. [2019-09-08 12:26:00,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:00,948 INFO L93 Difference]: Finished difference Result 5683 states and 8753 transitions. [2019-09-08 12:26:00,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:26:00,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 12:26:00,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:00,964 INFO L225 Difference]: With dead ends: 5683 [2019-09-08 12:26:00,964 INFO L226 Difference]: Without dead ends: 2865 [2019-09-08 12:26:00,970 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 12:26:00,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2019-09-08 12:26:01,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2865. [2019-09-08 12:26:01,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2865 states. [2019-09-08 12:26:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4368 transitions. [2019-09-08 12:26:01,177 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4368 transitions. Word has length 82 [2019-09-08 12:26:01,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:01,177 INFO L475 AbstractCegarLoop]: Abstraction has 2865 states and 4368 transitions. [2019-09-08 12:26:01,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:26:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4368 transitions. [2019-09-08 12:26:01,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:26:01,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:01,179 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] [2019-09-08 12:26:01,179 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:01,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:01,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1733499994, now seen corresponding path program 1 times [2019-09-08 12:26:01,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:01,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:01,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:01,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:01,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:01,275 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 12:26:01,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:01,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:26:01,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:26:01,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:26:01,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:26:01,277 INFO L87 Difference]: Start difference. First operand 2865 states and 4368 transitions. Second operand 5 states. [2019-09-08 12:26:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:01,659 INFO L93 Difference]: Finished difference Result 5683 states and 8689 transitions. [2019-09-08 12:26:01,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:26:01,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 12:26:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:01,679 INFO L225 Difference]: With dead ends: 5683 [2019-09-08 12:26:01,680 INFO L226 Difference]: Without dead ends: 2865 [2019-09-08 12:26:01,688 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 12:26:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2019-09-08 12:26:01,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2865. [2019-09-08 12:26:01,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2865 states. [2019-09-08 12:26:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4336 transitions. [2019-09-08 12:26:01,972 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4336 transitions. Word has length 82 [2019-09-08 12:26:01,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:01,973 INFO L475 AbstractCegarLoop]: Abstraction has 2865 states and 4336 transitions. [2019-09-08 12:26:01,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:26:01,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4336 transitions. [2019-09-08 12:26:01,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:26:01,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:01,974 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] [2019-09-08 12:26:01,974 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:01,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:01,975 INFO L82 PathProgramCache]: Analyzing trace with hash 286470399, now seen corresponding path program 1 times [2019-09-08 12:26:01,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:01,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:01,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:01,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:01,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:02,089 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 12:26:02,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:02,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:26:02,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:26:02,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:26:02,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:26:02,091 INFO L87 Difference]: Start difference. First operand 2865 states and 4336 transitions. Second operand 5 states. [2019-09-08 12:26:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:02,401 INFO L93 Difference]: Finished difference Result 5683 states and 8625 transitions. [2019-09-08 12:26:02,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:26:02,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 12:26:02,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:02,418 INFO L225 Difference]: With dead ends: 5683 [2019-09-08 12:26:02,418 INFO L226 Difference]: Without dead ends: 2865 [2019-09-08 12:26:02,424 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 12:26:02,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2019-09-08 12:26:02,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2865. [2019-09-08 12:26:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2865 states. [2019-09-08 12:26:02,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4304 transitions. [2019-09-08 12:26:02,600 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4304 transitions. Word has length 82 [2019-09-08 12:26:02,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:02,601 INFO L475 AbstractCegarLoop]: Abstraction has 2865 states and 4304 transitions. [2019-09-08 12:26:02,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:26:02,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4304 transitions. [2019-09-08 12:26:02,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:26:02,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:02,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, 1, 1, 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 12:26:02,602 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:02,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:02,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1555560134, now seen corresponding path program 1 times [2019-09-08 12:26:02,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:02,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:02,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:02,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:02,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:02,690 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 12:26:02,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:02,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:26:02,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:26:02,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:26:02,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:26:02,692 INFO L87 Difference]: Start difference. First operand 2865 states and 4304 transitions. Second operand 5 states. [2019-09-08 12:26:02,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:02,967 INFO L93 Difference]: Finished difference Result 5683 states and 8561 transitions. [2019-09-08 12:26:02,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:26:02,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 12:26:02,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:02,981 INFO L225 Difference]: With dead ends: 5683 [2019-09-08 12:26:02,982 INFO L226 Difference]: Without dead ends: 2865 [2019-09-08 12:26:02,987 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 12:26:02,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2019-09-08 12:26:03,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2865. [2019-09-08 12:26:03,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2865 states. [2019-09-08 12:26:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4272 transitions. [2019-09-08 12:26:03,163 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4272 transitions. Word has length 82 [2019-09-08 12:26:03,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:03,163 INFO L475 AbstractCegarLoop]: Abstraction has 2865 states and 4272 transitions. [2019-09-08 12:26:03,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:26:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4272 transitions. [2019-09-08 12:26:03,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:26:03,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:03,165 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] [2019-09-08 12:26:03,165 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:03,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:03,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1275335605, now seen corresponding path program 1 times [2019-09-08 12:26:03,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:03,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:03,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:03,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:03,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:03,253 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 12:26:03,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:03,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:26:03,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:26:03,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:26:03,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:26:03,255 INFO L87 Difference]: Start difference. First operand 2865 states and 4272 transitions. Second operand 5 states. [2019-09-08 12:26:03,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:03,531 INFO L93 Difference]: Finished difference Result 5683 states and 8497 transitions. [2019-09-08 12:26:03,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:26:03,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 12:26:03,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:03,547 INFO L225 Difference]: With dead ends: 5683 [2019-09-08 12:26:03,548 INFO L226 Difference]: Without dead ends: 2865 [2019-09-08 12:26:03,554 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 12:26:03,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2019-09-08 12:26:03,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2865. [2019-09-08 12:26:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2865 states. [2019-09-08 12:26:03,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4240 transitions. [2019-09-08 12:26:03,809 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4240 transitions. Word has length 82 [2019-09-08 12:26:03,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:03,810 INFO L475 AbstractCegarLoop]: Abstraction has 2865 states and 4240 transitions. [2019-09-08 12:26:03,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:26:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4240 transitions. [2019-09-08 12:26:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:26:03,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:03,811 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] [2019-09-08 12:26:03,811 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:03,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:03,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1745763686, now seen corresponding path program 1 times [2019-09-08 12:26:03,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:03,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:03,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:03,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:03,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:04,002 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 12:26:04,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:04,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:26:04,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:26:04,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:26:04,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:26:04,004 INFO L87 Difference]: Start difference. First operand 2865 states and 4240 transitions. Second operand 8 states. [2019-09-08 12:26:05,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:05,833 INFO L93 Difference]: Finished difference Result 31045 states and 46170 transitions. [2019-09-08 12:26:05,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:26:05,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-09-08 12:26:05,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:05,920 INFO L225 Difference]: With dead ends: 31045 [2019-09-08 12:26:05,921 INFO L226 Difference]: Without dead ends: 28227 [2019-09-08 12:26:05,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:26:05,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28227 states. [2019-09-08 12:26:06,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28227 to 8497. [2019-09-08 12:26:06,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8497 states. [2019-09-08 12:26:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8497 states to 8497 states and 12496 transitions. [2019-09-08 12:26:06,842 INFO L78 Accepts]: Start accepts. Automaton has 8497 states and 12496 transitions. Word has length 82 [2019-09-08 12:26:06,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:06,842 INFO L475 AbstractCegarLoop]: Abstraction has 8497 states and 12496 transitions. [2019-09-08 12:26:06,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:26:06,843 INFO L276 IsEmpty]: Start isEmpty. Operand 8497 states and 12496 transitions. [2019-09-08 12:26:06,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:26:06,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:06,844 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] [2019-09-08 12:26:06,844 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:06,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:06,845 INFO L82 PathProgramCache]: Analyzing trace with hash 760119925, now seen corresponding path program 1 times [2019-09-08 12:26:06,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:06,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:06,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:06,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:06,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:06,927 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 12:26:06,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:06,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:26:06,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:26:06,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:26:06,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:26:06,929 INFO L87 Difference]: Start difference. First operand 8497 states and 12496 transitions. Second operand 3 states. [2019-09-08 12:26:07,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:07,967 INFO L93 Difference]: Finished difference Result 21047 states and 30900 transitions. [2019-09-08 12:26:07,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:26:07,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-08 12:26:07,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:07,995 INFO L225 Difference]: With dead ends: 21047 [2019-09-08 12:26:07,995 INFO L226 Difference]: Without dead ends: 12597 [2019-09-08 12:26:08,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 12:26:08,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12597 states. [2019-09-08 12:26:09,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12597 to 12595. [2019-09-08 12:26:09,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12595 states. [2019-09-08 12:26:09,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12595 states to 12595 states and 18290 transitions. [2019-09-08 12:26:09,159 INFO L78 Accepts]: Start accepts. Automaton has 12595 states and 18290 transitions. Word has length 84 [2019-09-08 12:26:09,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:09,160 INFO L475 AbstractCegarLoop]: Abstraction has 12595 states and 18290 transitions. [2019-09-08 12:26:09,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:26:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 12595 states and 18290 transitions. [2019-09-08 12:26:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:26:09,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:09,161 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] [2019-09-08 12:26:09,161 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:09,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:09,162 INFO L82 PathProgramCache]: Analyzing trace with hash 780169268, now seen corresponding path program 1 times [2019-09-08 12:26:09,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:09,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:09,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:09,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:09,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:09,448 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 12:26:09,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:09,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:26:09,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:26:09,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:26:09,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:26:09,451 INFO L87 Difference]: Start difference. First operand 12595 states and 18290 transitions. Second operand 8 states. [2019-09-08 12:26:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:10,623 INFO L93 Difference]: Finished difference Result 27963 states and 40726 transitions. [2019-09-08 12:26:10,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:26:10,624 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-09-08 12:26:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:10,659 INFO L225 Difference]: With dead ends: 27963 [2019-09-08 12:26:10,660 INFO L226 Difference]: Without dead ends: 15417 [2019-09-08 12:26:10,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:26:10,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15417 states. [2019-09-08 12:26:11,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15417 to 12595. [2019-09-08 12:26:11,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12595 states. [2019-09-08 12:26:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12595 states to 12595 states and 18194 transitions. [2019-09-08 12:26:11,689 INFO L78 Accepts]: Start accepts. Automaton has 12595 states and 18194 transitions. Word has length 84 [2019-09-08 12:26:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:11,689 INFO L475 AbstractCegarLoop]: Abstraction has 12595 states and 18194 transitions. [2019-09-08 12:26:11,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:26:11,689 INFO L276 IsEmpty]: Start isEmpty. Operand 12595 states and 18194 transitions. [2019-09-08 12:26:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:26:11,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:11,690 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] [2019-09-08 12:26:11,690 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:11,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:11,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1586465785, now seen corresponding path program 1 times [2019-09-08 12:26:11,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:11,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:11,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:11,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:11,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:11,782 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 12:26:11,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:11,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:26:11,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:26:11,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:26:11,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:26:11,784 INFO L87 Difference]: Start difference. First operand 12595 states and 18194 transitions. Second operand 5 states. [2019-09-08 12:26:13,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:13,838 INFO L93 Difference]: Finished difference Result 23559 states and 33906 transitions. [2019-09-08 12:26:13,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:26:13,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 12:26:13,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:13,884 INFO L225 Difference]: With dead ends: 23559 [2019-09-08 12:26:13,884 INFO L226 Difference]: Without dead ends: 23557 [2019-09-08 12:26:13,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:26:13,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23557 states. [2019-09-08 12:26:15,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23557 to 13043. [2019-09-08 12:26:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13043 states. [2019-09-08 12:26:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13043 states to 13043 states and 18610 transitions. [2019-09-08 12:26:15,307 INFO L78 Accepts]: Start accepts. Automaton has 13043 states and 18610 transitions. Word has length 85 [2019-09-08 12:26:15,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:15,308 INFO L475 AbstractCegarLoop]: Abstraction has 13043 states and 18610 transitions. [2019-09-08 12:26:15,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:26:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 13043 states and 18610 transitions. [2019-09-08 12:26:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:26:15,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:15,319 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:26:15,319 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:15,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:15,319 INFO L82 PathProgramCache]: Analyzing trace with hash -784533912, now seen corresponding path program 1 times [2019-09-08 12:26:15,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:15,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:15,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:15,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:15,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:15,481 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:26:15,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:15,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:26:15,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:26:15,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:26:15,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:26:15,484 INFO L87 Difference]: Start difference. First operand 13043 states and 18610 transitions. Second operand 8 states. [2019-09-08 12:26:19,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:19,400 INFO L93 Difference]: Finished difference Result 60865 states and 87193 transitions. [2019-09-08 12:26:19,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:26:19,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-09-08 12:26:19,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:19,474 INFO L225 Difference]: With dead ends: 60865 [2019-09-08 12:26:19,474 INFO L226 Difference]: Without dead ends: 57919 [2019-09-08 12:26:19,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:26:19,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57919 states. [2019-09-08 12:26:21,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57919 to 20307. [2019-09-08 12:26:21,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20307 states. [2019-09-08 12:26:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20307 states to 20307 states and 28850 transitions. [2019-09-08 12:26:21,226 INFO L78 Accepts]: Start accepts. Automaton has 20307 states and 28850 transitions. Word has length 115 [2019-09-08 12:26:21,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:21,226 INFO L475 AbstractCegarLoop]: Abstraction has 20307 states and 28850 transitions. [2019-09-08 12:26:21,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:26:21,226 INFO L276 IsEmpty]: Start isEmpty. Operand 20307 states and 28850 transitions. [2019-09-08 12:26:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:26:21,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:21,234 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:26:21,234 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:21,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:21,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1354552530, now seen corresponding path program 1 times [2019-09-08 12:26:21,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:21,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:21,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:21,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:21,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:21,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:26:21,453 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 12:26:21,477 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 12:26:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:21,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 12:26:21,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:26:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 12:26:21,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:26:21,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2019-09-08 12:26:21,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:26:21,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:26:21,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:26:21,791 INFO L87 Difference]: Start difference. First operand 20307 states and 28850 transitions. Second operand 11 states. [2019-09-08 12:26:30,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:30,301 INFO L93 Difference]: Finished difference Result 103295 states and 148360 transitions. [2019-09-08 12:26:30,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:26:30,302 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2019-09-08 12:26:30,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:30,516 INFO L225 Difference]: With dead ends: 103295 [2019-09-08 12:26:30,516 INFO L226 Difference]: Without dead ends: 95965 [2019-09-08 12:26:30,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:26:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95965 states. [2019-09-08 12:26:33,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95965 to 33523. [2019-09-08 12:26:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33523 states. [2019-09-08 12:26:33,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33523 states to 33523 states and 47794 transitions. [2019-09-08 12:26:33,698 INFO L78 Accepts]: Start accepts. Automaton has 33523 states and 47794 transitions. Word has length 115 [2019-09-08 12:26:33,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:33,698 INFO L475 AbstractCegarLoop]: Abstraction has 33523 states and 47794 transitions. [2019-09-08 12:26:33,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:26:33,698 INFO L276 IsEmpty]: Start isEmpty. Operand 33523 states and 47794 transitions. [2019-09-08 12:26:33,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:26:33,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:33,708 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:26:33,708 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:33,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:33,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1652537018, now seen corresponding path program 1 times [2019-09-08 12:26:33,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:33,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:33,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:33,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:33,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:33,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:26:33,829 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:26:33,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:33,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 12:26:33,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:26:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-08 12:26:34,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:26:34,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2019-09-08 12:26:34,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:26:34,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:26:34,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:26:34,118 INFO L87 Difference]: Start difference. First operand 33523 states and 47794 transitions. Second operand 11 states. [2019-09-08 12:26:44,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:44,295 INFO L93 Difference]: Finished difference Result 142037 states and 203171 transitions. [2019-09-08 12:26:44,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:26:44,427 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2019-09-08 12:26:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:44,614 INFO L225 Difference]: With dead ends: 142037 [2019-09-08 12:26:44,614 INFO L226 Difference]: Without dead ends: 118771 [2019-09-08 12:26:44,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=429, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:26:44,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118771 states. [2019-09-08 12:26:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118771 to 53715. [2019-09-08 12:26:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53715 states. [2019-09-08 12:26:50,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53715 states to 53715 states and 76818 transitions. [2019-09-08 12:26:50,809 INFO L78 Accepts]: Start accepts. Automaton has 53715 states and 76818 transitions. Word has length 115 [2019-09-08 12:26:50,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:50,810 INFO L475 AbstractCegarLoop]: Abstraction has 53715 states and 76818 transitions. [2019-09-08 12:26:50,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:26:50,810 INFO L276 IsEmpty]: Start isEmpty. Operand 53715 states and 76818 transitions. [2019-09-08 12:26:50,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:26:50,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:50,818 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:26:50,818 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:50,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:50,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1676282240, now seen corresponding path program 1 times [2019-09-08 12:26:50,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:50,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:50,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:50,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:50,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:50,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:26:50,916 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:26:50,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:51,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 12:26:51,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:26:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 12:26:51,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:26:51,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2019-09-08 12:26:51,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:26:51,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:26:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:26:51,194 INFO L87 Difference]: Start difference. First operand 53715 states and 76818 transitions. Second operand 11 states. [2019-09-08 12:27:04,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:04,934 INFO L93 Difference]: Finished difference Result 199829 states and 286339 transitions. [2019-09-08 12:27:04,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:27:04,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2019-09-08 12:27:04,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:05,166 INFO L225 Difference]: With dead ends: 199829 [2019-09-08 12:27:05,167 INFO L226 Difference]: Without dead ends: 156371 [2019-09-08 12:27:05,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=241, Invalid=461, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:27:05,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156371 states. [2019-09-08 12:27:13,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156371 to 69523. [2019-09-08 12:27:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69523 states. [2019-09-08 12:27:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69523 states to 69523 states and 99506 transitions. [2019-09-08 12:27:13,456 INFO L78 Accepts]: Start accepts. Automaton has 69523 states and 99506 transitions. Word has length 115 [2019-09-08 12:27:13,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:13,456 INFO L475 AbstractCegarLoop]: Abstraction has 69523 states and 99506 transitions. [2019-09-08 12:27:13,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:27:13,456 INFO L276 IsEmpty]: Start isEmpty. Operand 69523 states and 99506 transitions. [2019-09-08 12:27:13,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:27:13,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:13,464 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:27:13,464 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:13,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:13,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2048808134, now seen corresponding path program 1 times [2019-09-08 12:27:13,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:13,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:13,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:13,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:13,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 12:27:13,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:13,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:27:13,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:27:13,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:27:13,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:27:13,620 INFO L87 Difference]: Start difference. First operand 69523 states and 99506 transitions. Second operand 8 states. [2019-09-08 12:27:25,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:25,877 INFO L93 Difference]: Finished difference Result 182209 states and 261049 transitions. [2019-09-08 12:27:25,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:27:25,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-09-08 12:27:25,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:26,009 INFO L225 Difference]: With dead ends: 182209 [2019-09-08 12:27:26,009 INFO L226 Difference]: Without dead ends: 122943 [2019-09-08 12:27:26,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:27:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122943 states. [2019-09-08 12:27:35,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122943 to 78131. [2019-09-08 12:27:35,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78131 states. [2019-09-08 12:27:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78131 states to 78131 states and 111634 transitions. [2019-09-08 12:27:35,928 INFO L78 Accepts]: Start accepts. Automaton has 78131 states and 111634 transitions. Word has length 115 [2019-09-08 12:27:35,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:35,929 INFO L475 AbstractCegarLoop]: Abstraction has 78131 states and 111634 transitions. [2019-09-08 12:27:35,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:27:35,929 INFO L276 IsEmpty]: Start isEmpty. Operand 78131 states and 111634 transitions. [2019-09-08 12:27:35,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:27:35,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:35,935 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:27:35,935 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:35,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:35,936 INFO L82 PathProgramCache]: Analyzing trace with hash 333801332, now seen corresponding path program 1 times [2019-09-08 12:27:35,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:35,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:35,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:35,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:35,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 12:27:36,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:36,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:27:36,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:27:36,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:27:36,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:27:36,296 INFO L87 Difference]: Start difference. First operand 78131 states and 111634 transitions. Second operand 8 states. [2019-09-08 12:27:49,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:49,175 INFO L93 Difference]: Finished difference Result 190817 states and 273177 transitions. [2019-09-08 12:27:49,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:27:49,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-09-08 12:27:49,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:49,320 INFO L225 Difference]: With dead ends: 190817 [2019-09-08 12:27:49,321 INFO L226 Difference]: Without dead ends: 131551 [2019-09-08 12:27:49,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:27:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131551 states. [2019-09-08 12:28:00,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131551 to 86739. [2019-09-08 12:28:00,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86739 states. [2019-09-08 12:28:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86739 states to 86739 states and 123762 transitions. [2019-09-08 12:28:01,099 INFO L78 Accepts]: Start accepts. Automaton has 86739 states and 123762 transitions. Word has length 115 [2019-09-08 12:28:01,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:01,099 INFO L475 AbstractCegarLoop]: Abstraction has 86739 states and 123762 transitions. [2019-09-08 12:28:01,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:28:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 86739 states and 123762 transitions. [2019-09-08 12:28:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:28:01,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:01,107 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:28:01,107 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:01,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:01,107 INFO L82 PathProgramCache]: Analyzing trace with hash 90667176, now seen corresponding path program 1 times [2019-09-08 12:28:01,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:01,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:01,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:01,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:01,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:28:01,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:28:01,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:28:01,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:28:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:01,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 12:28:01,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:28:01,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:28:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:01,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:28:01,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10] total 12 [2019-09-08 12:28:01,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:28:01,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:28:01,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:28:01,754 INFO L87 Difference]: Start difference. First operand 86739 states and 123762 transitions. Second operand 12 states. [2019-09-08 12:29:25,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:25,222 INFO L93 Difference]: Finished difference Result 692991 states and 982760 transitions. [2019-09-08 12:29:25,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-08 12:29:25,225 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 116 [2019-09-08 12:29:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:26,074 INFO L225 Difference]: With dead ends: 692991 [2019-09-08 12:29:26,074 INFO L226 Difference]: Without dead ends: 606301 [2019-09-08 12:29:26,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=955, Invalid=2951, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 12:29:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606301 states. [2019-09-08 12:30:12,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606301 to 307379. [2019-09-08 12:30:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307379 states. [2019-09-08 12:30:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307379 states to 307379 states and 432962 transitions. [2019-09-08 12:30:12,783 INFO L78 Accepts]: Start accepts. Automaton has 307379 states and 432962 transitions. Word has length 116 [2019-09-08 12:30:12,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:12,784 INFO L475 AbstractCegarLoop]: Abstraction has 307379 states and 432962 transitions. [2019-09-08 12:30:12,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:30:12,784 INFO L276 IsEmpty]: Start isEmpty. Operand 307379 states and 432962 transitions. [2019-09-08 12:30:12,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:30:12,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:12,798 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:30:12,798 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:12,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:12,799 INFO L82 PathProgramCache]: Analyzing trace with hash -827392191, now seen corresponding path program 1 times [2019-09-08 12:30:12,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:12,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:12,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:12,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:12,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:13,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:30:13,023 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:30:13,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:30:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:13,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 12:30:13,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:30:13,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:30:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:13,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:30:13,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-09-08 12:30:13,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:30:13,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:30:13,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:30:13,538 INFO L87 Difference]: Start difference. First operand 307379 states and 432962 transitions. Second operand 17 states. [2019-09-08 12:30:27,547 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-08 12:30:28,432 WARN L188 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-09-08 12:31:31,645 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44