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_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:04:41,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:04:41,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:04:41,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:04:41,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:04:41,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:04:41,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:04:41,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:04:41,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:04:41,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:04:41,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:04:41,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:04:41,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:04:41,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:04:41,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:04:41,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:04:41,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:04:41,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:04:41,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:04:41,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:04:41,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:04:41,303 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:04:41,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:04:41,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:04:41,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:04:41,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:04:41,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:04:41,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:04:41,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:04:41,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:04:41,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:04:41,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:04:41,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:04:41,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:04:41,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:04:41,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:04:41,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:04:41,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:04:41,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:04:41,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:04:41,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:04:41,317 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 13:04:41,331 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:04:41,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:04:41,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:04:41,333 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:04:41,333 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:04:41,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:04:41,334 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:04:41,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:04:41,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:04:41,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:04:41,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:04:41,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:04:41,335 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:04:41,335 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:04:41,336 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:04:41,336 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:04:41,336 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:04:41,336 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:04:41,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:04:41,337 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:04:41,337 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:04:41,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:04:41,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:04:41,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:04:41,338 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:04:41,338 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:04:41,338 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:04:41,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:04:41,339 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:04:41,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:04:41,385 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:04:41,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:04:41,391 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:04:41,391 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:04:41,392 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 13:04:41,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d8f74171/0747c9b762ee41318591ccfa51324aa6/FLAG609cf1ecd [2019-09-08 13:04:42,000 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:04:42,001 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 13:04:42,012 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d8f74171/0747c9b762ee41318591ccfa51324aa6/FLAG609cf1ecd [2019-09-08 13:04:42,316 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d8f74171/0747c9b762ee41318591ccfa51324aa6 [2019-09-08 13:04:42,328 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:04:42,332 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:04:42,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:04:42,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:04:42,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:04:42,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:04:42" (1/1) ... [2019-09-08 13:04:42,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e5c22f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:42, skipping insertion in model container [2019-09-08 13:04:42,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:04:42" (1/1) ... [2019-09-08 13:04:42,349 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:04:42,404 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:04:42,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:04:42,798 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:04:42,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:04:42,932 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:04:42,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:42 WrapperNode [2019-09-08 13:04:42,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:04:42,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:04:42,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:04:42,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:04:42,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:42" (1/1) ... [2019-09-08 13:04:42,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:42" (1/1) ... [2019-09-08 13:04:42,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:42" (1/1) ... [2019-09-08 13:04:42,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:42" (1/1) ... [2019-09-08 13:04:42,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:42" (1/1) ... [2019-09-08 13:04:42,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:42" (1/1) ... [2019-09-08 13:04:42,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:42" (1/1) ... [2019-09-08 13:04:42,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:04:42,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:04:42,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:04:42,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:04:42,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:42" (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 13:04:43,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:04:43,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:04:43,058 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:04:43,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:04:43,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:04:43,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:04:43,058 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:04:43,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:04:43,059 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:04:43,059 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:04:43,059 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:04:43,059 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:04:43,059 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:04:43,060 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:04:43,060 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:04:43,060 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:04:43,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:04:43,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:04:43,926 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:04:43,927 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:04:43,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:04:43 BoogieIcfgContainer [2019-09-08 13:04:43,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:04:43,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:04:43,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:04:43,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:04:43,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:04:42" (1/3) ... [2019-09-08 13:04:43,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dcf4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:04:43, skipping insertion in model container [2019-09-08 13:04:43,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:42" (2/3) ... [2019-09-08 13:04:43,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dcf4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:04:43, skipping insertion in model container [2019-09-08 13:04:43,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:04:43" (3/3) ... [2019-09-08 13:04:43,944 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 13:04:43,956 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:04:43,984 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:04:44,007 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:04:44,041 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:04:44,042 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:04:44,042 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:04:44,042 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:04:44,042 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:04:44,043 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:04:44,043 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:04:44,043 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:04:44,043 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:04:44,066 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-09-08 13:04:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 13:04:44,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:44,079 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 13:04:44,082 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:44,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:44,089 INFO L82 PathProgramCache]: Analyzing trace with hash -902016562, now seen corresponding path program 1 times [2019-09-08 13:04:44,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:44,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:44,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:44,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:44,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:44,598 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 13:04:44,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:44,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:44,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:44,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:44,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:44,626 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 3 states. [2019-09-08 13:04:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:44,748 INFO L93 Difference]: Finished difference Result 330 states and 554 transitions. [2019-09-08 13:04:44,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:44,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 13:04:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:44,775 INFO L225 Difference]: With dead ends: 330 [2019-09-08 13:04:44,776 INFO L226 Difference]: Without dead ends: 229 [2019-09-08 13:04:44,785 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 13:04:44,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-08 13:04:44,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2019-09-08 13:04:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-08 13:04:44,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 353 transitions. [2019-09-08 13:04:44,872 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 353 transitions. Word has length 66 [2019-09-08 13:04:44,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:44,873 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 353 transitions. [2019-09-08 13:04:44,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 353 transitions. [2019-09-08 13:04:44,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 13:04:44,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:44,878 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 13:04:44,878 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:44,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:44,879 INFO L82 PathProgramCache]: Analyzing trace with hash 730168783, now seen corresponding path program 1 times [2019-09-08 13:04:44,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:44,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:44,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:44,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:44,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:45,066 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 13:04:45,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:45,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:45,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:45,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:45,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:45,075 INFO L87 Difference]: Start difference. First operand 227 states and 353 transitions. Second operand 3 states. [2019-09-08 13:04:45,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:45,170 INFO L93 Difference]: Finished difference Result 543 states and 873 transitions. [2019-09-08 13:04:45,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:45,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 13:04:45,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:45,176 INFO L225 Difference]: With dead ends: 543 [2019-09-08 13:04:45,176 INFO L226 Difference]: Without dead ends: 377 [2019-09-08 13:04:45,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 13:04:45,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-08 13:04:45,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2019-09-08 13:04:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-08 13:04:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 596 transitions. [2019-09-08 13:04:45,223 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 596 transitions. Word has length 68 [2019-09-08 13:04:45,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:45,223 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 596 transitions. [2019-09-08 13:04:45,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 596 transitions. [2019-09-08 13:04:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 13:04:45,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:45,228 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 13:04:45,228 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:45,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:45,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1550224880, now seen corresponding path program 1 times [2019-09-08 13:04:45,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:45,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:45,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:45,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:45,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:45,404 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 13:04:45,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:45,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:45,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:45,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:45,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:45,405 INFO L87 Difference]: Start difference. First operand 375 states and 596 transitions. Second operand 3 states. [2019-09-08 13:04:45,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:45,474 INFO L93 Difference]: Finished difference Result 971 states and 1574 transitions. [2019-09-08 13:04:45,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:45,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-08 13:04:45,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:45,484 INFO L225 Difference]: With dead ends: 971 [2019-09-08 13:04:45,484 INFO L226 Difference]: Without dead ends: 657 [2019-09-08 13:04:45,489 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 13:04:45,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-08 13:04:45,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 655. [2019-09-08 13:04:45,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-09-08 13:04:45,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1052 transitions. [2019-09-08 13:04:45,560 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1052 transitions. Word has length 70 [2019-09-08 13:04:45,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:45,561 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 1052 transitions. [2019-09-08 13:04:45,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1052 transitions. [2019-09-08 13:04:45,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 13:04:45,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:45,574 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:45,574 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:45,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:45,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2032710127, now seen corresponding path program 1 times [2019-09-08 13:04:45,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:45,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:45,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:45,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:45,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:45,733 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 13:04:45,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:45,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:04:45,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:04:45,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:04:45,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:04:45,735 INFO L87 Difference]: Start difference. First operand 655 states and 1052 transitions. Second operand 5 states. [2019-09-08 13:04:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:45,943 INFO L93 Difference]: Finished difference Result 2187 states and 3582 transitions. [2019-09-08 13:04:45,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:04:45,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-08 13:04:45,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:45,953 INFO L225 Difference]: With dead ends: 2187 [2019-09-08 13:04:45,953 INFO L226 Difference]: Without dead ends: 1593 [2019-09-08 13:04:45,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:04:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2019-09-08 13:04:46,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1421. [2019-09-08 13:04:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2019-09-08 13:04:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2313 transitions. [2019-09-08 13:04:46,037 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2313 transitions. Word has length 72 [2019-09-08 13:04:46,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:46,037 INFO L475 AbstractCegarLoop]: Abstraction has 1421 states and 2313 transitions. [2019-09-08 13:04:46,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:04:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2313 transitions. [2019-09-08 13:04:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 13:04:46,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:46,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, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:46,040 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:46,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:46,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1348885045, now seen corresponding path program 1 times [2019-09-08 13:04:46,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:46,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:46,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:46,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:46,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:46,154 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 13:04:46,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:46,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:04:46,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:04:46,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:04:46,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:04:46,156 INFO L87 Difference]: Start difference. First operand 1421 states and 2313 transitions. Second operand 6 states. [2019-09-08 13:04:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:46,521 INFO L93 Difference]: Finished difference Result 5599 states and 9165 transitions. [2019-09-08 13:04:46,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 13:04:46,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-09-08 13:04:46,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:46,547 INFO L225 Difference]: With dead ends: 5599 [2019-09-08 13:04:46,547 INFO L226 Difference]: Without dead ends: 4239 [2019-09-08 13:04:46,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:04:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4239 states. [2019-09-08 13:04:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4239 to 4136. [2019-09-08 13:04:46,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4136 states. [2019-09-08 13:04:46,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4136 states to 4136 states and 6750 transitions. [2019-09-08 13:04:46,825 INFO L78 Accepts]: Start accepts. Automaton has 4136 states and 6750 transitions. Word has length 73 [2019-09-08 13:04:46,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:46,825 INFO L475 AbstractCegarLoop]: Abstraction has 4136 states and 6750 transitions. [2019-09-08 13:04:46,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:04:46,826 INFO L276 IsEmpty]: Start isEmpty. Operand 4136 states and 6750 transitions. [2019-09-08 13:04:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 13:04:46,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:46,829 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:46,829 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:46,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:46,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1795572021, now seen corresponding path program 1 times [2019-09-08 13:04:46,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:46,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:46,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:46,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:46,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:46,915 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 13:04:46,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:46,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:46,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:46,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:46,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:46,917 INFO L87 Difference]: Start difference. First operand 4136 states and 6750 transitions. Second operand 3 states. [2019-09-08 13:04:47,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:47,349 INFO L93 Difference]: Finished difference Result 9044 states and 14832 transitions. [2019-09-08 13:04:47,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:47,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 13:04:47,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:47,382 INFO L225 Difference]: With dead ends: 9044 [2019-09-08 13:04:47,383 INFO L226 Difference]: Without dead ends: 6131 [2019-09-08 13:04:47,390 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 13:04:47,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6131 states. [2019-09-08 13:04:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6131 to 6129. [2019-09-08 13:04:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6129 states. [2019-09-08 13:04:47,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6129 states to 6129 states and 9981 transitions. [2019-09-08 13:04:47,810 INFO L78 Accepts]: Start accepts. Automaton has 6129 states and 9981 transitions. Word has length 74 [2019-09-08 13:04:47,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:47,811 INFO L475 AbstractCegarLoop]: Abstraction has 6129 states and 9981 transitions. [2019-09-08 13:04:47,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:47,811 INFO L276 IsEmpty]: Start isEmpty. Operand 6129 states and 9981 transitions. [2019-09-08 13:04:47,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 13:04:47,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:47,813 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:47,813 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:47,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:47,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1561348457, now seen corresponding path program 1 times [2019-09-08 13:04:47,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:47,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:47,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:47,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:47,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:47,889 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 13:04:47,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:47,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:47,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:47,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:47,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:47,892 INFO L87 Difference]: Start difference. First operand 6129 states and 9981 transitions. Second operand 3 states. [2019-09-08 13:04:48,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:48,335 INFO L93 Difference]: Finished difference Result 12027 states and 19634 transitions. [2019-09-08 13:04:48,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:48,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 13:04:48,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:48,383 INFO L225 Difference]: With dead ends: 12027 [2019-09-08 13:04:48,384 INFO L226 Difference]: Without dead ends: 8439 [2019-09-08 13:04:48,395 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 13:04:48,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8439 states. [2019-09-08 13:04:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8439 to 8437. [2019-09-08 13:04:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8437 states. [2019-09-08 13:04:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8437 states to 8437 states and 13683 transitions. [2019-09-08 13:04:48,975 INFO L78 Accepts]: Start accepts. Automaton has 8437 states and 13683 transitions. Word has length 74 [2019-09-08 13:04:48,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:48,975 INFO L475 AbstractCegarLoop]: Abstraction has 8437 states and 13683 transitions. [2019-09-08 13:04:48,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 8437 states and 13683 transitions. [2019-09-08 13:04:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 13:04:48,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:48,977 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:48,978 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:48,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:48,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1191289000, now seen corresponding path program 1 times [2019-09-08 13:04:48,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:48,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:48,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:48,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:48,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:49,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 13:04:49,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:49,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:04:49,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:04:49,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:04:49,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:04:49,073 INFO L87 Difference]: Start difference. First operand 8437 states and 13683 transitions. Second operand 4 states. [2019-09-08 13:04:49,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:49,688 INFO L93 Difference]: Finished difference Result 21121 states and 34309 transitions. [2019-09-08 13:04:49,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:04:49,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-09-08 13:04:49,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:49,896 INFO L225 Difference]: With dead ends: 21121 [2019-09-08 13:04:49,896 INFO L226 Difference]: Without dead ends: 13079 [2019-09-08 13:04:49,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:04:49,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13079 states. [2019-09-08 13:04:50,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13079 to 13035. [2019-09-08 13:04:50,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13035 states. [2019-09-08 13:04:50,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13035 states to 13035 states and 21086 transitions. [2019-09-08 13:04:50,472 INFO L78 Accepts]: Start accepts. Automaton has 13035 states and 21086 transitions. Word has length 74 [2019-09-08 13:04:50,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:50,472 INFO L475 AbstractCegarLoop]: Abstraction has 13035 states and 21086 transitions. [2019-09-08 13:04:50,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:04:50,472 INFO L276 IsEmpty]: Start isEmpty. Operand 13035 states and 21086 transitions. [2019-09-08 13:04:50,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 13:04:50,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:50,474 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:50,474 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:50,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:50,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1031073657, now seen corresponding path program 1 times [2019-09-08 13:04:50,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:50,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:50,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:50,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:50,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:04:50,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:50,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:50,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:50,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:50,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:50,685 INFO L87 Difference]: Start difference. First operand 13035 states and 21086 transitions. Second operand 3 states. [2019-09-08 13:04:51,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:51,405 INFO L93 Difference]: Finished difference Result 26195 states and 42422 transitions. [2019-09-08 13:04:51,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:51,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 13:04:51,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:51,474 INFO L225 Difference]: With dead ends: 26195 [2019-09-08 13:04:51,474 INFO L226 Difference]: Without dead ends: 17770 [2019-09-08 13:04:51,502 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 13:04:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17770 states. [2019-09-08 13:04:52,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17770 to 17768. [2019-09-08 13:04:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17768 states. [2019-09-08 13:04:52,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17768 states to 17768 states and 28544 transitions. [2019-09-08 13:04:52,915 INFO L78 Accepts]: Start accepts. Automaton has 17768 states and 28544 transitions. Word has length 74 [2019-09-08 13:04:52,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:52,915 INFO L475 AbstractCegarLoop]: Abstraction has 17768 states and 28544 transitions. [2019-09-08 13:04:52,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:52,916 INFO L276 IsEmpty]: Start isEmpty. Operand 17768 states and 28544 transitions. [2019-09-08 13:04:52,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 13:04:52,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:52,917 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:52,917 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:52,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:52,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1672252252, now seen corresponding path program 1 times [2019-09-08 13:04:52,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:52,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:52,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:52,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:52,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:53,021 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 13:04:53,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:53,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:04:53,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:04:53,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:04:53,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:04:53,024 INFO L87 Difference]: Start difference. First operand 17768 states and 28544 transitions. Second operand 4 states. [2019-09-08 13:04:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:54,652 INFO L93 Difference]: Finished difference Result 57121 states and 91905 transitions. [2019-09-08 13:04:54,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:04:54,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-08 13:04:54,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:54,751 INFO L225 Difference]: With dead ends: 57121 [2019-09-08 13:04:54,752 INFO L226 Difference]: Without dead ends: 39448 [2019-09-08 13:04:54,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:04:54,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39448 states. [2019-09-08 13:04:56,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39448 to 26203. [2019-09-08 13:04:56,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26203 states. [2019-09-08 13:04:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26203 states to 26203 states and 41961 transitions. [2019-09-08 13:04:56,782 INFO L78 Accepts]: Start accepts. Automaton has 26203 states and 41961 transitions. Word has length 75 [2019-09-08 13:04:56,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:56,786 INFO L475 AbstractCegarLoop]: Abstraction has 26203 states and 41961 transitions. [2019-09-08 13:04:56,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:04:56,787 INFO L276 IsEmpty]: Start isEmpty. Operand 26203 states and 41961 transitions. [2019-09-08 13:04:56,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 13:04:56,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:56,789 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:56,789 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:56,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:56,789 INFO L82 PathProgramCache]: Analyzing trace with hash -772989972, now seen corresponding path program 1 times [2019-09-08 13:04:56,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:56,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:56,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:56,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:56,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:56,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:04:56,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:56,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:04:56,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:04:56,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:04:56,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:04:56,969 INFO L87 Difference]: Start difference. First operand 26203 states and 41961 transitions. Second operand 5 states. [2019-09-08 13:04:58,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:58,162 INFO L93 Difference]: Finished difference Result 54283 states and 87000 transitions. [2019-09-08 13:04:58,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:04:58,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 13:04:58,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:58,236 INFO L225 Difference]: With dead ends: 54283 [2019-09-08 13:04:58,236 INFO L226 Difference]: Without dead ends: 28175 [2019-09-08 13:04:58,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:04:58,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28175 states. [2019-09-08 13:04:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28175 to 26203. [2019-09-08 13:04:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26203 states. [2019-09-08 13:04:59,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26203 states to 26203 states and 41826 transitions. [2019-09-08 13:04:59,476 INFO L78 Accepts]: Start accepts. Automaton has 26203 states and 41826 transitions. Word has length 77 [2019-09-08 13:04:59,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:59,477 INFO L475 AbstractCegarLoop]: Abstraction has 26203 states and 41826 transitions. [2019-09-08 13:04:59,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:04:59,477 INFO L276 IsEmpty]: Start isEmpty. Operand 26203 states and 41826 transitions. [2019-09-08 13:04:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 13:04:59,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:59,478 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:59,479 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:59,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:59,479 INFO L82 PathProgramCache]: Analyzing trace with hash -579116247, now seen corresponding path program 1 times [2019-09-08 13:04:59,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:59,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:59,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:59,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:59,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:59,645 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 13:04:59,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:59,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:04:59,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:04:59,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:04:59,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:04:59,646 INFO L87 Difference]: Start difference. First operand 26203 states and 41826 transitions. Second operand 5 states. [2019-09-08 13:05:02,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:02,527 INFO L93 Difference]: Finished difference Result 84907 states and 135887 transitions. [2019-09-08 13:05:02,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:05:02,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-08 13:05:02,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:02,648 INFO L225 Difference]: With dead ends: 84907 [2019-09-08 13:05:02,648 INFO L226 Difference]: Without dead ends: 58799 [2019-09-08 13:05:02,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:05:02,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58799 states. [2019-09-08 13:05:04,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58799 to 36841. [2019-09-08 13:05:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36841 states. [2019-09-08 13:05:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36841 states to 36841 states and 58607 transitions. [2019-09-08 13:05:04,266 INFO L78 Accepts]: Start accepts. Automaton has 36841 states and 58607 transitions. Word has length 80 [2019-09-08 13:05:04,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:04,266 INFO L475 AbstractCegarLoop]: Abstraction has 36841 states and 58607 transitions. [2019-09-08 13:05:04,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:05:04,267 INFO L276 IsEmpty]: Start isEmpty. Operand 36841 states and 58607 transitions. [2019-09-08 13:05:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 13:05:04,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:04,267 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:04,267 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:04,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:04,268 INFO L82 PathProgramCache]: Analyzing trace with hash -774643767, now seen corresponding path program 1 times [2019-09-08 13:05:04,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:04,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:04,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:04,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:04,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:04,379 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 13:05:04,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:04,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:05:04,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:05:04,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:05:04,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:05:04,381 INFO L87 Difference]: Start difference. First operand 36841 states and 58607 transitions. Second operand 5 states. [2019-09-08 13:05:06,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:06,562 INFO L93 Difference]: Finished difference Result 65272 states and 103275 transitions. [2019-09-08 13:05:06,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:05:06,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 13:05:06,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:06,718 INFO L225 Difference]: With dead ends: 65272 [2019-09-08 13:05:06,718 INFO L226 Difference]: Without dead ends: 65270 [2019-09-08 13:05:06,749 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 13:05:06,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65270 states. [2019-09-08 13:05:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65270 to 37697. [2019-09-08 13:05:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37697 states. [2019-09-08 13:05:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37697 states to 37697 states and 59454 transitions. [2019-09-08 13:05:09,548 INFO L78 Accepts]: Start accepts. Automaton has 37697 states and 59454 transitions. Word has length 81 [2019-09-08 13:05:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:09,549 INFO L475 AbstractCegarLoop]: Abstraction has 37697 states and 59454 transitions. [2019-09-08 13:05:09,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:05:09,549 INFO L276 IsEmpty]: Start isEmpty. Operand 37697 states and 59454 transitions. [2019-09-08 13:05:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 13:05:09,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:09,553 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-09-08 13:05:09,554 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:09,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1389875202, now seen corresponding path program 1 times [2019-09-08 13:05:09,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:09,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:09,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:09,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:09,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:09,679 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 13:05:09,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:09,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:05:09,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:05:09,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:05:09,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:05:09,681 INFO L87 Difference]: Start difference. First operand 37697 states and 59454 transitions. Second operand 5 states. [2019-09-08 13:05:11,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:11,642 INFO L93 Difference]: Finished difference Result 61813 states and 97966 transitions. [2019-09-08 13:05:11,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:05:11,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-08 13:05:11,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:11,708 INFO L225 Difference]: With dead ends: 61813 [2019-09-08 13:05:11,709 INFO L226 Difference]: Without dead ends: 43482 [2019-09-08 13:05:11,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:05:11,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43482 states. [2019-09-08 13:05:13,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43482 to 42943. [2019-09-08 13:05:13,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42943 states. [2019-09-08 13:05:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42943 states to 42943 states and 67653 transitions. [2019-09-08 13:05:13,654 INFO L78 Accepts]: Start accepts. Automaton has 42943 states and 67653 transitions. Word has length 105 [2019-09-08 13:05:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:13,655 INFO L475 AbstractCegarLoop]: Abstraction has 42943 states and 67653 transitions. [2019-09-08 13:05:13,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:05:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 42943 states and 67653 transitions. [2019-09-08 13:05:13,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 13:05:13,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:13,657 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-09-08 13:05:13,657 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:13,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:13,658 INFO L82 PathProgramCache]: Analyzing trace with hash 451828384, now seen corresponding path program 1 times [2019-09-08 13:05:13,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:13,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:13,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 13:05:13,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:13,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:05:13,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:05:13,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:05:13,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:05:13,779 INFO L87 Difference]: Start difference. First operand 42943 states and 67653 transitions. Second operand 5 states. [2019-09-08 13:05:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:16,332 INFO L93 Difference]: Finished difference Result 52275 states and 82551 transitions. [2019-09-08 13:05:16,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:05:16,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-08 13:05:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:16,396 INFO L225 Difference]: With dead ends: 52275 [2019-09-08 13:05:16,396 INFO L226 Difference]: Without dead ends: 47113 [2019-09-08 13:05:16,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:05:16,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47113 states. [2019-09-08 13:05:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47113 to 45863. [2019-09-08 13:05:18,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45863 states. [2019-09-08 13:05:18,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45863 states to 45863 states and 72269 transitions. [2019-09-08 13:05:18,297 INFO L78 Accepts]: Start accepts. Automaton has 45863 states and 72269 transitions. Word has length 105 [2019-09-08 13:05:18,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:18,297 INFO L475 AbstractCegarLoop]: Abstraction has 45863 states and 72269 transitions. [2019-09-08 13:05:18,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:05:18,297 INFO L276 IsEmpty]: Start isEmpty. Operand 45863 states and 72269 transitions. [2019-09-08 13:05:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 13:05:18,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:18,300 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-09-08 13:05:18,301 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:18,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2140593730, now seen corresponding path program 1 times [2019-09-08 13:05:18,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:18,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:18,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:18,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:18,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:18,401 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:05:18,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 13:05:18,402 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 13:05:18,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:18,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 13:05:18,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 13:05:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-08 13:05:18,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 13:05:18,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 13:05:18,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:05:18,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:05:18,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:05:18,688 INFO L87 Difference]: Start difference. First operand 45863 states and 72269 transitions. Second operand 8 states. [2019-09-08 13:05:24,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:24,010 INFO L93 Difference]: Finished difference Result 95528 states and 151475 transitions. [2019-09-08 13:05:24,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:05:24,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2019-09-08 13:05:24,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:24,433 INFO L225 Difference]: With dead ends: 95528 [2019-09-08 13:05:24,434 INFO L226 Difference]: Without dead ends: 74562 [2019-09-08 13:05:24,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-09-08 13:05:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74562 states. [2019-09-08 13:05:29,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74562 to 70816. [2019-09-08 13:05:29,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70816 states. [2019-09-08 13:05:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70816 states to 70816 states and 112007 transitions. [2019-09-08 13:05:29,984 INFO L78 Accepts]: Start accepts. Automaton has 70816 states and 112007 transitions. Word has length 105 [2019-09-08 13:05:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:29,984 INFO L475 AbstractCegarLoop]: Abstraction has 70816 states and 112007 transitions. [2019-09-08 13:05:29,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:05:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 70816 states and 112007 transitions. [2019-09-08 13:05:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 13:05:29,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:29,989 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2019-09-08 13:05:29,989 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:29,990 INFO L82 PathProgramCache]: Analyzing trace with hash 134984115, now seen corresponding path program 1 times [2019-09-08 13:05:29,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:29,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:29,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:29,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:29,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 13:05:30,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:30,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:05:30,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:05:30,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:05:30,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:30,078 INFO L87 Difference]: Start difference. First operand 70816 states and 112007 transitions. Second operand 3 states. [2019-09-08 13:05:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:36,060 INFO L93 Difference]: Finished difference Result 167583 states and 266182 transitions. [2019-09-08 13:05:36,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:05:36,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 13:05:36,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:36,293 INFO L225 Difference]: With dead ends: 167583 [2019-09-08 13:05:36,294 INFO L226 Difference]: Without dead ends: 121033 [2019-09-08 13:05:36,380 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 13:05:36,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121033 states. [2019-09-08 13:05:43,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121033 to 120759. [2019-09-08 13:05:43,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120759 states. [2019-09-08 13:05:43,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120759 states to 120759 states and 191248 transitions. [2019-09-08 13:05:43,718 INFO L78 Accepts]: Start accepts. Automaton has 120759 states and 191248 transitions. Word has length 106 [2019-09-08 13:05:43,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:43,718 INFO L475 AbstractCegarLoop]: Abstraction has 120759 states and 191248 transitions. [2019-09-08 13:05:43,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:05:43,719 INFO L276 IsEmpty]: Start isEmpty. Operand 120759 states and 191248 transitions. [2019-09-08 13:05:43,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 13:05:43,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:43,722 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2019-09-08 13:05:43,722 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:43,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:43,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1864454230, now seen corresponding path program 1 times [2019-09-08 13:05:43,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:43,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:43,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:43,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:43,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:05:43,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:43,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:05:43,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:05:43,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:05:43,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:43,792 INFO L87 Difference]: Start difference. First operand 120759 states and 191248 transitions. Second operand 3 states. [2019-09-08 13:05:55,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:55,633 INFO L93 Difference]: Finished difference Result 354771 states and 561331 transitions. [2019-09-08 13:05:55,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:05:55,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-08 13:05:55,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:56,066 INFO L225 Difference]: With dead ends: 354771 [2019-09-08 13:05:56,066 INFO L226 Difference]: Without dead ends: 234107 [2019-09-08 13:05:56,192 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 13:05:56,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234107 states. [2019-09-08 13:06:11,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234107 to 234105. [2019-09-08 13:06:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234105 states. [2019-09-08 13:06:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234105 states to 234105 states and 367877 transitions. [2019-09-08 13:06:11,929 INFO L78 Accepts]: Start accepts. Automaton has 234105 states and 367877 transitions. Word has length 107 [2019-09-08 13:06:11,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:11,929 INFO L475 AbstractCegarLoop]: Abstraction has 234105 states and 367877 transitions. [2019-09-08 13:06:11,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:06:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 234105 states and 367877 transitions. [2019-09-08 13:06:11,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 13:06:11,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:11,934 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:06:11,935 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:11,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:11,935 INFO L82 PathProgramCache]: Analyzing trace with hash 720900890, now seen corresponding path program 1 times [2019-09-08 13:06:11,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:11,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:11,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:11,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:11,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:12,364 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 13:06:12,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:12,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:06:12,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:06:12,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:06:12,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:06:12,368 INFO L87 Difference]: Start difference. First operand 234105 states and 367877 transitions. Second operand 6 states. [2019-09-08 13:06:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:32,755 INFO L93 Difference]: Finished difference Result 498688 states and 787325 transitions. [2019-09-08 13:06:32,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:06:32,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2019-09-08 13:06:32,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:33,501 INFO L225 Difference]: With dead ends: 498688 [2019-09-08 13:06:33,502 INFO L226 Difference]: Without dead ends: 389368 [2019-09-08 13:06:33,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:06:33,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389368 states. [2019-09-08 13:07:02,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389368 to 344413. [2019-09-08 13:07:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344413 states. [2019-09-08 13:07:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344413 states to 344413 states and 541687 transitions. [2019-09-08 13:07:02,651 INFO L78 Accepts]: Start accepts. Automaton has 344413 states and 541687 transitions. Word has length 107 [2019-09-08 13:07:02,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:02,651 INFO L475 AbstractCegarLoop]: Abstraction has 344413 states and 541687 transitions. [2019-09-08 13:07:02,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:07:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand 344413 states and 541687 transitions. [2019-09-08 13:07:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 13:07:02,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:02,655 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:02,655 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:02,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:02,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1871521224, now seen corresponding path program 1 times [2019-09-08 13:07:02,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:02,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:02,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:02,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:02,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:02,730 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:02,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:02,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:07:02,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:07:02,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:07:02,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:02,732 INFO L87 Difference]: Start difference. First operand 344413 states and 541687 transitions. Second operand 3 states. [2019-09-08 13:07:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:25,690 INFO L93 Difference]: Finished difference Result 639783 states and 1006619 transitions. [2019-09-08 13:07:25,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:07:25,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-08 13:07:25,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:26,243 INFO L225 Difference]: With dead ends: 639783 [2019-09-08 13:07:26,243 INFO L226 Difference]: Without dead ends: 295543 [2019-09-08 13:07:26,479 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 13:07:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295543 states. [2019-09-08 13:07:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295543 to 295541. [2019-09-08 13:07:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295541 states. [2019-09-08 13:07:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295541 states to 295541 states and 462209 transitions. [2019-09-08 13:07:43,314 INFO L78 Accepts]: Start accepts. Automaton has 295541 states and 462209 transitions. Word has length 107 [2019-09-08 13:07:43,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:43,315 INFO L475 AbstractCegarLoop]: Abstraction has 295541 states and 462209 transitions. [2019-09-08 13:07:43,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:07:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand 295541 states and 462209 transitions. [2019-09-08 13:07:43,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 13:07:43,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:43,317 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:43,317 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:43,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:43,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1819747193, now seen corresponding path program 1 times [2019-09-08 13:07:43,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:43,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:43,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:43,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:43,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 13:07:43,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:43,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:07:43,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:07:43,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:07:43,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:07:43,711 INFO L87 Difference]: Start difference. First operand 295541 states and 462209 transitions. Second operand 6 states. [2019-09-08 13:08:18,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:18,256 INFO L93 Difference]: Finished difference Result 713501 states and 1120164 transitions. [2019-09-08 13:08:18,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:08:18,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2019-09-08 13:08:18,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:19,335 INFO L225 Difference]: With dead ends: 713501 [2019-09-08 13:08:19,335 INFO L226 Difference]: Without dead ends: 541094 [2019-09-08 13:08:19,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:08:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541094 states. [2019-09-08 13:08:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541094 to 467666. [2019-09-08 13:08:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467666 states. [2019-09-08 13:08:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467666 states to 467666 states and 731478 transitions. [2019-09-08 13:08:55,866 INFO L78 Accepts]: Start accepts. Automaton has 467666 states and 731478 transitions. Word has length 108 [2019-09-08 13:08:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:55,866 INFO L475 AbstractCegarLoop]: Abstraction has 467666 states and 731478 transitions. [2019-09-08 13:08:55,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:08:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 467666 states and 731478 transitions. [2019-09-08 13:08:55,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 13:08:55,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:55,868 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:08:55,868 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:55,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:55,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1697967367, now seen corresponding path program 1 times [2019-09-08 13:08:55,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:55,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:55,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:55,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:55,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:08:55,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:55,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:08:55,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:08:55,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:08:55,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:55,951 INFO L87 Difference]: Start difference. First operand 467666 states and 731478 transitions. Second operand 3 states. [2019-09-08 13:10:01,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:01,032 INFO L93 Difference]: Finished difference Result 1375482 states and 2148726 transitions. [2019-09-08 13:10:01,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:01,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-08 13:10:01,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:03,114 INFO L225 Difference]: With dead ends: 1375482 [2019-09-08 13:10:03,114 INFO L226 Difference]: Without dead ends: 907961 [2019-09-08 13:10:03,588 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 13:10:04,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907961 states. [2019-09-08 13:11:23,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907961 to 907959. [2019-09-08 13:11:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907959 states. [2019-09-08 13:11:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907959 states to 907959 states and 1408523 transitions. [2019-09-08 13:11:25,549 INFO L78 Accepts]: Start accepts. Automaton has 907959 states and 1408523 transitions. Word has length 108 [2019-09-08 13:11:25,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:11:25,549 INFO L475 AbstractCegarLoop]: Abstraction has 907959 states and 1408523 transitions. [2019-09-08 13:11:25,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:11:25,550 INFO L276 IsEmpty]: Start isEmpty. Operand 907959 states and 1408523 transitions. [2019-09-08 13:11:25,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 13:11:25,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:11:25,552 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:11:25,552 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:11:25,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:11:25,552 INFO L82 PathProgramCache]: Analyzing trace with hash -2063874521, now seen corresponding path program 1 times [2019-09-08 13:11:25,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:11:25,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:11:25,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:25,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:11:25,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:11:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 13:11:25,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:11:25,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:11:25,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:11:25,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:11:25,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:11:25,627 INFO L87 Difference]: Start difference. First operand 907959 states and 1408523 transitions. Second operand 3 states. [2019-09-08 13:13:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:13:19,180 INFO L93 Difference]: Finished difference Result 2248925 states and 3491719 transitions. [2019-09-08 13:13:19,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:13:19,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-08 13:13:19,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:13:22,406 INFO L225 Difference]: With dead ends: 2248925 [2019-09-08 13:13:22,406 INFO L226 Difference]: Without dead ends: 1341245 [2019-09-08 13:13:23,224 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 13:13:24,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341245 states.