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.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:48:03,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:48:03,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:48:03,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:48:03,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:48:03,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:48:03,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:48:03,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:48:03,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:48:03,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:48:03,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:48:03,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:48:03,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:48:03,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:48:03,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:48:03,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:48:03,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:48:03,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:48:03,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:48:03,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:48:03,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:48:03,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:48:03,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:48:03,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:48:03,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:48:03,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:48:03,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:48:03,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:48:03,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:48:03,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:48:03,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:48:03,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:48:03,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:48:03,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:48:03,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:48:03,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:48:03,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:48:03,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:48:03,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:48:03,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:48:03,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:48:03,378 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:48:03,392 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:48:03,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:48:03,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:48:03,394 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:48:03,394 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:48:03,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:48:03,395 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:48:03,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:48:03,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:48:03,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:48:03,396 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:48:03,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:48:03,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:48:03,396 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:48:03,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:48:03,397 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:48:03,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:48:03,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:48:03,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:48:03,397 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:48:03,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:48:03,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:48:03,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:48:03,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:48:03,399 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:48:03,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:48:03,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:48:03,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:48:03,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:48:03,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:48:03,442 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:48:03,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:48:03,450 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:48:03,451 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:48:03,452 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 09:48:03,531 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a77c3e5f1/cbf83df76b12413ca2be868fb7ff1f10/FLAGf72801685 [2019-09-08 09:48:04,174 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:48:04,175 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 09:48:04,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a77c3e5f1/cbf83df76b12413ca2be868fb7ff1f10/FLAGf72801685 [2019-09-08 09:48:04,382 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a77c3e5f1/cbf83df76b12413ca2be868fb7ff1f10 [2019-09-08 09:48:04,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:48:04,399 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:48:04,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:48:04,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:48:04,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:48:04,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:48:04" (1/1) ... [2019-09-08 09:48:04,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42d13215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:48:04, skipping insertion in model container [2019-09-08 09:48:04,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:48:04" (1/1) ... [2019-09-08 09:48:04,424 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:48:04,527 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:48:05,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:48:05,301 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:48:05,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:48:05,818 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:48:05,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:48:05 WrapperNode [2019-09-08 09:48:05,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:48:05,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:48:05,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:48:05,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:48:05,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:48:05" (1/1) ... [2019-09-08 09:48:05,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:48:05" (1/1) ... [2019-09-08 09:48:05,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:48:05" (1/1) ... [2019-09-08 09:48:05,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:48:05" (1/1) ... [2019-09-08 09:48:05,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:48:05" (1/1) ... [2019-09-08 09:48:05,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:48:05" (1/1) ... [2019-09-08 09:48:05,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:48:05" (1/1) ... [2019-09-08 09:48:05,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:48:05,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:48:05,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:48:05,994 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:48:05,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:48:05" (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:48:06,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:48:06,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:48:06,079 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:48:06,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:48:06,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:48:06,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:48:06,081 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:48:06,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:48:06,081 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:48:06,081 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:48:06,082 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:48:06,082 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:48:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:48:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:48:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:48:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:48:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:48:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:48:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:48:08,207 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:48:08,208 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:48:08,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:48:08 BoogieIcfgContainer [2019-09-08 09:48:08,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:48:08,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:48:08,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:48:08,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:48:08,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:48:04" (1/3) ... [2019-09-08 09:48:08,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f9a7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:48:08, skipping insertion in model container [2019-09-08 09:48:08,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:48:05" (2/3) ... [2019-09-08 09:48:08,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f9a7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:48:08, skipping insertion in model container [2019-09-08 09:48:08,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:48:08" (3/3) ... [2019-09-08 09:48:08,223 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 09:48:08,234 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:48:08,259 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:48:08,278 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:48:08,321 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:48:08,322 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:48:08,322 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:48:08,322 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:48:08,322 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:48:08,323 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:48:08,323 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:48:08,323 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:48:08,323 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:48:08,352 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states. [2019-09-08 09:48:08,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 09:48:08,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:08,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,382 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:08,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:08,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1318645382, now seen corresponding path program 1 times [2019-09-08 09:48:08,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:08,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:08,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:08,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:08,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:09,723 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:09,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:09,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:48:09,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:48:09,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:48:09,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:48:09,751 INFO L87 Difference]: Start difference. First operand 586 states. Second operand 4 states. [2019-09-08 09:48:10,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:10,072 INFO L93 Difference]: Finished difference Result 1715 states and 3059 transitions. [2019-09-08 09:48:10,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:48:10,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-09-08 09:48:10,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:10,105 INFO L225 Difference]: With dead ends: 1715 [2019-09-08 09:48:10,105 INFO L226 Difference]: Without dead ends: 1136 [2019-09-08 09:48:10,118 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:48:10,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-08 09:48:10,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1134. [2019-09-08 09:48:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1134 states. [2019-09-08 09:48:10,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1769 transitions. [2019-09-08 09:48:10,258 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1769 transitions. Word has length 238 [2019-09-08 09:48:10,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:10,259 INFO L475 AbstractCegarLoop]: Abstraction has 1134 states and 1769 transitions. [2019-09-08 09:48:10,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:48:10,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1769 transitions. [2019-09-08 09:48:10,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 09:48:10,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:10,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,269 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:10,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:10,270 INFO L82 PathProgramCache]: Analyzing trace with hash 359530467, now seen corresponding path program 1 times [2019-09-08 09:48:10,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:10,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:10,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:10,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:10,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:10,619 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:10,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:10,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:48:10,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:48:10,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:48:10,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:48:10,622 INFO L87 Difference]: Start difference. First operand 1134 states and 1769 transitions. Second operand 3 states. [2019-09-08 09:48:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:10,777 INFO L93 Difference]: Finished difference Result 3229 states and 5011 transitions. [2019-09-08 09:48:10,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:48:10,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-09-08 09:48:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:10,791 INFO L225 Difference]: With dead ends: 3229 [2019-09-08 09:48:10,791 INFO L226 Difference]: Without dead ends: 2224 [2019-09-08 09:48:10,795 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:48:10,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2019-09-08 09:48:10,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 2222. [2019-09-08 09:48:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2222 states. [2019-09-08 09:48:10,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 3451 transitions. [2019-09-08 09:48:10,926 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 3451 transitions. Word has length 240 [2019-09-08 09:48:10,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:10,929 INFO L475 AbstractCegarLoop]: Abstraction has 2222 states and 3451 transitions. [2019-09-08 09:48:10,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:48:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 3451 transitions. [2019-09-08 09:48:10,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 09:48:10,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:10,938 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,939 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:10,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:10,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1850631464, now seen corresponding path program 1 times [2019-09-08 09:48:10,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:10,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:10,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:10,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:10,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:11,158 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:11,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:11,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:48:11,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:48:11,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:48:11,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:48:11,161 INFO L87 Difference]: Start difference. First operand 2222 states and 3451 transitions. Second operand 3 states. [2019-09-08 09:48:11,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:11,375 INFO L93 Difference]: Finished difference Result 6591 states and 10229 transitions. [2019-09-08 09:48:11,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:48:11,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-09-08 09:48:11,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:11,412 INFO L225 Difference]: With dead ends: 6591 [2019-09-08 09:48:11,412 INFO L226 Difference]: Without dead ends: 4411 [2019-09-08 09:48:11,421 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:48:11,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4411 states. [2019-09-08 09:48:11,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4411 to 2241. [2019-09-08 09:48:11,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2241 states. [2019-09-08 09:48:11,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 3479 transitions. [2019-09-08 09:48:11,645 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 3479 transitions. Word has length 240 [2019-09-08 09:48:11,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:11,646 INFO L475 AbstractCegarLoop]: Abstraction has 2241 states and 3479 transitions. [2019-09-08 09:48:11,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:48:11,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 3479 transitions. [2019-09-08 09:48:11,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 09:48:11,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:11,653 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,654 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:11,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:11,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1279339238, now seen corresponding path program 1 times [2019-09-08 09:48:11,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:11,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:11,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:11,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:11,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:11,840 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:11,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:11,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:48:11,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:48:11,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:48:11,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:48:11,842 INFO L87 Difference]: Start difference. First operand 2241 states and 3479 transitions. Second operand 3 states. [2019-09-08 09:48:12,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:12,076 INFO L93 Difference]: Finished difference Result 6610 states and 10250 transitions. [2019-09-08 09:48:12,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:48:12,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-08 09:48:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:12,098 INFO L225 Difference]: With dead ends: 6610 [2019-09-08 09:48:12,098 INFO L226 Difference]: Without dead ends: 4429 [2019-09-08 09:48:12,106 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:48:12,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4429 states. [2019-09-08 09:48:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4429 to 2259. [2019-09-08 09:48:12,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2259 states. [2019-09-08 09:48:12,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 3500 transitions. [2019-09-08 09:48:12,260 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 3500 transitions. Word has length 241 [2019-09-08 09:48:12,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:12,261 INFO L475 AbstractCegarLoop]: Abstraction has 2259 states and 3500 transitions. [2019-09-08 09:48:12,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:48:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 3500 transitions. [2019-09-08 09:48:12,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 09:48:12,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:12,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,268 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:12,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:12,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1753365598, now seen corresponding path program 1 times [2019-09-08 09:48:12,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:12,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:12,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:12,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:12,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:12,552 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:12,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:12,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:48:12,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:48:12,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:48:12,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:48:12,556 INFO L87 Difference]: Start difference. First operand 2259 states and 3500 transitions. Second operand 3 states. [2019-09-08 09:48:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:12,880 INFO L93 Difference]: Finished difference Result 6354 states and 9789 transitions. [2019-09-08 09:48:12,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:48:12,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-09-08 09:48:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:12,901 INFO L225 Difference]: With dead ends: 6354 [2019-09-08 09:48:12,901 INFO L226 Difference]: Without dead ends: 4340 [2019-09-08 09:48:12,907 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:48:12,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4340 states. [2019-09-08 09:48:13,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4340 to 4338. [2019-09-08 09:48:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4338 states. [2019-09-08 09:48:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4338 states to 4338 states and 6672 transitions. [2019-09-08 09:48:13,125 INFO L78 Accepts]: Start accepts. Automaton has 4338 states and 6672 transitions. Word has length 242 [2019-09-08 09:48:13,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:13,125 INFO L475 AbstractCegarLoop]: Abstraction has 4338 states and 6672 transitions. [2019-09-08 09:48:13,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:48:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 4338 states and 6672 transitions. [2019-09-08 09:48:13,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 09:48:13,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:13,137 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,137 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:13,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:13,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1077008123, now seen corresponding path program 1 times [2019-09-08 09:48:13,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:13,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:13,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:13,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:13,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:13,463 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:13,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:13,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:48:13,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:48:13,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:48:13,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:48:13,465 INFO L87 Difference]: Start difference. First operand 4338 states and 6672 transitions. Second operand 4 states. [2019-09-08 09:48:13,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:13,862 INFO L93 Difference]: Finished difference Result 11647 states and 17740 transitions. [2019-09-08 09:48:13,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:48:13,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2019-09-08 09:48:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:13,901 INFO L225 Difference]: With dead ends: 11647 [2019-09-08 09:48:13,902 INFO L226 Difference]: Without dead ends: 7849 [2019-09-08 09:48:13,912 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:48:13,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7849 states. [2019-09-08 09:48:14,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7849 to 4573. [2019-09-08 09:48:14,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4573 states. [2019-09-08 09:48:14,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 7060 transitions. [2019-09-08 09:48:14,207 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 7060 transitions. Word has length 242 [2019-09-08 09:48:14,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:14,208 INFO L475 AbstractCegarLoop]: Abstraction has 4573 states and 7060 transitions. [2019-09-08 09:48:14,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:48:14,208 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 7060 transitions. [2019-09-08 09:48:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 09:48:14,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:14,222 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,222 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:14,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:14,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1840004283, now seen corresponding path program 1 times [2019-09-08 09:48:14,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:14,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:14,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:14,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:14,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:14,399 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:14,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:14,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:48:14,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:48:14,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:48:14,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:48:14,401 INFO L87 Difference]: Start difference. First operand 4573 states and 7060 transitions. Second operand 3 states. [2019-09-08 09:48:14,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:14,778 INFO L93 Difference]: Finished difference Result 12149 states and 18461 transitions. [2019-09-08 09:48:14,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:48:14,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-09-08 09:48:14,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:14,803 INFO L225 Difference]: With dead ends: 12149 [2019-09-08 09:48:14,804 INFO L226 Difference]: Without dead ends: 8379 [2019-09-08 09:48:14,816 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:48:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8379 states. [2019-09-08 09:48:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8379 to 4677. [2019-09-08 09:48:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4677 states. [2019-09-08 09:48:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4677 states to 4677 states and 7203 transitions. [2019-09-08 09:48:15,134 INFO L78 Accepts]: Start accepts. Automaton has 4677 states and 7203 transitions. Word has length 244 [2019-09-08 09:48:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:15,135 INFO L475 AbstractCegarLoop]: Abstraction has 4677 states and 7203 transitions. [2019-09-08 09:48:15,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:48:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 4677 states and 7203 transitions. [2019-09-08 09:48:15,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 09:48:15,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:15,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,149 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:15,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:15,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1634782981, now seen corresponding path program 1 times [2019-09-08 09:48:15,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:15,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:15,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:15,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:15,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:15,302 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:15,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:15,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:48:15,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:48:15,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:48:15,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:48:15,304 INFO L87 Difference]: Start difference. First operand 4677 states and 7203 transitions. Second operand 3 states. [2019-09-08 09:48:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:15,711 INFO L93 Difference]: Finished difference Result 12281 states and 18627 transitions. [2019-09-08 09:48:15,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:48:15,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-09-08 09:48:15,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:15,735 INFO L225 Difference]: With dead ends: 12281 [2019-09-08 09:48:15,735 INFO L226 Difference]: Without dead ends: 8504 [2019-09-08 09:48:15,747 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:48:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8504 states. [2019-09-08 09:48:16,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8504 to 4802. [2019-09-08 09:48:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4802 states. [2019-09-08 09:48:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7349 transitions. [2019-09-08 09:48:16,046 INFO L78 Accepts]: Start accepts. Automaton has 4802 states and 7349 transitions. Word has length 245 [2019-09-08 09:48:16,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:16,046 INFO L475 AbstractCegarLoop]: Abstraction has 4802 states and 7349 transitions. [2019-09-08 09:48:16,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:48:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 4802 states and 7349 transitions. [2019-09-08 09:48:16,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 09:48:16,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:16,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,059 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:16,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:16,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1220135646, now seen corresponding path program 1 times [2019-09-08 09:48:16,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:16,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:16,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:16,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:16,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:16,301 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:16,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:16,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:48:16,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:48:16,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:48:16,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:48:16,303 INFO L87 Difference]: Start difference. First operand 4802 states and 7349 transitions. Second operand 3 states. [2019-09-08 09:48:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:17,174 INFO L93 Difference]: Finished difference Result 10442 states and 15895 transitions. [2019-09-08 09:48:17,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:48:17,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-09-08 09:48:17,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:17,193 INFO L225 Difference]: With dead ends: 10442 [2019-09-08 09:48:17,193 INFO L226 Difference]: Without dead ends: 7616 [2019-09-08 09:48:17,202 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:48:17,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7616 states. [2019-09-08 09:48:17,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7616 to 7614. [2019-09-08 09:48:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7614 states. [2019-09-08 09:48:17,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7614 states to 7614 states and 11549 transitions. [2019-09-08 09:48:17,650 INFO L78 Accepts]: Start accepts. Automaton has 7614 states and 11549 transitions. Word has length 246 [2019-09-08 09:48:17,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:17,651 INFO L475 AbstractCegarLoop]: Abstraction has 7614 states and 11549 transitions. [2019-09-08 09:48:17,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:48:17,651 INFO L276 IsEmpty]: Start isEmpty. Operand 7614 states and 11549 transitions. [2019-09-08 09:48:17,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 09:48:17,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:17,668 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,668 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:17,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:17,669 INFO L82 PathProgramCache]: Analyzing trace with hash -724010275, now seen corresponding path program 1 times [2019-09-08 09:48:17,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:17,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:17,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:17,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:17,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:18,619 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:18,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:18,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 09:48:18,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 09:48:18,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 09:48:18,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 09:48:18,621 INFO L87 Difference]: Start difference. First operand 7614 states and 11549 transitions. Second operand 17 states. [2019-09-08 09:48:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:22,672 INFO L93 Difference]: Finished difference Result 22877 states and 35460 transitions. [2019-09-08 09:48:22,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 09:48:22,676 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 246 [2019-09-08 09:48:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:22,715 INFO L225 Difference]: With dead ends: 22877 [2019-09-08 09:48:22,716 INFO L226 Difference]: Without dead ends: 20447 [2019-09-08 09:48:22,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=315, Invalid=945, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 09:48:22,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20447 states. [2019-09-08 09:48:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20447 to 12606. [2019-09-08 09:48:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12606 states. [2019-09-08 09:48:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12606 states to 12606 states and 19121 transitions. [2019-09-08 09:48:23,542 INFO L78 Accepts]: Start accepts. Automaton has 12606 states and 19121 transitions. Word has length 246 [2019-09-08 09:48:23,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:23,543 INFO L475 AbstractCegarLoop]: Abstraction has 12606 states and 19121 transitions. [2019-09-08 09:48:23,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 09:48:23,543 INFO L276 IsEmpty]: Start isEmpty. Operand 12606 states and 19121 transitions. [2019-09-08 09:48:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 09:48:23,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:23,565 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,565 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:23,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:23,566 INFO L82 PathProgramCache]: Analyzing trace with hash -572749154, now seen corresponding path program 1 times [2019-09-08 09:48:23,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:23,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:23,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:23,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:23,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:24,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:48:24,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:24,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:48:24,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:48:24,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:48:24,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:48:24,091 INFO L87 Difference]: Start difference. First operand 12606 states and 19121 transitions. Second operand 4 states. [2019-09-08 09:48:25,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:25,391 INFO L93 Difference]: Finished difference Result 37015 states and 56121 transitions. [2019-09-08 09:48:25,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:48:25,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-09-08 09:48:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:25,433 INFO L225 Difference]: With dead ends: 37015 [2019-09-08 09:48:25,433 INFO L226 Difference]: Without dead ends: 24481 [2019-09-08 09:48:25,458 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:48:25,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24481 states. [2019-09-08 09:48:26,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24481 to 24479. [2019-09-08 09:48:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24479 states. [2019-09-08 09:48:26,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24479 states to 24479 states and 36892 transitions. [2019-09-08 09:48:26,933 INFO L78 Accepts]: Start accepts. Automaton has 24479 states and 36892 transitions. Word has length 246 [2019-09-08 09:48:26,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:26,934 INFO L475 AbstractCegarLoop]: Abstraction has 24479 states and 36892 transitions. [2019-09-08 09:48:26,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:48:26,934 INFO L276 IsEmpty]: Start isEmpty. Operand 24479 states and 36892 transitions. [2019-09-08 09:48:26,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-08 09:48:26,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:26,968 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,968 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:26,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:26,968 INFO L82 PathProgramCache]: Analyzing trace with hash -154325052, now seen corresponding path program 1 times [2019-09-08 09:48:26,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:26,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:26,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:26,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:26,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:27,133 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:27,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:27,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:48:27,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:48:27,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:48:27,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:48:27,135 INFO L87 Difference]: Start difference. First operand 24479 states and 36892 transitions. Second operand 3 states. [2019-09-08 09:48:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:29,827 INFO L93 Difference]: Finished difference Result 70489 states and 105768 transitions. [2019-09-08 09:48:29,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:48:29,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-09-08 09:48:29,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:29,891 INFO L225 Difference]: With dead ends: 70489 [2019-09-08 09:48:29,891 INFO L226 Difference]: Without dead ends: 47499 [2019-09-08 09:48:29,937 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:48:29,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47499 states. [2019-09-08 09:48:32,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47499 to 47497. [2019-09-08 09:48:32,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47497 states. [2019-09-08 09:48:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47497 states to 47497 states and 70951 transitions. [2019-09-08 09:48:32,459 INFO L78 Accepts]: Start accepts. Automaton has 47497 states and 70951 transitions. Word has length 248 [2019-09-08 09:48:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:32,459 INFO L475 AbstractCegarLoop]: Abstraction has 47497 states and 70951 transitions. [2019-09-08 09:48:32,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:48:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 47497 states and 70951 transitions. [2019-09-08 09:48:32,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-08 09:48:32,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:32,507 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,507 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:32,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:32,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1734884072, now seen corresponding path program 1 times [2019-09-08 09:48:32,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:32,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:32,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:32,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:32,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:32,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:48:32,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:32,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:48:32,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:48:32,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:48:32,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:48:32,814 INFO L87 Difference]: Start difference. First operand 47497 states and 70951 transitions. Second operand 4 states. [2019-09-08 09:48:38,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:38,257 INFO L93 Difference]: Finished difference Result 139196 states and 207534 transitions. [2019-09-08 09:48:38,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:48:38,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 248 [2019-09-08 09:48:38,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:38,381 INFO L225 Difference]: With dead ends: 139196 [2019-09-08 09:48:38,381 INFO L226 Difference]: Without dead ends: 93702 [2019-09-08 09:48:38,455 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:48:38,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93702 states. [2019-09-08 09:48:41,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93702 to 48348. [2019-09-08 09:48:41,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48348 states. [2019-09-08 09:48:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48348 states to 48348 states and 72354 transitions. [2019-09-08 09:48:41,419 INFO L78 Accepts]: Start accepts. Automaton has 48348 states and 72354 transitions. Word has length 248 [2019-09-08 09:48:41,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:41,420 INFO L475 AbstractCegarLoop]: Abstraction has 48348 states and 72354 transitions. [2019-09-08 09:48:41,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:48:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 48348 states and 72354 transitions. [2019-09-08 09:48:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-08 09:48:41,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:41,462 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,462 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:41,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:41,462 INFO L82 PathProgramCache]: Analyzing trace with hash -295412293, now seen corresponding path program 1 times [2019-09-08 09:48:41,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:41,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:41,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:41,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:41,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:41,700 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:41,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:41,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:48:41,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:48:41,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:48:41,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:48:41,702 INFO L87 Difference]: Start difference. First operand 48348 states and 72354 transitions. Second operand 3 states. [2019-09-08 09:48:47,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:47,796 INFO L93 Difference]: Finished difference Result 139440 states and 207883 transitions. [2019-09-08 09:48:47,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:48:47,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-09-08 09:48:47,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:47,921 INFO L225 Difference]: With dead ends: 139440 [2019-09-08 09:48:47,921 INFO L226 Difference]: Without dead ends: 93438 [2019-09-08 09:48:47,990 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:48:48,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93438 states. [2019-09-08 09:48:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93438 to 93436. [2019-09-08 09:48:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93436 states. [2019-09-08 09:48:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93436 states to 93436 states and 138563 transitions. [2019-09-08 09:48:53,358 INFO L78 Accepts]: Start accepts. Automaton has 93436 states and 138563 transitions. Word has length 248 [2019-09-08 09:48:53,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:53,358 INFO L475 AbstractCegarLoop]: Abstraction has 93436 states and 138563 transitions. [2019-09-08 09:48:53,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:48:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 93436 states and 138563 transitions. [2019-09-08 09:48:53,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 09:48:53,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:53,438 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,439 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:53,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:53,439 INFO L82 PathProgramCache]: Analyzing trace with hash 134212028, now seen corresponding path program 1 times [2019-09-08 09:48:53,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:53,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:53,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:53,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:53,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:55,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:48:55,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:55,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:48:55,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:48:55,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:48:55,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:48:55,136 INFO L87 Difference]: Start difference. First operand 93436 states and 138563 transitions. Second operand 4 states. [2019-09-08 09:48:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:59,585 INFO L93 Difference]: Finished difference Result 167942 states and 248322 transitions. [2019-09-08 09:48:59,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:48:59,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 250 [2019-09-08 09:48:59,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:59,678 INFO L225 Difference]: With dead ends: 167942 [2019-09-08 09:48:59,679 INFO L226 Difference]: Without dead ends: 80220 [2019-09-08 09:48:59,749 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:48:59,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80220 states. [2019-09-08 09:49:06,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80220 to 79612. [2019-09-08 09:49:06,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79612 states. [2019-09-08 09:49:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79612 states to 79612 states and 117874 transitions. [2019-09-08 09:49:06,373 INFO L78 Accepts]: Start accepts. Automaton has 79612 states and 117874 transitions. Word has length 250 [2019-09-08 09:49:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:49:06,374 INFO L475 AbstractCegarLoop]: Abstraction has 79612 states and 117874 transitions. [2019-09-08 09:49:06,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:49:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 79612 states and 117874 transitions. [2019-09-08 09:49:06,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 09:49:06,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:49:06,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,428 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:49:06,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:49:06,429 INFO L82 PathProgramCache]: Analyzing trace with hash 869891100, now seen corresponding path program 1 times [2019-09-08 09:49:06,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:49:06,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:49:06,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:06,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:49:06,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:49:06,848 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:06,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:49:06,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:49:06,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:49:06,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:49:06,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:49:06,850 INFO L87 Difference]: Start difference. First operand 79612 states and 117874 transitions. Second operand 4 states. [2019-09-08 09:49:15,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:49:15,924 INFO L93 Difference]: Finished difference Result 227789 states and 336932 transitions. [2019-09-08 09:49:15,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:49:15,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-09-08 09:49:15,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:49:16,144 INFO L225 Difference]: With dead ends: 227789 [2019-09-08 09:49:16,145 INFO L226 Difference]: Without dead ends: 148395 [2019-09-08 09:49:16,234 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:16,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148395 states. [2019-09-08 09:49:27,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148395 to 148393. [2019-09-08 09:49:27,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148393 states. [2019-09-08 09:49:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148393 states to 148393 states and 217994 transitions. [2019-09-08 09:49:27,797 INFO L78 Accepts]: Start accepts. Automaton has 148393 states and 217994 transitions. Word has length 254 [2019-09-08 09:49:27,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:49:27,797 INFO L475 AbstractCegarLoop]: Abstraction has 148393 states and 217994 transitions. [2019-09-08 09:49:27,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:49:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 148393 states and 217994 transitions. [2019-09-08 09:49:27,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-08 09:49:27,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:49:27,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,907 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:49:27,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:49:27,907 INFO L82 PathProgramCache]: Analyzing trace with hash 357940351, now seen corresponding path program 1 times [2019-09-08 09:49:27,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:49:27,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:49:27,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:27,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:49:27,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:49:28,096 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:28,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:49:28,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:49:28,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:49:28,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:49:28,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:49:28,099 INFO L87 Difference]: Start difference. First operand 148393 states and 217994 transitions. Second operand 3 states. [2019-09-08 09:49:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:49:48,169 INFO L93 Difference]: Finished difference Result 432701 states and 633735 transitions. [2019-09-08 09:49:48,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:49:48,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-09-08 09:49:48,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:49:48,544 INFO L225 Difference]: With dead ends: 432701 [2019-09-08 09:49:48,544 INFO L226 Difference]: Without dead ends: 289891 [2019-09-08 09:49:48,676 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:49:48,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289891 states. [2019-09-08 09:50:12,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289891 to 289826. [2019-09-08 09:50:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289826 states. [2019-09-08 09:50:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289826 states to 289826 states and 422122 transitions. [2019-09-08 09:50:13,995 INFO L78 Accepts]: Start accepts. Automaton has 289826 states and 422122 transitions. Word has length 256 [2019-09-08 09:50:13,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:13,995 INFO L475 AbstractCegarLoop]: Abstraction has 289826 states and 422122 transitions. [2019-09-08 09:50:13,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:50:13,996 INFO L276 IsEmpty]: Start isEmpty. Operand 289826 states and 422122 transitions. [2019-09-08 09:50:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-08 09:50:14,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:14,190 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,190 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:14,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:14,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1555643955, now seen corresponding path program 1 times [2019-09-08 09:50:14,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:14,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:14,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:14,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:14,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:14,378 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:14,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:14,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:50:14,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:50:14,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:50:14,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:50:14,380 INFO L87 Difference]: Start difference. First operand 289826 states and 422122 transitions. Second operand 3 states. [2019-09-08 09:50:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:58,903 INFO L93 Difference]: Finished difference Result 844473 states and 1226664 transitions. [2019-09-08 09:50:58,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:50:58,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-09-08 09:50:58,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:59,775 INFO L225 Difference]: With dead ends: 844473 [2019-09-08 09:50:59,775 INFO L226 Difference]: Without dead ends: 566951 [2019-09-08 09:51:00,002 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:51:00,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566951 states. [2019-09-08 09:51:53,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566951 to 566949. [2019-09-08 09:51:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566949 states. [2019-09-08 09:51:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566949 states to 566949 states and 818746 transitions. [2019-09-08 09:51:53,996 INFO L78 Accepts]: Start accepts. Automaton has 566949 states and 818746 transitions. Word has length 256 [2019-09-08 09:51:53,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:53,997 INFO L475 AbstractCegarLoop]: Abstraction has 566949 states and 818746 transitions. [2019-09-08 09:51:53,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:53,997 INFO L276 IsEmpty]: Start isEmpty. Operand 566949 states and 818746 transitions. [2019-09-08 09:51:54,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-08 09:51:54,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:54,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,397 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:54,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:54,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1957982058, now seen corresponding path program 1 times [2019-09-08 09:51:54,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:54,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:54,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:54,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:54,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:54,642 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:54,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:54,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:51:54,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:51:54,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:51:54,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:51:54,645 INFO L87 Difference]: Start difference. First operand 566949 states and 818746 transitions. Second operand 4 states. [2019-09-08 09:53:12,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:53:12,675 INFO L93 Difference]: Finished difference Result 1423723 states and 2048864 transitions. [2019-09-08 09:53:12,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:53:12,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2019-09-08 09:53:12,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:53:13,970 INFO L225 Difference]: With dead ends: 1423723 [2019-09-08 09:53:13,971 INFO L226 Difference]: Without dead ends: 889643 [2019-09-08 09:53:14,385 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:53:15,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889643 states. [2019-09-08 09:54:12,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889643 to 541217. [2019-09-08 09:54:12,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541217 states. [2019-09-08 09:54:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541217 states to 541217 states and 781608 transitions. [2019-09-08 09:54:24,747 INFO L78 Accepts]: Start accepts. Automaton has 541217 states and 781608 transitions. Word has length 256 [2019-09-08 09:54:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:24,748 INFO L475 AbstractCegarLoop]: Abstraction has 541217 states and 781608 transitions. [2019-09-08 09:54:24,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:54:24,748 INFO L276 IsEmpty]: Start isEmpty. Operand 541217 states and 781608 transitions. [2019-09-08 09:54:25,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-08 09:54:25,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:25,126 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:25,126 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:25,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:25,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2062702899, now seen corresponding path program 1 times [2019-09-08 09:54:25,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:25,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:25,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:25,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:54:25,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:25,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:25,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:25,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:25,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:25,236 INFO L87 Difference]: Start difference. First operand 541217 states and 781608 transitions. Second operand 3 states. [2019-09-08 09:55:45,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:45,374 INFO L93 Difference]: Finished difference Result 1399505 states and 2012838 transitions. [2019-09-08 09:55:45,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:55:45,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-09-08 09:55:45,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:46,752 INFO L225 Difference]: With dead ends: 1399505 [2019-09-08 09:55:46,752 INFO L226 Difference]: Without dead ends: 912859 [2019-09-08 09:55:47,139 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:55:47,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912859 states. [2019-09-08 09:56:55,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912859 to 542177. [2019-09-08 09:56:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542177 states. [2019-09-08 09:56:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542177 states to 542177 states and 781852 transitions. [2019-09-08 09:56:56,132 INFO L78 Accepts]: Start accepts. Automaton has 542177 states and 781852 transitions. Word has length 257 [2019-09-08 09:56:56,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:56,133 INFO L475 AbstractCegarLoop]: Abstraction has 542177 states and 781852 transitions. [2019-09-08 09:56:56,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:56:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand 542177 states and 781852 transitions. [2019-09-08 09:56:58,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-08 09:56:58,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:58,114 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:58,114 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:58,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:58,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1184695454, now seen corresponding path program 1 times [2019-09-08 09:56:58,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:58,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:58,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:58,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:58,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:58,346 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:56:58,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:58,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:56:58,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:56:58,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:56:58,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:56:58,349 INFO L87 Difference]: Start difference. First operand 542177 states and 781852 transitions. Second operand 4 states. [2019-09-08 09:57:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:47,001 INFO L93 Difference]: Finished difference Result 986255 states and 1418781 transitions. [2019-09-08 09:57:47,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:57:47,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2019-09-08 09:57:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:47,788 INFO L225 Difference]: With dead ends: 986255 [2019-09-08 09:57:47,788 INFO L226 Difference]: Without dead ends: 483089 [2019-09-08 09:57:48,152 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:57:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483089 states. [2019-09-08 09:58:29,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483089 to 478777. [2019-09-08 09:58:29,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478777 states. [2019-09-08 09:58:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478777 states to 478777 states and 689509 transitions. [2019-09-08 09:58:30,104 INFO L78 Accepts]: Start accepts. Automaton has 478777 states and 689509 transitions. Word has length 258 [2019-09-08 09:58:30,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:58:30,105 INFO L475 AbstractCegarLoop]: Abstraction has 478777 states and 689509 transitions. [2019-09-08 09:58:30,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:58:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 478777 states and 689509 transitions. [2019-09-08 09:58:30,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 09:58:30,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:58:30,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:30,485 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:58:30,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:58:30,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1777596726, now seen corresponding path program 1 times [2019-09-08 09:58:30,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:58:30,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:58:30,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:58:30,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:58:30,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:58:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:58:30,820 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:58:30,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:58:30,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:58:30,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:58:30,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:58:30,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:58:30,822 INFO L87 Difference]: Start difference. First operand 478777 states and 689509 transitions. Second operand 4 states.