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.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:07:52,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:07:52,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:07:52,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:07:52,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:07:52,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:07:52,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:07:52,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:07:52,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:07:52,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:07:52,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:07:52,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:07:52,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:07:52,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:07:52,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:07:52,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:07:52,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:07:52,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:07:52,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:07:52,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:07:52,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:07:52,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:07:52,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:07:52,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:07:52,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:07:52,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:07:52,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:07:52,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:07:52,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:07:52,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:07:52,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:07:52,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:07:52,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:07:52,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:07:52,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:07:52,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:07:52,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:07:52,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:07:52,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:07:52,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:07:52,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:07:52,089 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:07:52,103 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:07:52,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:07:52,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:07:52,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:07:52,105 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:07:52,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:07:52,106 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:07:52,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:07:52,106 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:07:52,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:07:52,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:07:52,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:07:52,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:07:52,107 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:07:52,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:07:52,107 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:07:52,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:07:52,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:07:52,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:07:52,108 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:07:52,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:07:52,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:07:52,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:07:52,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:07:52,109 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:07:52,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:07:52,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:07:52,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:07:52,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:07:52,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:07:52,165 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:07:52,169 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:07:52,170 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:07:52,171 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:07:52,171 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 12:07:52,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31ba7664/cb1036d835d54e3b9170908011dce88d/FLAG91a9ed694 [2019-09-08 12:07:52,711 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:07:52,712 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 12:07:52,722 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31ba7664/cb1036d835d54e3b9170908011dce88d/FLAG91a9ed694 [2019-09-08 12:07:53,049 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31ba7664/cb1036d835d54e3b9170908011dce88d [2019-09-08 12:07:53,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:07:53,059 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:07:53,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:07:53,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:07:53,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:07:53,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:07:53" (1/1) ... [2019-09-08 12:07:53,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce4c139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:07:53, skipping insertion in model container [2019-09-08 12:07:53,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:07:53" (1/1) ... [2019-09-08 12:07:53,077 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:07:53,121 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:07:53,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:07:53,615 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:07:53,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:07:53,701 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:07:53,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:07:53 WrapperNode [2019-09-08 12:07:53,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:07:53,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:07:53,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:07:53,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:07:53,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:07:53" (1/1) ... [2019-09-08 12:07:53,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:07:53" (1/1) ... [2019-09-08 12:07:53,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:07:53" (1/1) ... [2019-09-08 12:07:53,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:07:53" (1/1) ... [2019-09-08 12:07:53,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:07:53" (1/1) ... [2019-09-08 12:07:53,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:07:53" (1/1) ... [2019-09-08 12:07:53,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:07:53" (1/1) ... [2019-09-08 12:07:53,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:07:53,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:07:53,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:07:53,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:07:53,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:07:53" (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:07:53,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:07:53,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:07:53,828 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:07:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:07:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:07:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:07:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:07:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:07:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:07:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:07:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:07:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:07:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:07:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:07:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:07:53,831 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:07:53,831 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:07:53,831 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:07:53,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:07:53,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:07:54,484 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:07:54,485 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:07:54,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:07:54 BoogieIcfgContainer [2019-09-08 12:07:54,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:07:54,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:07:54,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:07:54,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:07:54,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:07:53" (1/3) ... [2019-09-08 12:07:54,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a50ab47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:07:54, skipping insertion in model container [2019-09-08 12:07:54,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:07:53" (2/3) ... [2019-09-08 12:07:54,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a50ab47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:07:54, skipping insertion in model container [2019-09-08 12:07:54,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:07:54" (3/3) ... [2019-09-08 12:07:54,502 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 12:07:54,517 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:07:54,526 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:07:54,543 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:07:54,574 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:07:54,575 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:07:54,575 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:07:54,575 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:07:54,575 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:07:54,576 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:07:54,576 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:07:54,576 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:07:54,576 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:07:54,597 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states. [2019-09-08 12:07:54,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 12:07:54,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:54,608 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] [2019-09-08 12:07:54,610 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:54,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:54,617 INFO L82 PathProgramCache]: Analyzing trace with hash -896938852, now seen corresponding path program 1 times [2019-09-08 12:07:54,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:54,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:54,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:54,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:54,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:55,072 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:07:55,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:55,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:07:55,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:07:55,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:07:55,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:07:55,097 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 3 states. [2019-09-08 12:07:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:55,184 INFO L93 Difference]: Finished difference Result 222 states and 357 transitions. [2019-09-08 12:07:55,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:07:55,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-08 12:07:55,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:55,206 INFO L225 Difference]: With dead ends: 222 [2019-09-08 12:07:55,206 INFO L226 Difference]: Without dead ends: 150 [2019-09-08 12:07:55,210 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:07:55,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-08 12:07:55,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-09-08 12:07:55,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-08 12:07:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 213 transitions. [2019-09-08 12:07:55,265 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 213 transitions. Word has length 63 [2019-09-08 12:07:55,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:55,266 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 213 transitions. [2019-09-08 12:07:55,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:07:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 213 transitions. [2019-09-08 12:07:55,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 12:07:55,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:55,270 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] [2019-09-08 12:07:55,270 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:55,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:55,271 INFO L82 PathProgramCache]: Analyzing trace with hash -196255440, now seen corresponding path program 1 times [2019-09-08 12:07:55,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:55,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:55,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:55,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:55,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:55,413 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:07:55,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:55,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:07:55,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:07:55,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:07:55,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:07:55,421 INFO L87 Difference]: Start difference. First operand 148 states and 213 transitions. Second operand 3 states. [2019-09-08 12:07:55,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:55,470 INFO L93 Difference]: Finished difference Result 352 states and 537 transitions. [2019-09-08 12:07:55,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:07:55,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-08 12:07:55,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:55,477 INFO L225 Difference]: With dead ends: 352 [2019-09-08 12:07:55,478 INFO L226 Difference]: Without dead ends: 242 [2019-09-08 12:07:55,482 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:07:55,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-08 12:07:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2019-09-08 12:07:55,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-08 12:07:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 359 transitions. [2019-09-08 12:07:55,543 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 359 transitions. Word has length 64 [2019-09-08 12:07:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:55,543 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 359 transitions. [2019-09-08 12:07:55,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:07:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 359 transitions. [2019-09-08 12:07:55,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 12:07:55,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:55,549 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:07:55,549 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:55,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:55,550 INFO L82 PathProgramCache]: Analyzing trace with hash -922764682, now seen corresponding path program 1 times [2019-09-08 12:07:55,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:55,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:55,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:55,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:55,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:55,710 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:07:55,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:55,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:07:55,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:07:55,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:07:55,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:07:55,712 INFO L87 Difference]: Start difference. First operand 240 states and 359 transitions. Second operand 3 states. [2019-09-08 12:07:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:55,772 INFO L93 Difference]: Finished difference Result 612 states and 949 transitions. [2019-09-08 12:07:55,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:07:55,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-08 12:07:55,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:55,777 INFO L225 Difference]: With dead ends: 612 [2019-09-08 12:07:55,777 INFO L226 Difference]: Without dead ends: 410 [2019-09-08 12:07:55,779 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:07:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-09-08 12:07:55,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2019-09-08 12:07:55,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-08 12:07:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2019-09-08 12:07:55,840 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 65 [2019-09-08 12:07:55,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:55,840 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2019-09-08 12:07:55,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:07:55,840 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2019-09-08 12:07:55,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 12:07:55,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:55,843 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:07:55,843 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:55,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:55,844 INFO L82 PathProgramCache]: Analyzing trace with hash -919872372, now seen corresponding path program 1 times [2019-09-08 12:07:55,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:55,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:55,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:55,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:55,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:55,932 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:07:55,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:55,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:07:55,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:07:55,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:07:55,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:07:55,936 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 3 states. [2019-09-08 12:07:55,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:55,987 INFO L93 Difference]: Finished difference Result 1084 states and 1689 transitions. [2019-09-08 12:07:55,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:07:55,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 12:07:55,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:55,992 INFO L225 Difference]: With dead ends: 1084 [2019-09-08 12:07:55,992 INFO L226 Difference]: Without dead ends: 714 [2019-09-08 12:07:55,995 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:07:55,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-08 12:07:56,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 712. [2019-09-08 12:07:56,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-09-08 12:07:56,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1095 transitions. [2019-09-08 12:07:56,034 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1095 transitions. Word has length 66 [2019-09-08 12:07:56,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:56,035 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 1095 transitions. [2019-09-08 12:07:56,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:07:56,035 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1095 transitions. [2019-09-08 12:07:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 12:07:56,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:56,040 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] [2019-09-08 12:07:56,040 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:56,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:56,041 INFO L82 PathProgramCache]: Analyzing trace with hash -963358397, now seen corresponding path program 1 times [2019-09-08 12:07:56,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:56,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:56,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:56,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:56,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:56,170 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:07:56,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:56,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:07:56,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:07:56,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:07:56,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:07:56,173 INFO L87 Difference]: Start difference. First operand 712 states and 1095 transitions. Second operand 3 states. [2019-09-08 12:07:56,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:56,253 INFO L93 Difference]: Finished difference Result 1932 states and 3001 transitions. [2019-09-08 12:07:56,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:07:56,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 12:07:56,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:56,262 INFO L225 Difference]: With dead ends: 1932 [2019-09-08 12:07:56,262 INFO L226 Difference]: Without dead ends: 1258 [2019-09-08 12:07:56,264 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:07:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-09-08 12:07:56,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-09-08 12:07:56,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-08 12:07:56,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1927 transitions. [2019-09-08 12:07:56,349 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1927 transitions. Word has length 67 [2019-09-08 12:07:56,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:56,349 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1927 transitions. [2019-09-08 12:07:56,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:07:56,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1927 transitions. [2019-09-08 12:07:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 12:07:56,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:56,359 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] [2019-09-08 12:07:56,359 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:56,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:56,360 INFO L82 PathProgramCache]: Analyzing trace with hash -295185019, now seen corresponding path program 1 times [2019-09-08 12:07:56,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:56,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:56,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:56,518 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:07:56,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:56,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:07:56,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:07:56,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:07:56,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:07:56,520 INFO L87 Difference]: Start difference. First operand 1256 states and 1927 transitions. Second operand 5 states. [2019-09-08 12:07:56,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:56,849 INFO L93 Difference]: Finished difference Result 2474 states and 3816 transitions. [2019-09-08 12:07:56,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:07:56,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 12:07:56,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:56,861 INFO L225 Difference]: With dead ends: 2474 [2019-09-08 12:07:56,862 INFO L226 Difference]: Without dead ends: 1256 [2019-09-08 12:07:56,867 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:07:56,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-09-08 12:07:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2019-09-08 12:07:56,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-08 12:07:56,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1911 transitions. [2019-09-08 12:07:56,994 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1911 transitions. Word has length 68 [2019-09-08 12:07:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:56,996 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1911 transitions. [2019-09-08 12:07:56,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:07:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1911 transitions. [2019-09-08 12:07:56,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 12:07:56,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:56,999 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] [2019-09-08 12:07:57,000 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:57,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:57,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1032200170, now seen corresponding path program 1 times [2019-09-08 12:07:57,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:57,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:57,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:57,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:57,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:57,134 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:07:57,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:57,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:07:57,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:07:57,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:07:57,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:07:57,138 INFO L87 Difference]: Start difference. First operand 1256 states and 1911 transitions. Second operand 5 states. [2019-09-08 12:07:57,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:57,375 INFO L93 Difference]: Finished difference Result 2474 states and 3784 transitions. [2019-09-08 12:07:57,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:07:57,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 12:07:57,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:57,383 INFO L225 Difference]: With dead ends: 2474 [2019-09-08 12:07:57,383 INFO L226 Difference]: Without dead ends: 1256 [2019-09-08 12:07:57,386 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:07:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-09-08 12:07:57,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2019-09-08 12:07:57,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-08 12:07:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1895 transitions. [2019-09-08 12:07:57,472 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1895 transitions. Word has length 68 [2019-09-08 12:07:57,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:57,472 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1895 transitions. [2019-09-08 12:07:57,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:07:57,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1895 transitions. [2019-09-08 12:07:57,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 12:07:57,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:57,473 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] [2019-09-08 12:07:57,474 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:57,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:57,474 INFO L82 PathProgramCache]: Analyzing trace with hash -809830363, now seen corresponding path program 1 times [2019-09-08 12:07:57,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:57,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:57,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:57,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:57,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:57,554 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:07:57,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:57,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:07:57,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:07:57,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:07:57,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:07:57,556 INFO L87 Difference]: Start difference. First operand 1256 states and 1895 transitions. Second operand 5 states. [2019-09-08 12:07:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:57,787 INFO L93 Difference]: Finished difference Result 2474 states and 3752 transitions. [2019-09-08 12:07:57,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:07:57,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 12:07:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:57,794 INFO L225 Difference]: With dead ends: 2474 [2019-09-08 12:07:57,795 INFO L226 Difference]: Without dead ends: 1256 [2019-09-08 12:07:57,798 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:07:57,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-09-08 12:07:57,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2019-09-08 12:07:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-08 12:07:57,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1879 transitions. [2019-09-08 12:07:57,887 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1879 transitions. Word has length 68 [2019-09-08 12:07:57,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:57,887 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1879 transitions. [2019-09-08 12:07:57,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:07:57,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1879 transitions. [2019-09-08 12:07:57,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 12:07:57,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:57,888 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] [2019-09-08 12:07:57,888 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:57,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:57,889 INFO L82 PathProgramCache]: Analyzing trace with hash 464037642, now seen corresponding path program 1 times [2019-09-08 12:07:57,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:57,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:57,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:57,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:57,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:57,984 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:07:57,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:57,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:07:57,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:07:57,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:07:57,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:07:57,985 INFO L87 Difference]: Start difference. First operand 1256 states and 1879 transitions. Second operand 5 states. [2019-09-08 12:07:58,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:58,177 INFO L93 Difference]: Finished difference Result 2474 states and 3720 transitions. [2019-09-08 12:07:58,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:07:58,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 12:07:58,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:58,185 INFO L225 Difference]: With dead ends: 2474 [2019-09-08 12:07:58,185 INFO L226 Difference]: Without dead ends: 1256 [2019-09-08 12:07:58,188 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:07:58,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-09-08 12:07:58,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2019-09-08 12:07:58,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-08 12:07:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1863 transitions. [2019-09-08 12:07:58,279 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1863 transitions. Word has length 68 [2019-09-08 12:07:58,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:58,279 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1863 transitions. [2019-09-08 12:07:58,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:07:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1863 transitions. [2019-09-08 12:07:58,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 12:07:58,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:58,280 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] [2019-09-08 12:07:58,281 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:58,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:58,281 INFO L82 PathProgramCache]: Analyzing trace with hash -982991953, now seen corresponding path program 1 times [2019-09-08 12:07:58,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:58,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:58,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:58,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:58,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:58,413 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:07:58,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:58,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:07:58,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:07:58,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:07:58,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:07:58,415 INFO L87 Difference]: Start difference. First operand 1256 states and 1863 transitions. Second operand 7 states. [2019-09-08 12:07:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:59,352 INFO L93 Difference]: Finished difference Result 11000 states and 16463 transitions. [2019-09-08 12:07:59,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:07:59,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-09-08 12:07:59,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:59,408 INFO L225 Difference]: With dead ends: 11000 [2019-09-08 12:07:59,411 INFO L226 Difference]: Without dead ends: 9782 [2019-09-08 12:07:59,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:07:59,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9782 states. [2019-09-08 12:07:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9782 to 3688. [2019-09-08 12:07:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3688 states. [2019-09-08 12:07:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 5447 transitions. [2019-09-08 12:07:59,768 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 5447 transitions. Word has length 68 [2019-09-08 12:07:59,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:59,768 INFO L475 AbstractCegarLoop]: Abstraction has 3688 states and 5447 transitions. [2019-09-08 12:07:59,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:07:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 5447 transitions. [2019-09-08 12:07:59,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 12:07:59,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:59,769 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:07:59,770 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:59,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:59,770 INFO L82 PathProgramCache]: Analyzing trace with hash -635604215, now seen corresponding path program 1 times [2019-09-08 12:07:59,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:59,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:59,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:59,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:59,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:00,038 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:08:00,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:00,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:08:00,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:08:00,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:08:00,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:08:00,040 INFO L87 Difference]: Start difference. First operand 3688 states and 5447 transitions. Second operand 7 states. [2019-09-08 12:08:00,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:00,659 INFO L93 Difference]: Finished difference Result 8560 states and 12683 transitions. [2019-09-08 12:08:00,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:08:00,660 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-09-08 12:08:00,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:00,685 INFO L225 Difference]: With dead ends: 8560 [2019-09-08 12:08:00,685 INFO L226 Difference]: Without dead ends: 4910 [2019-09-08 12:08:00,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:08:00,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4910 states. [2019-09-08 12:08:01,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4910 to 3688. [2019-09-08 12:08:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3688 states. [2019-09-08 12:08:01,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 5415 transitions. [2019-09-08 12:08:01,067 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 5415 transitions. Word has length 70 [2019-09-08 12:08:01,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:01,068 INFO L475 AbstractCegarLoop]: Abstraction has 3688 states and 5415 transitions. [2019-09-08 12:08:01,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:08:01,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 5415 transitions. [2019-09-08 12:08:01,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 12:08:01,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:01,069 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:08:01,069 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:01,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:01,069 INFO L82 PathProgramCache]: Analyzing trace with hash -655653558, now seen corresponding path program 1 times [2019-09-08 12:08:01,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:01,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:01,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:01,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:01,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:01,137 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:08:01,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:01,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:08:01,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:08:01,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:08:01,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:08:01,139 INFO L87 Difference]: Start difference. First operand 3688 states and 5415 transitions. Second operand 3 states. [2019-09-08 12:08:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:01,535 INFO L93 Difference]: Finished difference Result 9102 states and 13347 transitions. [2019-09-08 12:08:01,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:08:01,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-08 12:08:01,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:01,574 INFO L225 Difference]: With dead ends: 9102 [2019-09-08 12:08:01,574 INFO L226 Difference]: Without dead ends: 5452 [2019-09-08 12:08:01,583 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:08:01,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2019-09-08 12:08:02,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 5450. [2019-09-08 12:08:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5450 states. [2019-09-08 12:08:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5450 states to 5450 states and 7889 transitions. [2019-09-08 12:08:02,084 INFO L78 Accepts]: Start accepts. Automaton has 5450 states and 7889 transitions. Word has length 70 [2019-09-08 12:08:02,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:02,084 INFO L475 AbstractCegarLoop]: Abstraction has 5450 states and 7889 transitions. [2019-09-08 12:08:02,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:08:02,085 INFO L276 IsEmpty]: Start isEmpty. Operand 5450 states and 7889 transitions. [2019-09-08 12:08:02,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 12:08:02,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:02,086 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:08:02,086 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:02,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:02,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1769196458, now seen corresponding path program 1 times [2019-09-08 12:08:02,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:02,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:02,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:02,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:02,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:02,191 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:08:02,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:02,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:08:02,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:08:02,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:08:02,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:08:02,194 INFO L87 Difference]: Start difference. First operand 5450 states and 7889 transitions. Second operand 5 states. [2019-09-08 12:08:03,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:03,077 INFO L93 Difference]: Finished difference Result 10184 states and 14682 transitions. [2019-09-08 12:08:03,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:08:03,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 12:08:03,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:03,099 INFO L225 Difference]: With dead ends: 10184 [2019-09-08 12:08:03,099 INFO L226 Difference]: Without dead ends: 10182 [2019-09-08 12:08:03,103 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:08:03,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10182 states. [2019-09-08 12:08:03,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10182 to 5674. [2019-09-08 12:08:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5674 states. [2019-09-08 12:08:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5674 states to 5674 states and 8097 transitions. [2019-09-08 12:08:03,651 INFO L78 Accepts]: Start accepts. Automaton has 5674 states and 8097 transitions. Word has length 71 [2019-09-08 12:08:03,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:03,651 INFO L475 AbstractCegarLoop]: Abstraction has 5674 states and 8097 transitions. [2019-09-08 12:08:03,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:08:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 5674 states and 8097 transitions. [2019-09-08 12:08:03,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:08:03,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:03,656 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:08:03,656 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:03,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:03,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1397736529, now seen corresponding path program 1 times [2019-09-08 12:08:03,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:03,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:03,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:03,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:03,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:03,925 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 12:08:03,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:03,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:08:03,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:08:03,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:08:03,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:08:03,928 INFO L87 Difference]: Start difference. First operand 5674 states and 8097 transitions. Second operand 7 states. [2019-09-08 12:08:05,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:05,715 INFO L93 Difference]: Finished difference Result 23910 states and 34207 transitions. [2019-09-08 12:08:05,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:08:05,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-08 12:08:05,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:05,764 INFO L225 Difference]: With dead ends: 23910 [2019-09-08 12:08:05,765 INFO L226 Difference]: Without dead ends: 22004 [2019-09-08 12:08:05,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:08:05,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22004 states. [2019-09-08 12:08:06,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22004 to 9450. [2019-09-08 12:08:06,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9450 states. [2019-09-08 12:08:06,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9450 states to 9450 states and 13393 transitions. [2019-09-08 12:08:06,952 INFO L78 Accepts]: Start accepts. Automaton has 9450 states and 13393 transitions. Word has length 97 [2019-09-08 12:08:06,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:06,952 INFO L475 AbstractCegarLoop]: Abstraction has 9450 states and 13393 transitions. [2019-09-08 12:08:06,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:08:06,952 INFO L276 IsEmpty]: Start isEmpty. Operand 9450 states and 13393 transitions. [2019-09-08 12:08:06,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:08:06,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:06,957 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:08:06,957 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:06,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:06,957 INFO L82 PathProgramCache]: Analyzing trace with hash 887147195, now seen corresponding path program 1 times [2019-09-08 12:08:06,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:06,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:06,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:06,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:06,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:07,052 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:08:07,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:08:07,053 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:08:07,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:07,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:08:07,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:08:07,377 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 12:08:07,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:08:07,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-09-08 12:08:07,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:08:07,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:08:07,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:08:07,395 INFO L87 Difference]: Start difference. First operand 9450 states and 13393 transitions. Second operand 10 states. [2019-09-08 12:08:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:10,359 INFO L93 Difference]: Finished difference Result 39478 states and 56447 transitions. [2019-09-08 12:08:10,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:08:10,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-08 12:08:10,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:10,437 INFO L225 Difference]: With dead ends: 39478 [2019-09-08 12:08:10,437 INFO L226 Difference]: Without dead ends: 33844 [2019-09-08 12:08:10,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=329, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:08:10,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33844 states. [2019-09-08 12:08:11,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33844 to 16922. [2019-09-08 12:08:11,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16922 states. [2019-09-08 12:08:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16922 states to 16922 states and 24145 transitions. [2019-09-08 12:08:11,843 INFO L78 Accepts]: Start accepts. Automaton has 16922 states and 24145 transitions. Word has length 97 [2019-09-08 12:08:11,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:11,844 INFO L475 AbstractCegarLoop]: Abstraction has 16922 states and 24145 transitions. [2019-09-08 12:08:11,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:08:11,844 INFO L276 IsEmpty]: Start isEmpty. Operand 16922 states and 24145 transitions. [2019-09-08 12:08:11,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:08:11,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:11,849 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:08:11,849 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:11,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:11,850 INFO L82 PathProgramCache]: Analyzing trace with hash 910892417, now seen corresponding path program 1 times [2019-09-08 12:08:11,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:11,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:11,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:11,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:11,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:08:11,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:08:11,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:08:11,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:08:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:12,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:08:12,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:08:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 12:08:12,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:08:12,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-09-08 12:08:12,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:08:12,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:08:12,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:08:12,240 INFO L87 Difference]: Start difference. First operand 16922 states and 24145 transitions. Second operand 10 states. [2019-09-08 12:08:15,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:15,916 INFO L93 Difference]: Finished difference Result 58262 states and 83551 transitions. [2019-09-08 12:08:15,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:08:15,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-08 12:08:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:16,015 INFO L225 Difference]: With dead ends: 58262 [2019-09-08 12:08:16,015 INFO L226 Difference]: Without dead ends: 47012 [2019-09-08 12:08:16,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=302, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:08:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47012 states. [2019-09-08 12:08:17,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47012 to 22490. [2019-09-08 12:08:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22490 states. [2019-09-08 12:08:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22490 states to 22490 states and 32137 transitions. [2019-09-08 12:08:17,894 INFO L78 Accepts]: Start accepts. Automaton has 22490 states and 32137 transitions. Word has length 97 [2019-09-08 12:08:17,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:17,895 INFO L475 AbstractCegarLoop]: Abstraction has 22490 states and 32137 transitions. [2019-09-08 12:08:17,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:08:17,895 INFO L276 IsEmpty]: Start isEmpty. Operand 22490 states and 32137 transitions. [2019-09-08 12:08:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:08:17,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:17,899 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:08:17,900 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:17,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:17,900 INFO L82 PathProgramCache]: Analyzing trace with hash 514621301, now seen corresponding path program 1 times [2019-09-08 12:08:17,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:17,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:17,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:17,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:17,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:18,049 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 12:08:18,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:18,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:08:18,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:08:18,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:08:18,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:08:18,051 INFO L87 Difference]: Start difference. First operand 22490 states and 32137 transitions. Second operand 7 states. [2019-09-08 12:08:20,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:20,676 INFO L93 Difference]: Finished difference Result 55030 states and 78879 transitions. [2019-09-08 12:08:20,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:08:20,677 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-08 12:08:20,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:20,729 INFO L225 Difference]: With dead ends: 55030 [2019-09-08 12:08:20,729 INFO L226 Difference]: Without dead ends: 38212 [2019-09-08 12:08:20,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:08:20,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38212 states. [2019-09-08 12:08:23,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38212 to 26218. [2019-09-08 12:08:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26218 states. [2019-09-08 12:08:23,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26218 states to 26218 states and 37385 transitions. [2019-09-08 12:08:23,435 INFO L78 Accepts]: Start accepts. Automaton has 26218 states and 37385 transitions. Word has length 97 [2019-09-08 12:08:23,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:23,435 INFO L475 AbstractCegarLoop]: Abstraction has 26218 states and 37385 transitions. [2019-09-08 12:08:23,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:08:23,436 INFO L276 IsEmpty]: Start isEmpty. Operand 26218 states and 37385 transitions. [2019-09-08 12:08:23,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:08:23,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:23,440 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:08:23,440 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:23,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:23,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1208876905, now seen corresponding path program 1 times [2019-09-08 12:08:23,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:23,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:23,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:23,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:23,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:08:23,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:23,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:08:23,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:08:23,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:08:23,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:08:23,574 INFO L87 Difference]: Start difference. First operand 26218 states and 37385 transitions. Second operand 7 states. [2019-09-08 12:08:27,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:27,490 INFO L93 Difference]: Finished difference Result 64278 states and 92559 transitions. [2019-09-08 12:08:27,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:08:27,490 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-08 12:08:27,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:27,557 INFO L225 Difference]: With dead ends: 64278 [2019-09-08 12:08:27,558 INFO L226 Difference]: Without dead ends: 57876 [2019-09-08 12:08:27,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:08:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57876 states. [2019-09-08 12:08:29,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57876 to 28778. [2019-09-08 12:08:29,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28778 states. [2019-09-08 12:08:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28778 states to 28778 states and 41097 transitions. [2019-09-08 12:08:29,937 INFO L78 Accepts]: Start accepts. Automaton has 28778 states and 41097 transitions. Word has length 97 [2019-09-08 12:08:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:29,937 INFO L475 AbstractCegarLoop]: Abstraction has 28778 states and 41097 transitions. [2019-09-08 12:08:29,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:08:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 28778 states and 41097 transitions. [2019-09-08 12:08:29,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:08:29,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:29,942 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] [2019-09-08 12:08:29,942 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:29,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:29,942 INFO L82 PathProgramCache]: Analyzing trace with hash -2047399003, now seen corresponding path program 1 times [2019-09-08 12:08:29,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:29,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:29,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:29,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:29,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:08:30,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:08:30,035 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:08:30,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:30,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 12:08:30,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:08:30,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:08:30,600 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:08:30,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:08:30,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10] total 12 [2019-09-08 12:08:30,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:08:30,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:08:30,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:08:30,616 INFO L87 Difference]: Start difference. First operand 28778 states and 41097 transitions. Second operand 12 states. [2019-09-08 12:08:53,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:53,635 INFO L93 Difference]: Finished difference Result 228452 states and 323904 transitions. [2019-09-08 12:08:53,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-08 12:08:53,636 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-09-08 12:08:53,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:53,882 INFO L225 Difference]: With dead ends: 228452 [2019-09-08 12:08:53,882 INFO L226 Difference]: Without dead ends: 199714 [2019-09-08 12:08:53,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1688 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1086, Invalid=3606, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 12:08:54,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199714 states. [2019-09-08 12:09:04,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199714 to 112386. [2019-09-08 12:09:04,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112386 states. [2019-09-08 12:09:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112386 states to 112386 states and 158351 transitions. [2019-09-08 12:09:04,292 INFO L78 Accepts]: Start accepts. Automaton has 112386 states and 158351 transitions. Word has length 98 [2019-09-08 12:09:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:04,293 INFO L475 AbstractCegarLoop]: Abstraction has 112386 states and 158351 transitions. [2019-09-08 12:09:04,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:09:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 112386 states and 158351 transitions. [2019-09-08 12:09:04,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:09:04,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:04,298 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:04,299 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:04,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:04,299 INFO L82 PathProgramCache]: Analyzing trace with hash -2002573344, now seen corresponding path program 1 times [2019-09-08 12:09:04,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:04,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:04,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:04,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:04,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:06,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:09:06,181 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:09:06,196 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:09:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:06,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 12:09:06,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:09:06,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:09:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:06,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:09:06,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-09-08 12:09:06,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:09:06,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:09:06,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:09:06,696 INFO L87 Difference]: Start difference. First operand 112386 states and 158351 transitions. Second operand 17 states. [2019-09-08 12:10:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:04,980 INFO L93 Difference]: Finished difference Result 589042 states and 822359 transitions. [2019-09-08 12:10:04,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 12:10:04,980 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 99 [2019-09-08 12:10:04,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:05,668 INFO L225 Difference]: With dead ends: 589042 [2019-09-08 12:10:05,668 INFO L226 Difference]: Without dead ends: 507152 [2019-09-08 12:10:05,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 12:10:06,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507152 states. [2019-09-08 12:10:36,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507152 to 235430. [2019-09-08 12:10:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235430 states. [2019-09-08 12:10:37,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235430 states to 235430 states and 330901 transitions. [2019-09-08 12:10:37,248 INFO L78 Accepts]: Start accepts. Automaton has 235430 states and 330901 transitions. Word has length 99 [2019-09-08 12:10:37,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:37,249 INFO L475 AbstractCegarLoop]: Abstraction has 235430 states and 330901 transitions. [2019-09-08 12:10:37,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:10:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand 235430 states and 330901 transitions. [2019-09-08 12:10:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:10:37,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:37,258 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:37,258 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:37,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:37,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1012996838, now seen corresponding path program 1 times [2019-09-08 12:10:37,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:37,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:37,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:37,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:37,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:37,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:10:37,485 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:10:37,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:37,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 12:10:37,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:10:37,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:10:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 12:10:38,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:10:38,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-08 12:10:38,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 12:10:38,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 12:10:38,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:10:38,038 INFO L87 Difference]: Start difference. First operand 235430 states and 330901 transitions. Second operand 20 states. [2019-09-08 12:10:42,022 WARN L188 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-08 12:10:43,131 WARN L188 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-08 12:10:43,920 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-08 12:10:45,073 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:10:45,205 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-08 12:10:46,365 WARN L188 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-08 12:10:52,932 WARN L188 SmtUtils]: Spent 977.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-09-08 12:10:54,802 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 12:10:55,469 WARN L188 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-09-08 12:10:56,746 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-08 12:10:56,920 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-08 12:10:57,093 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 12:10:57,260 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 12:11:00,360 WARN L188 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-08 12:11:00,964 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-09-08 12:11:01,715 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 12:11:01,874 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-08 12:11:02,154 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-08 12:11:02,339 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-08 12:11:03,720 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2019-09-08 12:11:05,668 WARN L188 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-09-08 12:11:06,370 WARN L188 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-09-08 12:11:07,109 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-08 12:11:07,270 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-08 12:11:07,816 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-08 12:11:13,550 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-08 12:11:18,172 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-08 12:11:23,583 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-08 12:11:50,157 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-09-08 12:11:54,190 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-09-08 12:12:09,437 WARN L188 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-09-08 12:12:12,526 WARN L188 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-09-08 12:16:09,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:09,922 INFO L93 Difference]: Finished difference Result 2160078 states and 2987127 transitions. [2019-09-08 12:16:09,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2019-09-08 12:16:09,923 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2019-09-08 12:16:09,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:13,181 INFO L225 Difference]: With dead ends: 2160078 [2019-09-08 12:16:13,181 INFO L226 Difference]: Without dead ends: 1924688 [2019-09-08 12:16:13,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23946 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=7367, Invalid=48084, Unknown=9, NotChecked=0, Total=55460 [2019-09-08 12:16:15,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924688 states. [2019-09-08 12:18:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924688 to 519320. [2019-09-08 12:18:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519320 states. [2019-09-08 12:18:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519320 states to 519320 states and 726393 transitions. [2019-09-08 12:18:19,364 INFO L78 Accepts]: Start accepts. Automaton has 519320 states and 726393 transitions. Word has length 99 [2019-09-08 12:18:19,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:19,364 INFO L475 AbstractCegarLoop]: Abstraction has 519320 states and 726393 transitions. [2019-09-08 12:18:19,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 12:18:19,364 INFO L276 IsEmpty]: Start isEmpty. Operand 519320 states and 726393 transitions. [2019-09-08 12:18:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:18:19,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:19,374 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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] [2019-09-08 12:18:19,374 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:19,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:19,375 INFO L82 PathProgramCache]: Analyzing trace with hash -764347023, now seen corresponding path program 1 times [2019-09-08 12:18:19,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:19,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:19,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:19,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:19,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:19,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:19,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:18:19,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:18:19,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:18:19,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:18:19,457 INFO L87 Difference]: Start difference. First operand 519320 states and 726393 transitions. Second operand 3 states. [2019-09-08 12:19:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:12,334 INFO L93 Difference]: Finished difference Result 814159 states and 1141753 transitions. [2019-09-08 12:19:12,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:12,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 12:19:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:12,756 INFO L225 Difference]: With dead ends: 814159 [2019-09-08 12:19:12,756 INFO L226 Difference]: Without dead ends: 294879 [2019-09-08 12:19:13,049 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:19:13,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294879 states.