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/pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 08:19:31,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 08:19:31,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 08:19:31,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 08:19:31,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 08:19:31,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 08:19:31,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 08:19:31,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 08:19:31,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 08:19:31,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 08:19:31,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 08:19:31,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 08:19:31,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 08:19:31,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 08:19:31,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 08:19:31,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 08:19:31,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 08:19:31,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 08:19:31,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 08:19:31,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 08:19:31,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 08:19:31,447 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 08:19:31,448 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 08:19:31,449 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 08:19:31,451 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 08:19:31,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 08:19:31,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 08:19:31,452 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 08:19:31,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 08:19:31,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 08:19:31,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 08:19:31,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 08:19:31,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 08:19:31,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 08:19:31,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 08:19:31,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 08:19:31,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 08:19:31,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 08:19:31,459 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 08:19:31,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 08:19:31,460 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 08:19:31,461 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 08:19:31,476 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 08:19:31,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 08:19:31,478 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 08:19:31,478 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 08:19:31,478 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 08:19:31,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 08:19:31,479 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 08:19:31,479 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 08:19:31,479 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 08:19:31,479 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 08:19:31,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 08:19:31,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 08:19:31,480 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 08:19:31,480 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 08:19:31,480 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 08:19:31,480 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 08:19:31,481 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 08:19:31,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 08:19:31,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 08:19:31,481 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 08:19:31,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 08:19:31,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:19:31,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 08:19:31,482 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 08:19:31,482 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 08:19:31,483 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 08:19:31,483 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 08:19:31,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 08:19:31,483 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 08:19:31,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 08:19:31,528 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 08:19:31,532 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 08:19:31,534 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 08:19:31,534 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 08:19:31,535 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c [2019-09-08 08:19:31,601 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ad234290/24705a506b3c47f6a02987e6c756f457/FLAGbaadab363 [2019-09-08 08:19:32,215 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 08:19:32,219 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c [2019-09-08 08:19:32,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ad234290/24705a506b3c47f6a02987e6c756f457/FLAGbaadab363 [2019-09-08 08:19:32,532 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ad234290/24705a506b3c47f6a02987e6c756f457 [2019-09-08 08:19:32,544 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 08:19:32,546 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 08:19:32,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 08:19:32,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 08:19:32,551 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 08:19:32,552 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:19:32" (1/1) ... [2019-09-08 08:19:32,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e7121e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:19:32, skipping insertion in model container [2019-09-08 08:19:32,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:19:32" (1/1) ... [2019-09-08 08:19:32,562 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 08:19:32,616 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 08:19:33,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:19:33,100 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 08:19:33,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:19:33,232 INFO L192 MainTranslator]: Completed translation [2019-09-08 08:19:33,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:19:33 WrapperNode [2019-09-08 08:19:33,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 08:19:33,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 08:19:33,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 08:19:33,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 08:19:33,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:19:33" (1/1) ... [2019-09-08 08:19:33,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:19:33" (1/1) ... [2019-09-08 08:19:33,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:19:33" (1/1) ... [2019-09-08 08:19:33,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:19:33" (1/1) ... [2019-09-08 08:19:33,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:19:33" (1/1) ... [2019-09-08 08:19:33,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:19:33" (1/1) ... [2019-09-08 08:19:33,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:19:33" (1/1) ... [2019-09-08 08:19:33,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 08:19:33,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 08:19:33,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 08:19:33,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 08:19:33,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:19:33" (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 08:19:33,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 08:19:33,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 08:19:33,428 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 08:19:33,428 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 08:19:33,429 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 08:19:33,429 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 08:19:33,429 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 08:19:33,429 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 08:19:33,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 08:19:33,431 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 08:19:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 08:19:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 08:19:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 08:19:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 08:19:33,433 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 08:19:33,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 08:19:33,436 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 08:19:33,436 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 08:19:33,436 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 08:19:33,436 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 08:19:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 08:19:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 08:19:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 08:19:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 08:19:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 08:19:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 08:19:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 08:19:35,205 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 08:19:35,205 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 08:19:35,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:19:35 BoogieIcfgContainer [2019-09-08 08:19:35,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 08:19:35,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 08:19:35,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 08:19:35,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 08:19:35,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:19:32" (1/3) ... [2019-09-08 08:19:35,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636dbf1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:19:35, skipping insertion in model container [2019-09-08 08:19:35,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:19:33" (2/3) ... [2019-09-08 08:19:35,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636dbf1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:19:35, skipping insertion in model container [2019-09-08 08:19:35,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:19:35" (3/3) ... [2019-09-08 08:19:35,219 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c [2019-09-08 08:19:35,230 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 08:19:35,243 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 08:19:35,261 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 08:19:35,328 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 08:19:35,329 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 08:19:35,329 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 08:19:35,329 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 08:19:35,330 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 08:19:35,330 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 08:19:35,331 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 08:19:35,331 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 08:19:35,331 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 08:19:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states. [2019-09-08 08:19:35,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 08:19:35,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:35,403 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] [2019-09-08 08:19:35,405 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:35,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:35,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1968290658, now seen corresponding path program 1 times [2019-09-08 08:19:35,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:35,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:35,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:35,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:35,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:36,016 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 08:19:36,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:36,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:19:36,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:19:36,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:19:36,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:19:36,043 INFO L87 Difference]: Start difference. First operand 359 states. Second operand 5 states. [2019-09-08 08:19:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:36,289 INFO L93 Difference]: Finished difference Result 515 states and 873 transitions. [2019-09-08 08:19:36,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:19:36,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 08:19:36,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:36,315 INFO L225 Difference]: With dead ends: 515 [2019-09-08 08:19:36,315 INFO L226 Difference]: Without dead ends: 354 [2019-09-08 08:19:36,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:19:36,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-08 08:19:36,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2019-09-08 08:19:36,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-09-08 08:19:36,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 567 transitions. [2019-09-08 08:19:36,398 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 567 transitions. Word has length 102 [2019-09-08 08:19:36,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:36,399 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 567 transitions. [2019-09-08 08:19:36,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:19:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 567 transitions. [2019-09-08 08:19:36,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 08:19:36,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:36,407 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] [2019-09-08 08:19:36,408 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:36,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:36,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1586639344, now seen corresponding path program 1 times [2019-09-08 08:19:36,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:36,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:36,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:36,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:36,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:36,939 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 08:19:36,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:36,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:19:36,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:19:36,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:19:36,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:19:36,943 INFO L87 Difference]: Start difference. First operand 354 states and 567 transitions. Second operand 11 states. [2019-09-08 08:19:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:43,450 INFO L93 Difference]: Finished difference Result 1663 states and 2706 transitions. [2019-09-08 08:19:43,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 08:19:43,451 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 147 [2019-09-08 08:19:43,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:43,469 INFO L225 Difference]: With dead ends: 1663 [2019-09-08 08:19:43,469 INFO L226 Difference]: Without dead ends: 1511 [2019-09-08 08:19:43,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 08:19:43,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2019-09-08 08:19:43,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1284. [2019-09-08 08:19:43,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-09-08 08:19:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2076 transitions. [2019-09-08 08:19:43,660 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2076 transitions. Word has length 147 [2019-09-08 08:19:43,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:43,661 INFO L475 AbstractCegarLoop]: Abstraction has 1284 states and 2076 transitions. [2019-09-08 08:19:43,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:19:43,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2076 transitions. [2019-09-08 08:19:43,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 08:19:43,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:43,674 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] [2019-09-08 08:19:43,674 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:43,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:43,675 INFO L82 PathProgramCache]: Analyzing trace with hash 615152904, now seen corresponding path program 1 times [2019-09-08 08:19:43,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:43,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:43,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:43,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:43,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:43,922 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 08:19:43,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:43,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:19:43,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:19:43,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:19:43,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:19:43,924 INFO L87 Difference]: Start difference. First operand 1284 states and 2076 transitions. Second operand 6 states. [2019-09-08 08:19:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:46,482 INFO L93 Difference]: Finished difference Result 4322 states and 6992 transitions. [2019-09-08 08:19:46,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:19:46,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-09-08 08:19:46,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:46,511 INFO L225 Difference]: With dead ends: 4322 [2019-09-08 08:19:46,511 INFO L226 Difference]: Without dead ends: 3240 [2019-09-08 08:19:46,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:19:46,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3240 states. [2019-09-08 08:19:46,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3240 to 3225. [2019-09-08 08:19:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3225 states. [2019-09-08 08:19:46,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 5194 transitions. [2019-09-08 08:19:46,678 INFO L78 Accepts]: Start accepts. Automaton has 3225 states and 5194 transitions. Word has length 148 [2019-09-08 08:19:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:46,680 INFO L475 AbstractCegarLoop]: Abstraction has 3225 states and 5194 transitions. [2019-09-08 08:19:46,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:19:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 5194 transitions. [2019-09-08 08:19:46,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 08:19:46,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:46,686 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] [2019-09-08 08:19:46,686 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:46,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:46,687 INFO L82 PathProgramCache]: Analyzing trace with hash 512159399, now seen corresponding path program 1 times [2019-09-08 08:19:46,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:46,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:46,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:46,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:46,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:46,916 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 08:19:46,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:46,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:19:46,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:19:46,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:19:46,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:19:46,919 INFO L87 Difference]: Start difference. First operand 3225 states and 5194 transitions. Second operand 6 states. [2019-09-08 08:19:49,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:49,731 INFO L93 Difference]: Finished difference Result 11918 states and 19164 transitions. [2019-09-08 08:19:49,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:19:49,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-09-08 08:19:49,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:49,788 INFO L225 Difference]: With dead ends: 11918 [2019-09-08 08:19:49,788 INFO L226 Difference]: Without dead ends: 8895 [2019-09-08 08:19:49,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:19:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8895 states. [2019-09-08 08:19:50,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8895 to 8865. [2019-09-08 08:19:50,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8865 states. [2019-09-08 08:19:50,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8865 states to 8865 states and 14198 transitions. [2019-09-08 08:19:50,156 INFO L78 Accepts]: Start accepts. Automaton has 8865 states and 14198 transitions. Word has length 149 [2019-09-08 08:19:50,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:50,157 INFO L475 AbstractCegarLoop]: Abstraction has 8865 states and 14198 transitions. [2019-09-08 08:19:50,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:19:50,157 INFO L276 IsEmpty]: Start isEmpty. Operand 8865 states and 14198 transitions. [2019-09-08 08:19:50,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 08:19:50,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:50,162 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:19:50,162 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:50,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:50,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1562643103, now seen corresponding path program 1 times [2019-09-08 08:19:50,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:50,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:50,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:50,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:50,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:50,405 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 08:19:50,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:50,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:19:50,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:19:50,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:19:50,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:19:50,407 INFO L87 Difference]: Start difference. First operand 8865 states and 14198 transitions. Second operand 6 states. [2019-09-08 08:19:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:53,195 INFO L93 Difference]: Finished difference Result 38703 states and 61878 transitions. [2019-09-08 08:19:53,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:19:53,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-09-08 08:19:53,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:53,368 INFO L225 Difference]: With dead ends: 38703 [2019-09-08 08:19:53,368 INFO L226 Difference]: Without dead ends: 30040 [2019-09-08 08:19:53,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:19:53,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30040 states. [2019-09-08 08:19:55,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30040 to 29952. [2019-09-08 08:19:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29952 states. [2019-09-08 08:19:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29952 states to 29952 states and 47748 transitions. [2019-09-08 08:19:55,334 INFO L78 Accepts]: Start accepts. Automaton has 29952 states and 47748 transitions. Word has length 150 [2019-09-08 08:19:55,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:55,334 INFO L475 AbstractCegarLoop]: Abstraction has 29952 states and 47748 transitions. [2019-09-08 08:19:55,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:19:55,335 INFO L276 IsEmpty]: Start isEmpty. Operand 29952 states and 47748 transitions. [2019-09-08 08:19:55,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 08:19:55,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:55,340 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:19:55,340 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:55,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:55,340 INFO L82 PathProgramCache]: Analyzing trace with hash -283785378, now seen corresponding path program 1 times [2019-09-08 08:19:55,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:55,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:55,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:55,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:55,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:55,547 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 08:19:55,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:55,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:19:55,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:19:55,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:19:55,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:19:55,549 INFO L87 Difference]: Start difference. First operand 29952 states and 47748 transitions. Second operand 6 states. [2019-09-08 08:19:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:59,513 INFO L93 Difference]: Finished difference Result 158501 states and 253547 transitions. [2019-09-08 08:19:59,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:19:59,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2019-09-08 08:19:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:20:00,069 INFO L225 Difference]: With dead ends: 158501 [2019-09-08 08:20:00,069 INFO L226 Difference]: Without dead ends: 128751 [2019-09-08 08:20:00,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:20:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128751 states. [2019-09-08 08:20:04,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128751 to 102318. [2019-09-08 08:20:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102318 states. [2019-09-08 08:20:05,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102318 states to 102318 states and 163574 transitions. [2019-09-08 08:20:05,274 INFO L78 Accepts]: Start accepts. Automaton has 102318 states and 163574 transitions. Word has length 151 [2019-09-08 08:20:05,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:20:05,276 INFO L475 AbstractCegarLoop]: Abstraction has 102318 states and 163574 transitions. [2019-09-08 08:20:05,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:20:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 102318 states and 163574 transitions. [2019-09-08 08:20:05,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 08:20:05,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:20:05,298 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] [2019-09-08 08:20:05,307 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:20:05,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:20:05,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1215829162, now seen corresponding path program 1 times [2019-09-08 08:20:05,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:20:05,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:20:05,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:20:05,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:20:05,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:20:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:20:06,949 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 08:20:06,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:20:06,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 08:20:06,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 08:20:06,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 08:20:06,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 08:20:06,952 INFO L87 Difference]: Start difference. First operand 102318 states and 163574 transitions. Second operand 4 states. [2019-09-08 08:20:11,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:20:11,344 INFO L93 Difference]: Finished difference Result 372657 states and 600017 transitions. [2019-09-08 08:20:11,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 08:20:11,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-08 08:20:11,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:20:12,442 INFO L225 Difference]: With dead ends: 372657 [2019-09-08 08:20:12,442 INFO L226 Difference]: Without dead ends: 270541 [2019-09-08 08:20:13,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 08:20:13,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270541 states. [2019-09-08 08:20:21,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270541 to 268533. [2019-09-08 08:20:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268533 states. [2019-09-08 08:20:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268533 states to 268533 states and 428088 transitions. [2019-09-08 08:20:22,533 INFO L78 Accepts]: Start accepts. Automaton has 268533 states and 428088 transitions. Word has length 153 [2019-09-08 08:20:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:20:22,533 INFO L475 AbstractCegarLoop]: Abstraction has 268533 states and 428088 transitions. [2019-09-08 08:20:22,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 08:20:22,534 INFO L276 IsEmpty]: Start isEmpty. Operand 268533 states and 428088 transitions. [2019-09-08 08:20:22,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 08:20:22,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:20:22,543 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] [2019-09-08 08:20:22,544 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:20:22,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:20:22,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1309332968, now seen corresponding path program 1 times [2019-09-08 08:20:22,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:20:22,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:20:22,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:20:22,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:20:22,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:20:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:20:26,410 WARN L188 SmtUtils]: Spent 3.67 s on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-09-08 08:20:26,459 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 08:20:26,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:20:26,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:20:26,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:20:26,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:20:26,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:20:26,461 INFO L87 Difference]: Start difference. First operand 268533 states and 428088 transitions. Second operand 11 states. [2019-09-08 08:20:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:20:39,859 INFO L93 Difference]: Finished difference Result 462885 states and 738948 transitions. [2019-09-08 08:20:39,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 08:20:39,860 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 154 [2019-09-08 08:20:39,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:20:41,252 INFO L225 Difference]: With dead ends: 462885 [2019-09-08 08:20:41,254 INFO L226 Difference]: Without dead ends: 385391 [2019-09-08 08:20:41,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=607, Invalid=2473, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 08:20:41,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385391 states. [2019-09-08 08:20:54,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385391 to 346441. [2019-09-08 08:20:54,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346441 states. [2019-09-08 08:21:00,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346441 states to 346441 states and 552212 transitions. [2019-09-08 08:21:00,965 INFO L78 Accepts]: Start accepts. Automaton has 346441 states and 552212 transitions. Word has length 154 [2019-09-08 08:21:00,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:21:00,966 INFO L475 AbstractCegarLoop]: Abstraction has 346441 states and 552212 transitions. [2019-09-08 08:21:00,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:21:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 346441 states and 552212 transitions. [2019-09-08 08:21:00,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 08:21:00,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:21:00,974 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:21:00,974 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:21:00,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:21:00,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1637949138, now seen corresponding path program 1 times [2019-09-08 08:21:00,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:21:00,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:21:00,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:00,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:21:00,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:21:01,122 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 08:21:01,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:21:01,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 08:21:01,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 08:21:01,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 08:21:01,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:21:01,124 INFO L87 Difference]: Start difference. First operand 346441 states and 552212 transitions. Second operand 7 states. [2019-09-08 08:21:10,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:21:10,058 INFO L93 Difference]: Finished difference Result 619822 states and 989959 transitions. [2019-09-08 08:21:10,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:21:10,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 155 [2019-09-08 08:21:10,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:21:11,114 INFO L225 Difference]: With dead ends: 619822 [2019-09-08 08:21:11,114 INFO L226 Difference]: Without dead ends: 344233 [2019-09-08 08:21:11,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:21:11,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344233 states. [2019-09-08 08:21:24,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344233 to 205789. [2019-09-08 08:21:24,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205789 states. [2019-09-08 08:21:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205789 states to 205789 states and 327366 transitions. [2019-09-08 08:21:24,854 INFO L78 Accepts]: Start accepts. Automaton has 205789 states and 327366 transitions. Word has length 155 [2019-09-08 08:21:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:21:24,857 INFO L475 AbstractCegarLoop]: Abstraction has 205789 states and 327366 transitions. [2019-09-08 08:21:24,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 08:21:24,858 INFO L276 IsEmpty]: Start isEmpty. Operand 205789 states and 327366 transitions. [2019-09-08 08:21:24,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 08:21:24,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:21:24,865 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] [2019-09-08 08:21:24,865 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:21:24,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:21:24,865 INFO L82 PathProgramCache]: Analyzing trace with hash 608589840, now seen corresponding path program 1 times [2019-09-08 08:21:24,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:21:24,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:21:24,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:24,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:21:24,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:21:25,116 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 08:21:25,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:21:25,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 08:21:25,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 08:21:25,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 08:21:25,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:21:25,122 INFO L87 Difference]: Start difference. First operand 205789 states and 327366 transitions. Second operand 12 states. [2019-09-08 08:21:51,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:21:51,716 INFO L93 Difference]: Finished difference Result 714109 states and 1150492 transitions. [2019-09-08 08:21:51,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 08:21:51,717 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 155 [2019-09-08 08:21:51,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:21:53,243 INFO L225 Difference]: With dead ends: 714109 [2019-09-08 08:21:53,244 INFO L226 Difference]: Without dead ends: 555532 [2019-09-08 08:21:53,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=771, Invalid=2651, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 08:21:54,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555532 states. [2019-09-08 08:22:15,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555532 to 459931. [2019-09-08 08:22:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459931 states. [2019-09-08 08:22:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459931 states to 459931 states and 741946 transitions. [2019-09-08 08:22:16,906 INFO L78 Accepts]: Start accepts. Automaton has 459931 states and 741946 transitions. Word has length 155 [2019-09-08 08:22:16,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:22:16,907 INFO L475 AbstractCegarLoop]: Abstraction has 459931 states and 741946 transitions. [2019-09-08 08:22:16,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 08:22:16,907 INFO L276 IsEmpty]: Start isEmpty. Operand 459931 states and 741946 transitions. [2019-09-08 08:22:16,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 08:22:16,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:16,913 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] [2019-09-08 08:22:16,913 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:16,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:16,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1541103031, now seen corresponding path program 1 times [2019-09-08 08:22:16,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:16,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:16,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:16,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:16,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:17,220 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 08:22:17,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:17,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:22:17,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:22:17,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:22:17,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:22:17,223 INFO L87 Difference]: Start difference. First operand 459931 states and 741946 transitions. Second operand 5 states. [2019-09-08 08:22:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:44,249 INFO L93 Difference]: Finished difference Result 1373106 states and 2238114 transitions. [2019-09-08 08:22:44,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:22:44,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-09-08 08:22:44,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:57,961 INFO L225 Difference]: With dead ends: 1373106 [2019-09-08 08:22:57,962 INFO L226 Difference]: Without dead ends: 913191 [2019-09-08 08:22:58,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:22:59,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913191 states. [2019-09-08 08:23:48,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913191 to 913189. [2019-09-08 08:23:48,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913189 states. [2019-09-08 08:24:03,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913189 states to 913189 states and 1462658 transitions. [2019-09-08 08:24:04,024 INFO L78 Accepts]: Start accepts. Automaton has 913189 states and 1462658 transitions. Word has length 156 [2019-09-08 08:24:04,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:24:04,025 INFO L475 AbstractCegarLoop]: Abstraction has 913189 states and 1462658 transitions. [2019-09-08 08:24:04,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:24:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand 913189 states and 1462658 transitions. [2019-09-08 08:24:04,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 08:24:04,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:24:04,037 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] [2019-09-08 08:24:04,037 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:24:04,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:24:04,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2124094970, now seen corresponding path program 1 times [2019-09-08 08:24:04,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:24:04,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:24:04,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:24:04,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:24:04,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:24:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:24:04,220 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 08:24:04,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:24:04,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:24:04,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:24:04,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:24:04,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:24:04,221 INFO L87 Difference]: Start difference. First operand 913189 states and 1462658 transitions. Second operand 5 states. [2019-09-08 08:25:02,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:25:02,938 INFO L93 Difference]: Finished difference Result 2141806 states and 3442413 transitions. [2019-09-08 08:25:02,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:25:02,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-08 08:25:02,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:25:07,152 INFO L225 Difference]: With dead ends: 2141806 [2019-09-08 08:25:07,153 INFO L226 Difference]: Without dead ends: 1230009 [2019-09-08 08:25:08,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:25:09,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230009 states.