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_lcr.6.ufo.BOUNDED-12.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 08:00:03,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 08:00:03,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 08:00:03,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 08:00:03,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 08:00:03,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 08:00:03,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 08:00:03,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 08:00:03,643 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 08:00:03,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 08:00:03,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 08:00:03,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 08:00:03,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 08:00:03,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 08:00:03,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 08:00:03,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 08:00:03,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 08:00:03,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 08:00:03,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 08:00:03,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 08:00:03,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 08:00:03,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 08:00:03,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 08:00:03,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 08:00:03,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 08:00:03,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 08:00:03,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 08:00:03,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 08:00:03,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 08:00:03,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 08:00:03,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 08:00:03,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 08:00:03,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 08:00:03,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 08:00:03,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 08:00:03,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 08:00:03,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 08:00:03,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 08:00:03,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 08:00:03,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 08:00:03,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 08:00:03,684 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:00:03,711 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 08:00:03,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 08:00:03,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 08:00:03,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 08:00:03,714 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 08:00:03,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 08:00:03,715 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 08:00:03,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 08:00:03,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 08:00:03,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 08:00:03,716 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 08:00:03,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 08:00:03,716 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 08:00:03,717 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 08:00:03,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 08:00:03,717 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 08:00:03,717 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 08:00:03,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 08:00:03,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 08:00:03,718 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 08:00:03,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 08:00:03,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:00:03,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 08:00:03,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 08:00:03,720 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 08:00:03,720 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 08:00:03,720 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 08:00:03,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 08:00:03,720 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 08:00:03,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 08:00:03,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 08:00:03,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 08:00:03,791 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 08:00:03,792 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 08:00:03,792 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c [2019-09-08 08:00:03,873 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/432b81670/11c8b044eed349a08dd80c6d1a1f8d3d/FLAGe078ced7d [2019-09-08 08:00:04,477 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 08:00:04,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c [2019-09-08 08:00:04,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/432b81670/11c8b044eed349a08dd80c6d1a1f8d3d/FLAGe078ced7d [2019-09-08 08:00:04,870 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/432b81670/11c8b044eed349a08dd80c6d1a1f8d3d [2019-09-08 08:00:04,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 08:00:04,880 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 08:00:04,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 08:00:04,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 08:00:04,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 08:00:04,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:00:04" (1/1) ... [2019-09-08 08:00:04,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b4cf35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:00:04, skipping insertion in model container [2019-09-08 08:00:04,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:00:04" (1/1) ... [2019-09-08 08:00:04,895 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 08:00:04,953 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 08:00:05,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:00:05,312 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 08:00:05,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:00:05,425 INFO L192 MainTranslator]: Completed translation [2019-09-08 08:00:05,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:00:05 WrapperNode [2019-09-08 08:00:05,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 08:00:05,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 08:00:05,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 08:00:05,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 08:00:05,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:00:05" (1/1) ... [2019-09-08 08:00:05,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:00:05" (1/1) ... [2019-09-08 08:00:05,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:00:05" (1/1) ... [2019-09-08 08:00:05,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:00:05" (1/1) ... [2019-09-08 08:00:05,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:00:05" (1/1) ... [2019-09-08 08:00:05,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:00:05" (1/1) ... [2019-09-08 08:00:05,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:00:05" (1/1) ... [2019-09-08 08:00:05,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 08:00:05,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 08:00:05,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 08:00:05,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 08:00:05,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:00: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 08:00:05,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 08:00:05,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 08:00:05,535 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 08:00:05,535 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 08:00:05,535 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 08:00:05,535 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 08:00:05,535 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-08 08:00:05,535 INFO L138 BoogieDeclarations]: Found implementation of procedure node6 [2019-09-08 08:00:05,536 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 08:00:05,536 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 08:00:05,536 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 08:00:05,536 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 08:00:05,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 08:00:05,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 08:00:05,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 08:00:05,537 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 08:00:05,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 08:00:05,537 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 08:00:05,537 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 08:00:05,537 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 08:00:05,538 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 08:00:05,538 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 08:00:05,538 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 08:00:05,538 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 08:00:05,538 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 08:00:05,538 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 08:00:05,539 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 08:00:05,539 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 08:00:05,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 08:00:05,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 08:00:06,379 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 08:00:06,380 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 08:00:06,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:00:06 BoogieIcfgContainer [2019-09-08 08:00:06,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 08:00:06,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 08:00:06,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 08:00:06,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 08:00:06,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:00:04" (1/3) ... [2019-09-08 08:00:06,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fae2b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:00:06, skipping insertion in model container [2019-09-08 08:00:06,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:00:05" (2/3) ... [2019-09-08 08:00:06,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fae2b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:00:06, skipping insertion in model container [2019-09-08 08:00:06,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:00:06" (3/3) ... [2019-09-08 08:00:06,391 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c [2019-09-08 08:00:06,402 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 08:00:06,412 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 08:00:06,429 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 08:00:06,461 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 08:00:06,462 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 08:00:06,462 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 08:00:06,462 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 08:00:06,463 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 08:00:06,463 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 08:00:06,463 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 08:00:06,463 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 08:00:06,463 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 08:00:06,489 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2019-09-08 08:00:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 08:00:06,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:00:06,502 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:00:06,504 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:00:06,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:00:06,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1413295764, now seen corresponding path program 1 times [2019-09-08 08:00:06,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:00:06,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:00:06,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:06,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:00:06,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:00:06,908 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:00:06,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:00:06,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:00:06,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:00:06,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:00:06,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:00:06,932 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2019-09-08 08:00:07,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:00:07,101 INFO L93 Difference]: Finished difference Result 240 states and 355 transitions. [2019-09-08 08:00:07,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:00:07,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 08:00:07,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:00:07,134 INFO L225 Difference]: With dead ends: 240 [2019-09-08 08:00:07,135 INFO L226 Difference]: Without dead ends: 139 [2019-09-08 08:00:07,139 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:00:07,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-08 08:00:07,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-09-08 08:00:07,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-08 08:00:07,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 174 transitions. [2019-09-08 08:00:07,188 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 174 transitions. Word has length 68 [2019-09-08 08:00:07,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:00:07,189 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 174 transitions. [2019-09-08 08:00:07,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:00:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 174 transitions. [2019-09-08 08:00:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 08:00:07,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:00:07,194 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] [2019-09-08 08:00:07,195 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:00:07,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:00:07,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1130534395, now seen corresponding path program 1 times [2019-09-08 08:00:07,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:00:07,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:00:07,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:07,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:00:07,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:00:07,737 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:00:07,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:00:07,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 08:00:07,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 08:00:07,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 08:00:07,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 08:00:07,743 INFO L87 Difference]: Start difference. First operand 139 states and 174 transitions. Second operand 15 states. [2019-09-08 08:00:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:00:16,756 INFO L93 Difference]: Finished difference Result 1572 states and 2414 transitions. [2019-09-08 08:00:16,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-08 08:00:16,757 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 107 [2019-09-08 08:00:16,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:00:16,778 INFO L225 Difference]: With dead ends: 1572 [2019-09-08 08:00:16,778 INFO L226 Difference]: Without dead ends: 1485 [2019-09-08 08:00:16,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2177 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1247, Invalid=4759, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 08:00:16,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2019-09-08 08:00:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1121. [2019-09-08 08:00:17,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2019-09-08 08:00:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1601 transitions. [2019-09-08 08:00:17,021 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1601 transitions. Word has length 107 [2019-09-08 08:00:17,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:00:17,025 INFO L475 AbstractCegarLoop]: Abstraction has 1121 states and 1601 transitions. [2019-09-08 08:00:17,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 08:00:17,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1601 transitions. [2019-09-08 08:00:17,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 08:00:17,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:00:17,042 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] [2019-09-08 08:00:17,042 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:00:17,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:00:17,044 INFO L82 PathProgramCache]: Analyzing trace with hash -2055527989, now seen corresponding path program 1 times [2019-09-08 08:00:17,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:00:17,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:00:17,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:17,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:00:17,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:00:17,178 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:00:17,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:00:17,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 08:00:17,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 08:00:17,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 08:00:17,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 08:00:17,187 INFO L87 Difference]: Start difference. First operand 1121 states and 1601 transitions. Second operand 3 states. [2019-09-08 08:00:17,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:00:17,295 INFO L93 Difference]: Finished difference Result 3182 states and 4612 transitions. [2019-09-08 08:00:17,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 08:00:17,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-08 08:00:17,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:00:17,308 INFO L225 Difference]: With dead ends: 3182 [2019-09-08 08:00:17,308 INFO L226 Difference]: Without dead ends: 2113 [2019-09-08 08:00:17,313 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 08:00:17,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2019-09-08 08:00:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2111. [2019-09-08 08:00:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2019-09-08 08:00:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3017 transitions. [2019-09-08 08:00:17,460 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3017 transitions. Word has length 109 [2019-09-08 08:00:17,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:00:17,462 INFO L475 AbstractCegarLoop]: Abstraction has 2111 states and 3017 transitions. [2019-09-08 08:00:17,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 08:00:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3017 transitions. [2019-09-08 08:00:17,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 08:00:17,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:00:17,467 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] [2019-09-08 08:00:17,467 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:00:17,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:00:17,468 INFO L82 PathProgramCache]: Analyzing trace with hash 951736851, now seen corresponding path program 1 times [2019-09-08 08:00:17,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:00:17,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:00:17,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:17,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:00:17,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:00:17,648 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:00:17,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:00:17,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:00:17,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:00:17,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:00:17,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:00:17,650 INFO L87 Difference]: Start difference. First operand 2111 states and 3017 transitions. Second operand 5 states. [2019-09-08 08:00:18,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:00:18,548 INFO L93 Difference]: Finished difference Result 5325 states and 7650 transitions. [2019-09-08 08:00:18,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:00:18,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-08 08:00:18,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:00:18,571 INFO L225 Difference]: With dead ends: 5325 [2019-09-08 08:00:18,572 INFO L226 Difference]: Without dead ends: 3266 [2019-09-08 08:00:18,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:00:18,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2019-09-08 08:00:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3264. [2019-09-08 08:00:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3264 states. [2019-09-08 08:00:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3264 states to 3264 states and 4615 transitions. [2019-09-08 08:00:18,875 INFO L78 Accepts]: Start accepts. Automaton has 3264 states and 4615 transitions. Word has length 109 [2019-09-08 08:00:18,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:00:18,876 INFO L475 AbstractCegarLoop]: Abstraction has 3264 states and 4615 transitions. [2019-09-08 08:00:18,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:00:18,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3264 states and 4615 transitions. [2019-09-08 08:00:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 08:00:18,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:00:18,881 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] [2019-09-08 08:00:18,881 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:00:18,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:00:18,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1139243427, now seen corresponding path program 1 times [2019-09-08 08:00:18,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:00:18,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:00:18,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:18,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:00:18,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:00:19,044 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:00:19,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:00:19,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:00:19,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:00:19,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:00:19,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:00:19,046 INFO L87 Difference]: Start difference. First operand 3264 states and 4615 transitions. Second operand 5 states. [2019-09-08 08:00:20,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:00:20,130 INFO L93 Difference]: Finished difference Result 9463 states and 13447 transitions. [2019-09-08 08:00:20,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:00:20,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-08 08:00:20,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:00:20,165 INFO L225 Difference]: With dead ends: 9463 [2019-09-08 08:00:20,165 INFO L226 Difference]: Without dead ends: 6251 [2019-09-08 08:00:20,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:00:20,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2019-09-08 08:00:20,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 6249. [2019-09-08 08:00:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6249 states. [2019-09-08 08:00:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6249 states to 6249 states and 8778 transitions. [2019-09-08 08:00:20,559 INFO L78 Accepts]: Start accepts. Automaton has 6249 states and 8778 transitions. Word has length 109 [2019-09-08 08:00:20,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:00:20,560 INFO L475 AbstractCegarLoop]: Abstraction has 6249 states and 8778 transitions. [2019-09-08 08:00:20,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:00:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 6249 states and 8778 transitions. [2019-09-08 08:00:20,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 08:00:20,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:00:20,563 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] [2019-09-08 08:00:20,563 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:00:20,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:00:20,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1804548435, now seen corresponding path program 1 times [2019-09-08 08:00:20,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:00:20,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:00:20,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:20,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:00:20,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:00:20,774 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:00:20,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:00:20,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:00:20,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:00:20,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:00:20,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:00:20,776 INFO L87 Difference]: Start difference. First operand 6249 states and 8778 transitions. Second operand 5 states. [2019-09-08 08:00:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:00:21,801 INFO L93 Difference]: Finished difference Result 18175 states and 25630 transitions. [2019-09-08 08:00:21,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:00:21,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-08 08:00:21,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:00:21,904 INFO L225 Difference]: With dead ends: 18175 [2019-09-08 08:00:21,906 INFO L226 Difference]: Without dead ends: 11978 [2019-09-08 08:00:21,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:00:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11978 states. [2019-09-08 08:00:22,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11978 to 11976. [2019-09-08 08:00:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11976 states. [2019-09-08 08:00:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11976 states to 11976 states and 16693 transitions. [2019-09-08 08:00:22,795 INFO L78 Accepts]: Start accepts. Automaton has 11976 states and 16693 transitions. Word has length 109 [2019-09-08 08:00:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:00:22,796 INFO L475 AbstractCegarLoop]: Abstraction has 11976 states and 16693 transitions. [2019-09-08 08:00:22,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:00:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 11976 states and 16693 transitions. [2019-09-08 08:00:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 08:00:22,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:00:22,798 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] [2019-09-08 08:00:22,799 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:00:22,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:00:22,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1227473505, now seen corresponding path program 1 times [2019-09-08 08:00:22,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:00:22,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:00:22,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:22,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:00:22,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:00:22,918 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:00:22,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:00:22,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:00:22,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:00:22,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:00:22,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:00:22,920 INFO L87 Difference]: Start difference. First operand 11976 states and 16693 transitions. Second operand 5 states. [2019-09-08 08:00:24,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:00:24,692 INFO L93 Difference]: Finished difference Result 34852 states and 48751 transitions. [2019-09-08 08:00:24,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:00:24,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-08 08:00:24,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:00:24,828 INFO L225 Difference]: With dead ends: 34852 [2019-09-08 08:00:24,829 INFO L226 Difference]: Without dead ends: 22928 [2019-09-08 08:00:24,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:00:24,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22928 states. [2019-09-08 08:00:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22928 to 22926. [2019-09-08 08:00:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22926 states. [2019-09-08 08:00:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22926 states to 22926 states and 31689 transitions. [2019-09-08 08:00:26,174 INFO L78 Accepts]: Start accepts. Automaton has 22926 states and 31689 transitions. Word has length 109 [2019-09-08 08:00:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:00:26,175 INFO L475 AbstractCegarLoop]: Abstraction has 22926 states and 31689 transitions. [2019-09-08 08:00:26,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:00:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 22926 states and 31689 transitions. [2019-09-08 08:00:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 08:00:26,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:00:26,177 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] [2019-09-08 08:00:26,177 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:00:26,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:00:26,177 INFO L82 PathProgramCache]: Analyzing trace with hash 20035349, now seen corresponding path program 1 times [2019-09-08 08:00:26,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:00:26,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:00:26,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:26,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:00:26,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:00:26,474 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:00:26,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:00:26,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:00:26,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:00:26,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:00:26,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:00:26,476 INFO L87 Difference]: Start difference. First operand 22926 states and 31689 transitions. Second operand 5 states. [2019-09-08 08:00:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:00:28,394 INFO L93 Difference]: Finished difference Result 66658 states and 92467 transitions. [2019-09-08 08:00:28,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:00:28,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-08 08:00:28,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:00:28,588 INFO L225 Difference]: With dead ends: 66658 [2019-09-08 08:00:28,588 INFO L226 Difference]: Without dead ends: 43784 [2019-09-08 08:00:28,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:00:28,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43784 states. [2019-09-08 08:00:31,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43784 to 43782. [2019-09-08 08:00:31,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43782 states. [2019-09-08 08:00:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43782 states to 43782 states and 59989 transitions. [2019-09-08 08:00:32,005 INFO L78 Accepts]: Start accepts. Automaton has 43782 states and 59989 transitions. Word has length 109 [2019-09-08 08:00:32,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:00:32,005 INFO L475 AbstractCegarLoop]: Abstraction has 43782 states and 59989 transitions. [2019-09-08 08:00:32,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:00:32,006 INFO L276 IsEmpty]: Start isEmpty. Operand 43782 states and 59989 transitions. [2019-09-08 08:00:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 08:00:32,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:00:32,008 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] [2019-09-08 08:00:32,008 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:00:32,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:00:32,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1618192801, now seen corresponding path program 1 times [2019-09-08 08:00:32,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:00:32,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:00:32,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:32,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:00:32,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:00:32,118 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:00:32,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:00:32,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:00:32,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:00:32,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:00:32,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:00:32,120 INFO L87 Difference]: Start difference. First operand 43782 states and 59989 transitions. Second operand 5 states. [2019-09-08 08:00:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:00:34,977 INFO L93 Difference]: Finished difference Result 127066 states and 174775 transitions. [2019-09-08 08:00:34,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:00:34,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-08 08:00:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:00:35,310 INFO L225 Difference]: With dead ends: 127066 [2019-09-08 08:00:35,310 INFO L226 Difference]: Without dead ends: 83336 [2019-09-08 08:00:35,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:00:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83336 states. [2019-09-08 08:00:41,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83336 to 83334. [2019-09-08 08:00:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83334 states. [2019-09-08 08:00:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83334 states to 83334 states and 113157 transitions. [2019-09-08 08:00:41,623 INFO L78 Accepts]: Start accepts. Automaton has 83334 states and 113157 transitions. Word has length 109 [2019-09-08 08:00:41,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:00:41,624 INFO L475 AbstractCegarLoop]: Abstraction has 83334 states and 113157 transitions. [2019-09-08 08:00:41,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:00:41,624 INFO L276 IsEmpty]: Start isEmpty. Operand 83334 states and 113157 transitions. [2019-09-08 08:00:41,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 08:00:41,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:00:41,626 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] [2019-09-08 08:00:41,626 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:00:41,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:00:41,626 INFO L82 PathProgramCache]: Analyzing trace with hash -422447531, now seen corresponding path program 1 times [2019-09-08 08:00:41,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:00:41,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:00:41,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:41,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:00:41,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:00:41,942 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:00:41,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:00:41,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 08:00:41,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 08:00:41,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 08:00:41,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 08:00:41,944 INFO L87 Difference]: Start difference. First operand 83334 states and 113157 transitions. Second operand 15 states. [2019-09-08 08:00:59,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:00:59,125 INFO L93 Difference]: Finished difference Result 222298 states and 332063 transitions. [2019-09-08 08:00:59,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 08:00:59,127 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 109 [2019-09-08 08:00:59,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:00:59,765 INFO L225 Difference]: With dead ends: 222298 [2019-09-08 08:00:59,765 INFO L226 Difference]: Without dead ends: 139016 [2019-09-08 08:00:59,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1250, Invalid=4450, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 08:01:00,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139016 states. [2019-09-08 08:01:05,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139016 to 83718. [2019-09-08 08:01:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83718 states. [2019-09-08 08:01:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83718 states to 83718 states and 113157 transitions. [2019-09-08 08:01:05,198 INFO L78 Accepts]: Start accepts. Automaton has 83718 states and 113157 transitions. Word has length 109 [2019-09-08 08:01:05,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:01:05,199 INFO L475 AbstractCegarLoop]: Abstraction has 83718 states and 113157 transitions. [2019-09-08 08:01:05,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 08:01:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 83718 states and 113157 transitions. [2019-09-08 08:01:05,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 08:01:05,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:01:05,201 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] [2019-09-08 08:01:05,201 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:01:05,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:01:05,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1388409668, now seen corresponding path program 1 times [2019-09-08 08:01:05,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:01:05,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:01:05,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:01:05,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:01:05,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:01:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:01:05,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 08:01:05,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:01:05,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:01:05,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:01:05,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:01:05,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:01:05,302 INFO L87 Difference]: Start difference. First operand 83718 states and 113157 transitions. Second operand 5 states. [2019-09-08 08:01:12,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:01:12,289 INFO L93 Difference]: Finished difference Result 243120 states and 330893 transitions. [2019-09-08 08:01:12,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:01:12,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-08 08:01:12,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:01:12,695 INFO L225 Difference]: With dead ends: 243120 [2019-09-08 08:01:12,696 INFO L226 Difference]: Without dead ends: 159454 [2019-09-08 08:01:12,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:01:12,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159454 states. [2019-09-08 08:01:20,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159454 to 109690. [2019-09-08 08:01:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109690 states. [2019-09-08 08:01:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109690 states to 109690 states and 148090 transitions. [2019-09-08 08:01:20,961 INFO L78 Accepts]: Start accepts. Automaton has 109690 states and 148090 transitions. Word has length 110 [2019-09-08 08:01:20,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:01:20,961 INFO L475 AbstractCegarLoop]: Abstraction has 109690 states and 148090 transitions. [2019-09-08 08:01:20,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:01:20,962 INFO L276 IsEmpty]: Start isEmpty. Operand 109690 states and 148090 transitions. [2019-09-08 08:01:20,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 08:01:20,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:01:20,963 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] [2019-09-08 08:01:20,963 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:01:20,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:01:20,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1259132667, now seen corresponding path program 1 times [2019-09-08 08:01:20,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:01:20,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:01:20,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:01:20,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:01:20,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:01:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:01:21,085 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:01:21,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:01:21,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 08:01:21,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 08:01:21,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 08:01:21,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:01:21,087 INFO L87 Difference]: Start difference. First operand 109690 states and 148090 transitions. Second operand 8 states. [2019-09-08 08:01:27,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:01:27,006 INFO L93 Difference]: Finished difference Result 139140 states and 198745 transitions. [2019-09-08 08:01:27,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 08:01:27,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2019-09-08 08:01:27,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:01:27,440 INFO L225 Difference]: With dead ends: 139140 [2019-09-08 08:01:27,441 INFO L226 Difference]: Without dead ends: 139138 [2019-09-08 08:01:27,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:01:27,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139138 states. [2019-09-08 08:01:36,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139138 to 122938. [2019-09-08 08:01:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122938 states. [2019-09-08 08:01:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122938 states to 122938 states and 161562 transitions. [2019-09-08 08:01:36,366 INFO L78 Accepts]: Start accepts. Automaton has 122938 states and 161562 transitions. Word has length 110 [2019-09-08 08:01:36,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:01:36,367 INFO L475 AbstractCegarLoop]: Abstraction has 122938 states and 161562 transitions. [2019-09-08 08:01:36,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 08:01:36,367 INFO L276 IsEmpty]: Start isEmpty. Operand 122938 states and 161562 transitions. [2019-09-08 08:01:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 08:01:36,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:01:36,403 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:36,403 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:01:36,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:01:36,404 INFO L82 PathProgramCache]: Analyzing trace with hash 33206831, now seen corresponding path program 1 times [2019-09-08 08:01:36,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:01:36,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:01:36,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:01:36,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:01:36,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:01:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:01:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 08:01:36,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:01:36,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:01:36,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:01:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:01:36,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 08:01:36,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:01:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 08:01:38,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:01:38,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 27 [2019-09-08 08:01:38,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 08:01:38,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 08:01:38,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2019-09-08 08:01:38,056 INFO L87 Difference]: Start difference. First operand 122938 states and 161562 transitions. Second operand 27 states. [2019-09-08 08:02:25,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:02:25,876 INFO L93 Difference]: Finished difference Result 483074 states and 721966 transitions. [2019-09-08 08:02:25,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-08 08:02:25,876 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 169 [2019-09-08 08:02:25,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:02:28,180 INFO L225 Difference]: With dead ends: 483074 [2019-09-08 08:02:28,180 INFO L226 Difference]: Without dead ends: 369856 [2019-09-08 08:02:28,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7416 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2888, Invalid=16018, Unknown=0, NotChecked=0, Total=18906 [2019-09-08 08:02:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369856 states. [2019-09-08 08:02:59,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369856 to 261626. [2019-09-08 08:02:59,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261626 states. [2019-09-08 08:02:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261626 states to 261626 states and 343242 transitions. [2019-09-08 08:02:59,997 INFO L78 Accepts]: Start accepts. Automaton has 261626 states and 343242 transitions. Word has length 169 [2019-09-08 08:02:59,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:02:59,998 INFO L475 AbstractCegarLoop]: Abstraction has 261626 states and 343242 transitions. [2019-09-08 08:02:59,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 08:02:59,998 INFO L276 IsEmpty]: Start isEmpty. Operand 261626 states and 343242 transitions. [2019-09-08 08:03:00,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 08:03:00,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:03:00,054 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:00,054 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:03:00,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:03:00,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1613870747, now seen corresponding path program 1 times [2019-09-08 08:03:00,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:03:00,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:03:00,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:00,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:03:00,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:03:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 08:03:00,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:03:00,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:03:00,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:03:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:03:00,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 08:03:00,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:03:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 08:03:01,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:03:01,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 28 [2019-09-08 08:03:01,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 08:03:01,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 08:03:01,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2019-09-08 08:03:01,242 INFO L87 Difference]: Start difference. First operand 261626 states and 343242 transitions. Second operand 28 states. [2019-09-08 08:03:08,279 WARN L188 SmtUtils]: Spent 3.56 s on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-09-08 08:04:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:04:41,353 INFO L93 Difference]: Finished difference Result 1599908 states and 2143351 transitions. [2019-09-08 08:04:41,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-09-08 08:04:41,354 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 169 [2019-09-08 08:04:41,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:04:45,268 INFO L225 Difference]: With dead ends: 1599908 [2019-09-08 08:04:45,269 INFO L226 Difference]: Without dead ends: 1357762 [2019-09-08 08:04:45,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 260 SyntacticMatches, 2 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14065 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=4414, Invalid=29258, Unknown=0, NotChecked=0, Total=33672 [2019-09-08 08:04:46,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357762 states. [2019-09-08 08:06:47,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357762 to 1102066. [2019-09-08 08:06:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102066 states. [2019-09-08 08:06:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102066 states to 1102066 states and 1458366 transitions. [2019-09-08 08:06:51,236 INFO L78 Accepts]: Start accepts. Automaton has 1102066 states and 1458366 transitions. Word has length 169 [2019-09-08 08:06:51,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:06:51,236 INFO L475 AbstractCegarLoop]: Abstraction has 1102066 states and 1458366 transitions. [2019-09-08 08:06:51,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 08:06:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1102066 states and 1458366 transitions. [2019-09-08 08:06:51,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 08:06:51,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:06:51,292 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:51,292 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:06:51,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:06:51,293 INFO L82 PathProgramCache]: Analyzing trace with hash -2146993457, now seen corresponding path program 1 times [2019-09-08 08:06:51,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:06:51,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:06:51,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:06:51,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:06:51,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:06:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:06:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 08:06:51,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:06:51,541 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:06:51,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:06:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:06:51,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 08:06:51,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:06:52,144 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 08:06:52,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:06:52,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [14] total 27 [2019-09-08 08:06:52,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 08:06:52,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 08:06:52,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2019-09-08 08:06:52,152 INFO L87 Difference]: Start difference. First operand 1102066 states and 1458366 transitions. Second operand 27 states. [2019-09-08 08:10:09,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:09,920 INFO L93 Difference]: Finished difference Result 3149206 states and 4191264 transitions. [2019-09-08 08:10:09,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-09-08 08:10:09,920 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 169 [2019-09-08 08:10:09,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted.