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_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:40:06,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:40:06,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:40:06,316 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:40:06,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:40:06,317 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:40:06,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:40:06,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:40:06,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:40:06,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:40:06,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:40:06,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:40:06,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:40:06,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:40:06,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:40:06,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:40:06,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:40:06,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:40:06,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:40:06,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:40:06,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:40:06,344 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:40:06,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:40:06,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:40:06,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:40:06,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:40:06,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:40:06,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:40:06,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:40:06,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:40:06,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:40:06,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:40:06,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:40:06,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:40:06,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:40:06,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:40:06,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:40:06,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:40:06,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:40:06,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:40:06,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:40:06,373 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 09:40:06,390 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:40:06,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:40:06,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:40:06,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:40:06,392 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:40:06,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:40:06,393 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:40:06,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:40:06,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:40:06,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:40:06,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:40:06,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:40:06,394 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:40:06,394 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:40:06,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:40:06,394 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:40:06,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:40:06,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:40:06,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:40:06,395 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:40:06,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:40:06,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:40:06,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:40:06,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:40:06,396 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:40:06,397 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:40:06,397 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:40:06,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:40:06,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:40:06,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:40:06,442 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:40:06,446 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:40:06,448 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:40:06,448 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:40:06,449 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 09:40:06,518 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae4dfea1d/f6e4e3527b9f4bdfbe499fd4a48f6f88/FLAG75e1d226d [2019-09-08 09:40:07,132 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:40:07,133 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 09:40:07,146 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae4dfea1d/f6e4e3527b9f4bdfbe499fd4a48f6f88/FLAG75e1d226d [2019-09-08 09:40:07,331 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae4dfea1d/f6e4e3527b9f4bdfbe499fd4a48f6f88 [2019-09-08 09:40:07,345 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:40:07,347 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:40:07,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:40:07,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:40:07,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:40:07,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:40:07" (1/1) ... [2019-09-08 09:40:07,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f3b254f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:07, skipping insertion in model container [2019-09-08 09:40:07,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:40:07" (1/1) ... [2019-09-08 09:40:07,368 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:40:07,450 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:40:07,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:40:07,996 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:40:08,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:40:08,189 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:40:08,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08 WrapperNode [2019-09-08 09:40:08,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:40:08,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:40:08,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:40:08,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:40:08,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08" (1/1) ... [2019-09-08 09:40:08,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08" (1/1) ... [2019-09-08 09:40:08,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08" (1/1) ... [2019-09-08 09:40:08,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08" (1/1) ... [2019-09-08 09:40:08,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08" (1/1) ... [2019-09-08 09:40:08,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08" (1/1) ... [2019-09-08 09:40:08,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08" (1/1) ... [2019-09-08 09:40:08,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:40:08,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:40:08,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:40:08,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:40:08,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08" (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 09:40:08,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:40:08,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:40:08,379 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:40:08,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:40:08,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:40:08,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 09:40:08,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:40:08,381 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:40:08,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:40:08,381 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:40:08,381 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:40:08,382 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:40:08,382 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:40:08,383 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:40:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:40:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:40:08,386 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:40:08,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:40:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:40:10,047 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:40:10,049 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:40:10,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:40:10 BoogieIcfgContainer [2019-09-08 09:40:10,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:40:10,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:40:10,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:40:10,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:40:10,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:40:07" (1/3) ... [2019-09-08 09:40:10,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dbd988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:40:10, skipping insertion in model container [2019-09-08 09:40:10,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08" (2/3) ... [2019-09-08 09:40:10,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dbd988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:40:10, skipping insertion in model container [2019-09-08 09:40:10,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:40:10" (3/3) ... [2019-09-08 09:40:10,059 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 09:40:10,069 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:40:10,078 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:40:10,095 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:40:10,131 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:40:10,132 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:40:10,132 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:40:10,132 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:40:10,132 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:40:10,133 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:40:10,133 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:40:10,133 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:40:10,133 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:40:10,160 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states. [2019-09-08 09:40:10,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 09:40:10,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:10,179 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:10,181 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:10,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:10,186 INFO L82 PathProgramCache]: Analyzing trace with hash 885340602, now seen corresponding path program 1 times [2019-09-08 09:40:10,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:10,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:10,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:10,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:10,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:10,943 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 09:40:10,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:10,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:10,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:10,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:10,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:10,972 INFO L87 Difference]: Start difference. First operand 317 states. Second operand 3 states. [2019-09-08 09:40:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:11,243 INFO L93 Difference]: Finished difference Result 641 states and 1120 transitions. [2019-09-08 09:40:11,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:11,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-08 09:40:11,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:11,290 INFO L225 Difference]: With dead ends: 641 [2019-09-08 09:40:11,291 INFO L226 Difference]: Without dead ends: 514 [2019-09-08 09:40:11,296 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 09:40:11,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-09-08 09:40:11,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2019-09-08 09:40:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-09-08 09:40:11,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 761 transitions. [2019-09-08 09:40:11,399 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 761 transitions. Word has length 150 [2019-09-08 09:40:11,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:11,400 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 761 transitions. [2019-09-08 09:40:11,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:11,401 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 761 transitions. [2019-09-08 09:40:11,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 09:40:11,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:11,406 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:11,407 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:11,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:11,407 INFO L82 PathProgramCache]: Analyzing trace with hash -20093490, now seen corresponding path program 1 times [2019-09-08 09:40:11,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:11,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:11,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:11,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:11,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:11,616 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 09:40:11,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:11,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:11,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:11,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:11,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:11,619 INFO L87 Difference]: Start difference. First operand 512 states and 761 transitions. Second operand 3 states. [2019-09-08 09:40:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:11,733 INFO L93 Difference]: Finished difference Result 1076 states and 1646 transitions. [2019-09-08 09:40:11,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:11,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-08 09:40:11,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:11,741 INFO L225 Difference]: With dead ends: 1076 [2019-09-08 09:40:11,741 INFO L226 Difference]: Without dead ends: 884 [2019-09-08 09:40:11,744 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 09:40:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-09-08 09:40:11,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 882. [2019-09-08 09:40:11,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-09-08 09:40:11,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1323 transitions. [2019-09-08 09:40:11,791 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1323 transitions. Word has length 150 [2019-09-08 09:40:11,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:11,793 INFO L475 AbstractCegarLoop]: Abstraction has 882 states and 1323 transitions. [2019-09-08 09:40:11,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:11,794 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1323 transitions. [2019-09-08 09:40:11,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 09:40:11,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:11,806 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:11,806 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:11,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:11,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1175617460, now seen corresponding path program 1 times [2019-09-08 09:40:11,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:11,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:11,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:11,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:11,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:12,203 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 09:40:12,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:12,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:12,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:12,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:12,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:12,206 INFO L87 Difference]: Start difference. First operand 882 states and 1323 transitions. Second operand 4 states. [2019-09-08 09:40:12,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:12,374 INFO L93 Difference]: Finished difference Result 2577 states and 3862 transitions. [2019-09-08 09:40:12,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:12,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-08 09:40:12,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:12,391 INFO L225 Difference]: With dead ends: 2577 [2019-09-08 09:40:12,392 INFO L226 Difference]: Without dead ends: 1708 [2019-09-08 09:40:12,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:40:12,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2019-09-08 09:40:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1706. [2019-09-08 09:40:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-09-08 09:40:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2536 transitions. [2019-09-08 09:40:12,500 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2536 transitions. Word has length 150 [2019-09-08 09:40:12,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:12,500 INFO L475 AbstractCegarLoop]: Abstraction has 1706 states and 2536 transitions. [2019-09-08 09:40:12,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2536 transitions. [2019-09-08 09:40:12,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 09:40:12,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:12,505 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:12,505 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:12,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:12,506 INFO L82 PathProgramCache]: Analyzing trace with hash -522806920, now seen corresponding path program 1 times [2019-09-08 09:40:12,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:12,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:12,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:12,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:12,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:12,585 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 09:40:12,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:12,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:12,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:12,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:12,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:12,587 INFO L87 Difference]: Start difference. First operand 1706 states and 2536 transitions. Second operand 3 states. [2019-09-08 09:40:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:12,756 INFO L93 Difference]: Finished difference Result 5072 states and 7538 transitions. [2019-09-08 09:40:12,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:12,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-09-08 09:40:12,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:12,774 INFO L225 Difference]: With dead ends: 5072 [2019-09-08 09:40:12,774 INFO L226 Difference]: Without dead ends: 3398 [2019-09-08 09:40:12,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-09-08 09:40:12,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 1708. [2019-09-08 09:40:12,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2019-09-08 09:40:12,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2538 transitions. [2019-09-08 09:40:12,925 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2538 transitions. Word has length 151 [2019-09-08 09:40:12,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:12,925 INFO L475 AbstractCegarLoop]: Abstraction has 1708 states and 2538 transitions. [2019-09-08 09:40:12,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:12,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2538 transitions. [2019-09-08 09:40:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 09:40:12,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:12,930 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:12,930 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:12,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:12,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1124709406, now seen corresponding path program 1 times [2019-09-08 09:40:12,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:12,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:12,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:12,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:12,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:13,036 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 09:40:13,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:13,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:13,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:13,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:13,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:13,038 INFO L87 Difference]: Start difference. First operand 1708 states and 2538 transitions. Second operand 3 states. [2019-09-08 09:40:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:13,271 INFO L93 Difference]: Finished difference Result 4838 states and 7205 transitions. [2019-09-08 09:40:13,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:13,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-08 09:40:13,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:13,294 INFO L225 Difference]: With dead ends: 4838 [2019-09-08 09:40:13,295 INFO L226 Difference]: Without dead ends: 3310 [2019-09-08 09:40:13,301 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 09:40:13,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2019-09-08 09:40:13,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 3308. [2019-09-08 09:40:13,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3308 states. [2019-09-08 09:40:13,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 4871 transitions. [2019-09-08 09:40:13,531 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 4871 transitions. Word has length 152 [2019-09-08 09:40:13,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:13,532 INFO L475 AbstractCegarLoop]: Abstraction has 3308 states and 4871 transitions. [2019-09-08 09:40:13,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:13,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 4871 transitions. [2019-09-08 09:40:13,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 09:40:13,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:13,539 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:13,540 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:13,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:13,540 INFO L82 PathProgramCache]: Analyzing trace with hash -617278081, now seen corresponding path program 1 times [2019-09-08 09:40:13,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:13,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:13,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:13,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:13,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:13,809 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 09:40:13,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:13,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:13,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:13,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:13,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:13,811 INFO L87 Difference]: Start difference. First operand 3308 states and 4871 transitions. Second operand 4 states. [2019-09-08 09:40:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:14,046 INFO L93 Difference]: Finished difference Result 5666 states and 8353 transitions. [2019-09-08 09:40:14,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:14,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-08 09:40:14,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:14,063 INFO L225 Difference]: With dead ends: 5666 [2019-09-08 09:40:14,063 INFO L226 Difference]: Without dead ends: 2528 [2019-09-08 09:40:14,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:40:14,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2019-09-08 09:40:14,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2528. [2019-09-08 09:40:14,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2528 states. [2019-09-08 09:40:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 3707 transitions. [2019-09-08 09:40:14,309 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 3707 transitions. Word has length 152 [2019-09-08 09:40:14,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:14,309 INFO L475 AbstractCegarLoop]: Abstraction has 2528 states and 3707 transitions. [2019-09-08 09:40:14,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 3707 transitions. [2019-09-08 09:40:14,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 09:40:14,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:14,318 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:14,319 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:14,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:14,321 INFO L82 PathProgramCache]: Analyzing trace with hash 696225132, now seen corresponding path program 1 times [2019-09-08 09:40:14,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:14,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:14,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:14,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:14,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:40:14,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:14,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:14,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:14,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:14,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:14,487 INFO L87 Difference]: Start difference. First operand 2528 states and 3707 transitions. Second operand 3 states. [2019-09-08 09:40:15,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:15,083 INFO L93 Difference]: Finished difference Result 6812 states and 10094 transitions. [2019-09-08 09:40:15,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:15,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-08 09:40:15,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:15,111 INFO L225 Difference]: With dead ends: 6812 [2019-09-08 09:40:15,111 INFO L226 Difference]: Without dead ends: 4696 [2019-09-08 09:40:15,117 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 09:40:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4696 states. [2019-09-08 09:40:15,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4696 to 4694. [2019-09-08 09:40:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4694 states. [2019-09-08 09:40:15,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4694 states to 4694 states and 6887 transitions. [2019-09-08 09:40:15,403 INFO L78 Accepts]: Start accepts. Automaton has 4694 states and 6887 transitions. Word has length 158 [2019-09-08 09:40:15,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:15,403 INFO L475 AbstractCegarLoop]: Abstraction has 4694 states and 6887 transitions. [2019-09-08 09:40:15,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:15,403 INFO L276 IsEmpty]: Start isEmpty. Operand 4694 states and 6887 transitions. [2019-09-08 09:40:15,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 09:40:15,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:15,412 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:15,412 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:15,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:15,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1185599087, now seen corresponding path program 1 times [2019-09-08 09:40:15,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:15,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:15,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:15,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:15,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:15,575 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 09:40:15,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:15,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:40:15,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:40:15,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:40:15,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:40:15,577 INFO L87 Difference]: Start difference. First operand 4694 states and 6887 transitions. Second operand 5 states. [2019-09-08 09:40:16,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:16,278 INFO L93 Difference]: Finished difference Result 8018 states and 11995 transitions. [2019-09-08 09:40:16,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:40:16,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-09-08 09:40:16,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:16,303 INFO L225 Difference]: With dead ends: 8018 [2019-09-08 09:40:16,303 INFO L226 Difference]: Without dead ends: 4076 [2019-09-08 09:40:16,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:40:16,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2019-09-08 09:40:16,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 4074. [2019-09-08 09:40:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4074 states. [2019-09-08 09:40:16,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4074 states to 4074 states and 6064 transitions. [2019-09-08 09:40:16,631 INFO L78 Accepts]: Start accepts. Automaton has 4074 states and 6064 transitions. Word has length 158 [2019-09-08 09:40:16,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:16,632 INFO L475 AbstractCegarLoop]: Abstraction has 4074 states and 6064 transitions. [2019-09-08 09:40:16,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:40:16,632 INFO L276 IsEmpty]: Start isEmpty. Operand 4074 states and 6064 transitions. [2019-09-08 09:40:16,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 09:40:16,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:16,638 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:16,639 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:16,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:16,639 INFO L82 PathProgramCache]: Analyzing trace with hash 11065959, now seen corresponding path program 1 times [2019-09-08 09:40:16,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:16,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:16,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:16,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:16,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:16,970 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 09:40:16,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:16,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 09:40:16,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 09:40:16,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 09:40:16,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:40:16,973 INFO L87 Difference]: Start difference. First operand 4074 states and 6064 transitions. Second operand 9 states. [2019-09-08 09:40:17,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:17,686 INFO L93 Difference]: Finished difference Result 10158 states and 15476 transitions. [2019-09-08 09:40:17,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:17,686 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-09-08 09:40:17,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:17,738 INFO L225 Difference]: With dead ends: 10158 [2019-09-08 09:40:17,738 INFO L226 Difference]: Without dead ends: 7798 [2019-09-08 09:40:17,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:40:17,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2019-09-08 09:40:18,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 7796. [2019-09-08 09:40:18,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7796 states. [2019-09-08 09:40:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7796 states to 7796 states and 11622 transitions. [2019-09-08 09:40:18,278 INFO L78 Accepts]: Start accepts. Automaton has 7796 states and 11622 transitions. Word has length 158 [2019-09-08 09:40:18,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:18,279 INFO L475 AbstractCegarLoop]: Abstraction has 7796 states and 11622 transitions. [2019-09-08 09:40:18,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 09:40:18,279 INFO L276 IsEmpty]: Start isEmpty. Operand 7796 states and 11622 transitions. [2019-09-08 09:40:18,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 09:40:18,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:18,290 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:18,290 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:18,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:18,291 INFO L82 PathProgramCache]: Analyzing trace with hash -362607228, now seen corresponding path program 1 times [2019-09-08 09:40:18,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:18,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:18,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:18,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:18,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:18,933 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 09:40:18,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:18,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 09:40:18,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 09:40:18,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 09:40:18,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-08 09:40:18,935 INFO L87 Difference]: Start difference. First operand 7796 states and 11622 transitions. Second operand 17 states. [2019-09-08 09:40:21,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:21,901 INFO L93 Difference]: Finished difference Result 13445 states and 20219 transitions. [2019-09-08 09:40:21,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 09:40:21,902 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 158 [2019-09-08 09:40:21,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:21,931 INFO L225 Difference]: With dead ends: 13445 [2019-09-08 09:40:21,931 INFO L226 Difference]: Without dead ends: 12015 [2019-09-08 09:40:21,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=334, Invalid=926, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 09:40:21,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12015 states. [2019-09-08 09:40:22,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12015 to 8247. [2019-09-08 09:40:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8247 states. [2019-09-08 09:40:22,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8247 states to 8247 states and 12204 transitions. [2019-09-08 09:40:22,569 INFO L78 Accepts]: Start accepts. Automaton has 8247 states and 12204 transitions. Word has length 158 [2019-09-08 09:40:22,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:22,569 INFO L475 AbstractCegarLoop]: Abstraction has 8247 states and 12204 transitions. [2019-09-08 09:40:22,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 09:40:22,569 INFO L276 IsEmpty]: Start isEmpty. Operand 8247 states and 12204 transitions. [2019-09-08 09:40:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 09:40:22,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:22,582 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:22,583 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:22,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:22,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1550557348, now seen corresponding path program 1 times [2019-09-08 09:40:22,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:22,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:22,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:22,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:22,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:22,768 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 09:40:22,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:22,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:22,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:22,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:22,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:22,770 INFO L87 Difference]: Start difference. First operand 8247 states and 12204 transitions. Second operand 4 states. [2019-09-08 09:40:23,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:23,774 INFO L93 Difference]: Finished difference Result 21723 states and 32103 transitions. [2019-09-08 09:40:23,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:23,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-08 09:40:23,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:23,812 INFO L225 Difference]: With dead ends: 21723 [2019-09-08 09:40:23,813 INFO L226 Difference]: Without dead ends: 13491 [2019-09-08 09:40:23,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:40:23,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13491 states. [2019-09-08 09:40:24,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13491 to 13489. [2019-09-08 09:40:24,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13489 states. [2019-09-08 09:40:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13489 states to 13489 states and 19729 transitions. [2019-09-08 09:40:24,582 INFO L78 Accepts]: Start accepts. Automaton has 13489 states and 19729 transitions. Word has length 158 [2019-09-08 09:40:24,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:24,583 INFO L475 AbstractCegarLoop]: Abstraction has 13489 states and 19729 transitions. [2019-09-08 09:40:24,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 13489 states and 19729 transitions. [2019-09-08 09:40:24,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 09:40:24,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:24,604 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:24,604 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:24,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:24,605 INFO L82 PathProgramCache]: Analyzing trace with hash -470353988, now seen corresponding path program 1 times [2019-09-08 09:40:24,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:24,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:24,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:24,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:24,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:24,740 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 09:40:24,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:24,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:24,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:24,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:24,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:24,742 INFO L87 Difference]: Start difference. First operand 13489 states and 19729 transitions. Second operand 3 states. [2019-09-08 09:40:26,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:26,233 INFO L93 Difference]: Finished difference Result 36738 states and 53668 transitions. [2019-09-08 09:40:26,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:26,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-08 09:40:26,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:26,279 INFO L225 Difference]: With dead ends: 36738 [2019-09-08 09:40:26,279 INFO L226 Difference]: Without dead ends: 23672 [2019-09-08 09:40:26,302 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 09:40:26,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23672 states. [2019-09-08 09:40:27,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23672 to 23670. [2019-09-08 09:40:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23670 states. [2019-09-08 09:40:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23670 states to 23670 states and 34140 transitions. [2019-09-08 09:40:27,495 INFO L78 Accepts]: Start accepts. Automaton has 23670 states and 34140 transitions. Word has length 160 [2019-09-08 09:40:27,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:27,496 INFO L475 AbstractCegarLoop]: Abstraction has 23670 states and 34140 transitions. [2019-09-08 09:40:27,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 23670 states and 34140 transitions. [2019-09-08 09:40:27,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 09:40:27,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:27,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:27,526 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:27,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:27,527 INFO L82 PathProgramCache]: Analyzing trace with hash 292378521, now seen corresponding path program 1 times [2019-09-08 09:40:27,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:27,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:27,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:27,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:27,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:27,672 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 09:40:27,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:27,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:27,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:27,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:27,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:27,674 INFO L87 Difference]: Start difference. First operand 23670 states and 34140 transitions. Second operand 4 states. [2019-09-08 09:40:28,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:28,349 INFO L93 Difference]: Finished difference Result 39570 states and 57013 transitions. [2019-09-08 09:40:28,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:28,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-08 09:40:28,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:28,392 INFO L225 Difference]: With dead ends: 39570 [2019-09-08 09:40:28,397 INFO L226 Difference]: Without dead ends: 21062 [2019-09-08 09:40:28,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:40:28,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21062 states. [2019-09-08 09:40:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21062 to 21062. [2019-09-08 09:40:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21062 states. [2019-09-08 09:40:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21062 states to 21062 states and 30356 transitions. [2019-09-08 09:40:29,887 INFO L78 Accepts]: Start accepts. Automaton has 21062 states and 30356 transitions. Word has length 160 [2019-09-08 09:40:29,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:29,887 INFO L475 AbstractCegarLoop]: Abstraction has 21062 states and 30356 transitions. [2019-09-08 09:40:29,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:29,887 INFO L276 IsEmpty]: Start isEmpty. Operand 21062 states and 30356 transitions. [2019-09-08 09:40:29,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 09:40:29,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:29,909 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:29,910 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:29,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:29,910 INFO L82 PathProgramCache]: Analyzing trace with hash 707984276, now seen corresponding path program 1 times [2019-09-08 09:40:29,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:29,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:29,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:29,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:29,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:30,104 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 09:40:30,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:30,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:40:30,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:40:30,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:40:30,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:40:30,106 INFO L87 Difference]: Start difference. First operand 21062 states and 30356 transitions. Second operand 5 states. [2019-09-08 09:40:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:31,841 INFO L93 Difference]: Finished difference Result 34026 states and 51192 transitions. [2019-09-08 09:40:31,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:40:31,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2019-09-08 09:40:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:31,901 INFO L225 Difference]: With dead ends: 34026 [2019-09-08 09:40:31,901 INFO L226 Difference]: Without dead ends: 29312 [2019-09-08 09:40:31,924 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 09:40:31,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29312 states. [2019-09-08 09:40:33,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29312 to 24610. [2019-09-08 09:40:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24610 states. [2019-09-08 09:40:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24610 states to 24610 states and 36036 transitions. [2019-09-08 09:40:33,758 INFO L78 Accepts]: Start accepts. Automaton has 24610 states and 36036 transitions. Word has length 166 [2019-09-08 09:40:33,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:33,758 INFO L475 AbstractCegarLoop]: Abstraction has 24610 states and 36036 transitions. [2019-09-08 09:40:33,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:40:33,758 INFO L276 IsEmpty]: Start isEmpty. Operand 24610 states and 36036 transitions. [2019-09-08 09:40:33,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 09:40:33,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:33,778 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:33,778 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:33,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:33,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1903695226, now seen corresponding path program 1 times [2019-09-08 09:40:33,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:33,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:33,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:33,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:33,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:33,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:40:33,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:33,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 09:40:33,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:40:33,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:40:33,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:40:33,985 INFO L87 Difference]: Start difference. First operand 24610 states and 36036 transitions. Second operand 8 states. [2019-09-08 09:40:36,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:36,309 INFO L93 Difference]: Finished difference Result 54831 states and 83735 transitions. [2019-09-08 09:40:36,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 09:40:36,310 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 166 [2019-09-08 09:40:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:36,406 INFO L225 Difference]: With dead ends: 54831 [2019-09-08 09:40:36,407 INFO L226 Difference]: Without dead ends: 44605 [2019-09-08 09:40:36,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-08 09:40:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44605 states. [2019-09-08 09:40:38,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44605 to 42887. [2019-09-08 09:40:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42887 states. [2019-09-08 09:40:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42887 states to 42887 states and 64497 transitions. [2019-09-08 09:40:38,575 INFO L78 Accepts]: Start accepts. Automaton has 42887 states and 64497 transitions. Word has length 166 [2019-09-08 09:40:38,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:38,576 INFO L475 AbstractCegarLoop]: Abstraction has 42887 states and 64497 transitions. [2019-09-08 09:40:38,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:40:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 42887 states and 64497 transitions. [2019-09-08 09:40:38,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 09:40:38,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:38,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:38,594 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:38,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:38,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1189246805, now seen corresponding path program 1 times [2019-09-08 09:40:38,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:38,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:38,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:38,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:38,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:38,818 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 09:40:38,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:38,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:38,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:38,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:38,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:38,822 INFO L87 Difference]: Start difference. First operand 42887 states and 64497 transitions. Second operand 4 states. [2019-09-08 09:40:43,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:43,315 INFO L93 Difference]: Finished difference Result 125719 states and 188794 transitions. [2019-09-08 09:40:43,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:43,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-08 09:40:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:43,458 INFO L225 Difference]: With dead ends: 125719 [2019-09-08 09:40:43,458 INFO L226 Difference]: Without dead ends: 82875 [2019-09-08 09:40:43,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:40:43,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82875 states. [2019-09-08 09:40:49,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82875 to 82873. [2019-09-08 09:40:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82873 states. [2019-09-08 09:40:49,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82873 states to 82873 states and 123250 transitions. [2019-09-08 09:40:49,189 INFO L78 Accepts]: Start accepts. Automaton has 82873 states and 123250 transitions. Word has length 166 [2019-09-08 09:40:49,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:49,189 INFO L475 AbstractCegarLoop]: Abstraction has 82873 states and 123250 transitions. [2019-09-08 09:40:49,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:49,189 INFO L276 IsEmpty]: Start isEmpty. Operand 82873 states and 123250 transitions. [2019-09-08 09:40:49,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 09:40:49,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:49,212 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:49,212 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:49,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:49,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1739927887, now seen corresponding path program 1 times [2019-09-08 09:40:49,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:49,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:49,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:49,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:49,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:49,268 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 09:40:49,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:49,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:49,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:49,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:49,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:49,270 INFO L87 Difference]: Start difference. First operand 82873 states and 123250 transitions. Second operand 3 states. [2019-09-08 09:40:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:58,573 INFO L93 Difference]: Finished difference Result 248423 states and 369499 transitions. [2019-09-08 09:40:58,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:58,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-08 09:40:58,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:58,817 INFO L225 Difference]: With dead ends: 248423 [2019-09-08 09:40:58,817 INFO L226 Difference]: Without dead ends: 165657 [2019-09-08 09:40:58,913 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 09:40:59,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165657 states. [2019-09-08 09:41:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165657 to 82879. [2019-09-08 09:41:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82879 states. [2019-09-08 09:41:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82879 states to 82879 states and 123256 transitions. [2019-09-08 09:41:06,076 INFO L78 Accepts]: Start accepts. Automaton has 82879 states and 123256 transitions. Word has length 167 [2019-09-08 09:41:06,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:06,076 INFO L475 AbstractCegarLoop]: Abstraction has 82879 states and 123256 transitions. [2019-09-08 09:41:06,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:41:06,076 INFO L276 IsEmpty]: Start isEmpty. Operand 82879 states and 123256 transitions. [2019-09-08 09:41:06,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 09:41:06,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:06,109 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:06,109 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:06,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:06,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1139483156, now seen corresponding path program 1 times [2019-09-08 09:41:06,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:06,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:06,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:06,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:06,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:06,234 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 09:41:06,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:06,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:41:06,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:41:06,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:41:06,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:41:06,236 INFO L87 Difference]: Start difference. First operand 82879 states and 123256 transitions. Second operand 4 states. [2019-09-08 09:41:10,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:10,727 INFO L93 Difference]: Finished difference Result 165716 states and 246456 transitions. [2019-09-08 09:41:10,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:41:10,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-08 09:41:10,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:10,823 INFO L225 Difference]: With dead ends: 165716 [2019-09-08 09:41:10,823 INFO L226 Difference]: Without dead ends: 82873 [2019-09-08 09:41:10,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:41:10,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82873 states. [2019-09-08 09:41:15,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82873 to 82873. [2019-09-08 09:41:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82873 states. [2019-09-08 09:41:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82873 states to 82873 states and 123244 transitions. [2019-09-08 09:41:15,772 INFO L78 Accepts]: Start accepts. Automaton has 82873 states and 123244 transitions. Word has length 168 [2019-09-08 09:41:15,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:15,773 INFO L475 AbstractCegarLoop]: Abstraction has 82873 states and 123244 transitions. [2019-09-08 09:41:15,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:41:15,773 INFO L276 IsEmpty]: Start isEmpty. Operand 82873 states and 123244 transitions. [2019-09-08 09:41:15,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 09:41:15,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:15,803 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:15,803 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:15,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:15,804 INFO L82 PathProgramCache]: Analyzing trace with hash -119100867, now seen corresponding path program 1 times [2019-09-08 09:41:15,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:15,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:15,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:15,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:15,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:15,890 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 09:41:15,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:15,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:41:15,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:41:15,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:41:15,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:41:15,892 INFO L87 Difference]: Start difference. First operand 82873 states and 123244 transitions. Second operand 3 states. [2019-09-08 09:41:23,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:23,654 INFO L93 Difference]: Finished difference Result 205432 states and 305012 transitions. [2019-09-08 09:41:23,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:41:23,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 09:41:23,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:23,815 INFO L225 Difference]: With dead ends: 205432 [2019-09-08 09:41:23,816 INFO L226 Difference]: Without dead ends: 123432 [2019-09-08 09:41:23,878 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 09:41:23,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123432 states. [2019-09-08 09:41:30,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123432 to 123430. [2019-09-08 09:41:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123430 states. [2019-09-08 09:41:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123430 states to 123430 states and 180866 transitions. [2019-09-08 09:41:31,604 INFO L78 Accepts]: Start accepts. Automaton has 123430 states and 180866 transitions. Word has length 168 [2019-09-08 09:41:31,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:31,604 INFO L475 AbstractCegarLoop]: Abstraction has 123430 states and 180866 transitions. [2019-09-08 09:41:31,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:41:31,604 INFO L276 IsEmpty]: Start isEmpty. Operand 123430 states and 180866 transitions. [2019-09-08 09:41:31,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:41:31,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:31,639 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:31,639 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:31,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:31,639 INFO L82 PathProgramCache]: Analyzing trace with hash 938171426, now seen corresponding path program 1 times [2019-09-08 09:41:31,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:31,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:31,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:31,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:31,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:31,711 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 09:41:31,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:31,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:41:31,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:41:31,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:41:31,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:41:31,713 INFO L87 Difference]: Start difference. First operand 123430 states and 180866 transitions. Second operand 3 states. [2019-09-08 09:41:42,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:42,751 INFO L93 Difference]: Finished difference Result 260803 states and 392966 transitions. [2019-09-08 09:41:42,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:41:42,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-08 09:41:42,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:42,965 INFO L225 Difference]: With dead ends: 260803 [2019-09-08 09:41:42,966 INFO L226 Difference]: Without dead ends: 170310 [2019-09-08 09:41:43,039 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 09:41:43,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170310 states. [2019-09-08 09:41:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170310 to 148535. [2019-09-08 09:41:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148535 states. [2019-09-08 09:41:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148535 states to 148535 states and 219672 transitions. [2019-09-08 09:41:54,838 INFO L78 Accepts]: Start accepts. Automaton has 148535 states and 219672 transitions. Word has length 174 [2019-09-08 09:41:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:54,838 INFO L475 AbstractCegarLoop]: Abstraction has 148535 states and 219672 transitions. [2019-09-08 09:41:54,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:41:54,838 INFO L276 IsEmpty]: Start isEmpty. Operand 148535 states and 219672 transitions. [2019-09-08 09:41:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:41:54,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:54,872 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:54,872 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:54,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:54,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1722974211, now seen corresponding path program 1 times [2019-09-08 09:41:54,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:54,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:54,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:54,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:54,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:54,992 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 09:41:54,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:54,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:41:54,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:41:54,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:41:54,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:41:54,994 INFO L87 Difference]: Start difference. First operand 148535 states and 219672 transitions. Second operand 3 states. [2019-09-08 09:42:10,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:10,879 INFO L93 Difference]: Finished difference Result 313024 states and 473074 transitions. [2019-09-08 09:42:10,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:10,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-08 09:42:10,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:11,173 INFO L225 Difference]: With dead ends: 313024 [2019-09-08 09:42:11,174 INFO L226 Difference]: Without dead ends: 212213 [2019-09-08 09:42:11,262 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 09:42:11,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212213 states. [2019-09-08 09:42:23,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212213 to 195802. [2019-09-08 09:42:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195802 states. [2019-09-08 09:42:23,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195802 states to 195802 states and 288439 transitions. [2019-09-08 09:42:23,977 INFO L78 Accepts]: Start accepts. Automaton has 195802 states and 288439 transitions. Word has length 174 [2019-09-08 09:42:23,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:23,978 INFO L475 AbstractCegarLoop]: Abstraction has 195802 states and 288439 transitions. [2019-09-08 09:42:23,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 195802 states and 288439 transitions. [2019-09-08 09:42:24,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:42:24,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:24,012 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:24,013 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:24,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:24,013 INFO L82 PathProgramCache]: Analyzing trace with hash 674762004, now seen corresponding path program 1 times [2019-09-08 09:42:24,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:24,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:24,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:24,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:24,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:42:24,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:24,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 09:42:24,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 09:42:24,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 09:42:24,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 09:42:24,255 INFO L87 Difference]: Start difference. First operand 195802 states and 288439 transitions. Second operand 10 states. [2019-09-08 09:42:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:39,140 INFO L93 Difference]: Finished difference Result 369659 states and 544336 transitions. [2019-09-08 09:42:39,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:42:39,140 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 174 [2019-09-08 09:42:39,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:39,410 INFO L225 Difference]: With dead ends: 369659 [2019-09-08 09:42:39,410 INFO L226 Difference]: Without dead ends: 195802 [2019-09-08 09:42:39,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-08 09:42:39,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195802 states. [2019-09-08 09:42:58,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195802 to 195802. [2019-09-08 09:42:58,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195802 states. [2019-09-08 09:42:58,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195802 states to 195802 states and 284635 transitions. [2019-09-08 09:42:58,337 INFO L78 Accepts]: Start accepts. Automaton has 195802 states and 284635 transitions. Word has length 174 [2019-09-08 09:42:58,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:58,338 INFO L475 AbstractCegarLoop]: Abstraction has 195802 states and 284635 transitions. [2019-09-08 09:42:58,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 09:42:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 195802 states and 284635 transitions. [2019-09-08 09:42:58,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:42:58,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:58,369 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:58,369 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:58,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:58,370 INFO L82 PathProgramCache]: Analyzing trace with hash 63372601, now seen corresponding path program 1 times [2019-09-08 09:42:58,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:58,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:58,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:58,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:58,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:58,505 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 09:42:58,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:58,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:42:58,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:42:58,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:42:58,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:42:58,507 INFO L87 Difference]: Start difference. First operand 195802 states and 284635 transitions. Second operand 5 states. [2019-09-08 09:43:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:24,789 INFO L93 Difference]: Finished difference Result 480549 states and 720293 transitions. [2019-09-08 09:43:24,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:43:24,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2019-09-08 09:43:24,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:25,888 INFO L225 Difference]: With dead ends: 480549 [2019-09-08 09:43:25,889 INFO L226 Difference]: Without dead ends: 353221 [2019-09-08 09:43:25,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:43:26,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353221 states. [2019-09-08 09:43:56,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353221 to 282249. [2019-09-08 09:43:56,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282249 states. [2019-09-08 09:43:56,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282249 states to 282249 states and 418271 transitions. [2019-09-08 09:43:56,865 INFO L78 Accepts]: Start accepts. Automaton has 282249 states and 418271 transitions. Word has length 174 [2019-09-08 09:43:56,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:56,865 INFO L475 AbstractCegarLoop]: Abstraction has 282249 states and 418271 transitions. [2019-09-08 09:43:56,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:43:56,865 INFO L276 IsEmpty]: Start isEmpty. Operand 282249 states and 418271 transitions. [2019-09-08 09:43:56,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:43:56,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:56,896 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:43:56,896 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:56,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:56,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1819571277, now seen corresponding path program 1 times [2019-09-08 09:43:56,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:56,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:56,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:56,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:56,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:57,130 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 09:43:57,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:57,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 09:43:57,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 09:43:57,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 09:43:57,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:43:57,137 INFO L87 Difference]: Start difference. First operand 282249 states and 418271 transitions. Second operand 9 states. [2019-09-08 09:44:17,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:17,059 INFO L93 Difference]: Finished difference Result 476049 states and 713246 transitions. [2019-09-08 09:44:17,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:44:17,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 174 [2019-09-08 09:44:17,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:17,396 INFO L225 Difference]: With dead ends: 476049 [2019-09-08 09:44:17,396 INFO L226 Difference]: Without dead ends: 235162 [2019-09-08 09:44:17,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:44:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235162 states. [2019-09-08 09:44:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235162 to 211306. [2019-09-08 09:44:39,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211306 states. [2019-09-08 09:44:39,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211306 states to 211306 states and 308038 transitions. [2019-09-08 09:44:39,652 INFO L78 Accepts]: Start accepts. Automaton has 211306 states and 308038 transitions. Word has length 174 [2019-09-08 09:44:39,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:39,653 INFO L475 AbstractCegarLoop]: Abstraction has 211306 states and 308038 transitions. [2019-09-08 09:44:39,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 09:44:39,653 INFO L276 IsEmpty]: Start isEmpty. Operand 211306 states and 308038 transitions. [2019-09-08 09:44:39,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:44:39,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:39,682 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:44:39,682 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:39,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:39,683 INFO L82 PathProgramCache]: Analyzing trace with hash 306575255, now seen corresponding path program 1 times [2019-09-08 09:44:39,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:39,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:39,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:39,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:39,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:39,812 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 09:44:39,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:39,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:44:39,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:44:39,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:44:39,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:44:39,814 INFO L87 Difference]: Start difference. First operand 211306 states and 308038 transitions. Second operand 5 states. [2019-09-08 09:45:13,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:13,429 INFO L93 Difference]: Finished difference Result 514807 states and 767686 transitions. [2019-09-08 09:45:13,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:45:13,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2019-09-08 09:45:13,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:13,955 INFO L225 Difference]: With dead ends: 514807 [2019-09-08 09:45:13,955 INFO L226 Difference]: Without dead ends: 366892 [2019-09-08 09:45:14,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:45:14,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366892 states. [2019-09-08 09:45:47,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366892 to 342322. [2019-09-08 09:45:47,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342322 states. [2019-09-08 09:45:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342322 states to 342322 states and 505660 transitions. [2019-09-08 09:45:48,306 INFO L78 Accepts]: Start accepts. Automaton has 342322 states and 505660 transitions. Word has length 174 [2019-09-08 09:45:48,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:45:48,306 INFO L475 AbstractCegarLoop]: Abstraction has 342322 states and 505660 transitions. [2019-09-08 09:45:48,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:45:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 342322 states and 505660 transitions. [2019-09-08 09:45:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:45:48,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:45:48,333 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:45:48,333 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:45:48,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:45:48,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1590655826, now seen corresponding path program 1 times [2019-09-08 09:45:48,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:45:48,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:45:48,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:48,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:45:48,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:45:49,365 WARN L188 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2019-09-08 09:45:49,535 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 09:45:49,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:45:49,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 09:45:49,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 09:45:49,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 09:45:49,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-09-08 09:45:49,537 INFO L87 Difference]: Start difference. First operand 342322 states and 505660 transitions. Second operand 14 states. [2019-09-08 09:47:43,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:43,995 INFO L93 Difference]: Finished difference Result 1230541 states and 1832396 transitions. [2019-09-08 09:47:43,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 09:47:43,995 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 174 [2019-09-08 09:47:43,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:45,780 INFO L225 Difference]: With dead ends: 1230541 [2019-09-08 09:47:45,781 INFO L226 Difference]: Without dead ends: 1103160 [2019-09-08 09:47:46,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2019-09-08 09:47:46,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103160 states. [2019-09-08 09:48:37,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103160 to 347100. [2019-09-08 09:48:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347100 states. [2019-09-08 09:48:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347100 states to 347100 states and 511174 transitions. [2019-09-08 09:48:37,951 INFO L78 Accepts]: Start accepts. Automaton has 347100 states and 511174 transitions. Word has length 174 [2019-09-08 09:48:37,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:37,952 INFO L475 AbstractCegarLoop]: Abstraction has 347100 states and 511174 transitions. [2019-09-08 09:48:37,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 09:48:37,952 INFO L276 IsEmpty]: Start isEmpty. Operand 347100 states and 511174 transitions. [2019-09-08 09:48:37,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:48:37,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:37,983 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:37,983 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:37,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:37,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1437603277, now seen corresponding path program 1 times [2019-09-08 09:48:37,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:37,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:37,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:37,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:37,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:38,128 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 09:48:38,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:38,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:48:38,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:48:38,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:48:38,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:48:38,130 INFO L87 Difference]: Start difference. First operand 347100 states and 511174 transitions. Second operand 4 states. [2019-09-08 09:49:18,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:49:18,184 INFO L93 Difference]: Finished difference Result 656903 states and 965851 transitions. [2019-09-08 09:49:18,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:49:18,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-09-08 09:49:18,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:49:18,649 INFO L225 Difference]: With dead ends: 656903 [2019-09-08 09:49:18,649 INFO L226 Difference]: Without dead ends: 310198 [2019-09-08 09:49:18,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:49:19,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310198 states. [2019-09-08 09:49:52,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310198 to 310118. [2019-09-08 09:49:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310118 states. [2019-09-08 09:49:53,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310118 states to 310118 states and 455027 transitions. [2019-09-08 09:49:53,061 INFO L78 Accepts]: Start accepts. Automaton has 310118 states and 455027 transitions. Word has length 174 [2019-09-08 09:49:53,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:49:53,061 INFO L475 AbstractCegarLoop]: Abstraction has 310118 states and 455027 transitions. [2019-09-08 09:49:53,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:49:53,061 INFO L276 IsEmpty]: Start isEmpty. Operand 310118 states and 455027 transitions. [2019-09-08 09:49:53,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 09:49:53,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:49:53,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:49:53,090 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:49:53,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:49:53,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1621376446, now seen corresponding path program 1 times [2019-09-08 09:49:53,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:49:53,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:49:53,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:53,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:49:53,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:49:53,326 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 09:49:53,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:49:53,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 09:49:53,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 09:49:53,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 09:49:53,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:49:53,328 INFO L87 Difference]: Start difference. First operand 310118 states and 455027 transitions. Second operand 9 states. [2019-09-08 09:50:31,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:31,999 INFO L93 Difference]: Finished difference Result 552588 states and 819974 transitions. [2019-09-08 09:50:31,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:50:31,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 176 [2019-09-08 09:50:32,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:32,986 INFO L225 Difference]: With dead ends: 552588 [2019-09-08 09:50:32,987 INFO L226 Difference]: Without dead ends: 310120 [2019-09-08 09:50:33,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:50:33,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310120 states. [2019-09-08 09:50:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310120 to 137046. [2019-09-08 09:50:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137046 states. [2019-09-08 09:50:51,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137046 states to 137046 states and 195602 transitions. [2019-09-08 09:50:51,791 INFO L78 Accepts]: Start accepts. Automaton has 137046 states and 195602 transitions. Word has length 176 [2019-09-08 09:50:51,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:51,792 INFO L475 AbstractCegarLoop]: Abstraction has 137046 states and 195602 transitions. [2019-09-08 09:50:51,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 09:50:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand 137046 states and 195602 transitions. [2019-09-08 09:50:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 09:50:51,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:51,815 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:51,815 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:51,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:51,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1300815465, now seen corresponding path program 1 times [2019-09-08 09:50:51,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:51,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:51,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:51,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:51,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:51,946 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 09:50:51,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:51,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:50:51,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:50:51,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:50:51,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:50:51,948 INFO L87 Difference]: Start difference. First operand 137046 states and 195602 transitions. Second operand 4 states. [2019-09-08 09:51:13,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:13,253 INFO L93 Difference]: Finished difference Result 274261 states and 391405 transitions. [2019-09-08 09:51:13,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:51:13,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-08 09:51:13,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:13,414 INFO L225 Difference]: With dead ends: 274261 [2019-09-08 09:51:13,414 INFO L226 Difference]: Without dead ends: 137368 [2019-09-08 09:51:13,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:51:13,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137368 states. [2019-09-08 09:51:30,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137368 to 137205. [2019-09-08 09:51:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137205 states. [2019-09-08 09:51:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137205 states to 137205 states and 195770 transitions. [2019-09-08 09:51:30,948 INFO L78 Accepts]: Start accepts. Automaton has 137205 states and 195770 transitions. Word has length 176 [2019-09-08 09:51:30,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:30,949 INFO L475 AbstractCegarLoop]: Abstraction has 137205 states and 195770 transitions. [2019-09-08 09:51:30,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:51:30,949 INFO L276 IsEmpty]: Start isEmpty. Operand 137205 states and 195770 transitions. [2019-09-08 09:51:30,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 09:51:30,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:30,972 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:30,972 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:30,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:30,972 INFO L82 PathProgramCache]: Analyzing trace with hash -2121425679, now seen corresponding path program 1 times [2019-09-08 09:51:30,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:30,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:30,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:30,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:30,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:31,020 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 09:51:31,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:31,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:31,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:31,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:31,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:31,022 INFO L87 Difference]: Start difference. First operand 137205 states and 195770 transitions. Second operand 3 states.