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.3.4.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 08:13:09,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 08:13:09,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 08:13:09,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 08:13:09,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 08:13:09,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 08:13:09,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 08:13:09,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 08:13:09,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 08:13:09,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 08:13:09,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 08:13:09,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 08:13:09,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 08:13:09,724 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 08:13:09,725 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 08:13:09,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 08:13:09,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 08:13:09,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 08:13:09,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 08:13:09,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 08:13:09,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 08:13:09,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 08:13:09,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 08:13:09,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 08:13:09,738 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 08:13:09,738 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 08:13:09,739 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 08:13:09,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 08:13:09,740 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 08:13:09,741 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 08:13:09,741 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 08:13:09,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 08:13:09,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 08:13:09,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 08:13:09,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 08:13:09,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 08:13:09,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 08:13:09,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 08:13:09,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 08:13:09,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 08:13:09,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 08:13:09,753 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:13:09,781 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 08:13:09,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 08:13:09,784 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 08:13:09,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 08:13:09,784 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 08:13:09,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 08:13:09,785 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 08:13:09,785 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 08:13:09,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 08:13:09,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 08:13:09,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 08:13:09,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 08:13:09,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 08:13:09,787 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 08:13:09,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 08:13:09,788 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 08:13:09,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 08:13:09,788 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 08:13:09,788 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 08:13:09,789 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 08:13:09,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 08:13:09,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:13:09,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 08:13:09,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 08:13:09,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 08:13:09,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 08:13:09,791 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 08:13:09,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 08:13:09,791 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 08:13:09,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 08:13:09,858 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 08:13:09,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 08:13:09,863 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 08:13:09,864 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 08:13:09,864 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2019-09-08 08:13:09,942 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5288f14ef/c45a00ead5fe4b37bcb4d327afb04dab/FLAG2bc2df040 [2019-09-08 08:13:10,477 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 08:13:10,479 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2019-09-08 08:13:10,496 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5288f14ef/c45a00ead5fe4b37bcb4d327afb04dab/FLAG2bc2df040 [2019-09-08 08:13:10,773 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5288f14ef/c45a00ead5fe4b37bcb4d327afb04dab [2019-09-08 08:13:10,783 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 08:13:10,784 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 08:13:10,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 08:13:10,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 08:13:10,788 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 08:13:10,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:13:10" (1/1) ... [2019-09-08 08:13:10,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f59eba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:10, skipping insertion in model container [2019-09-08 08:13:10,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:13:10" (1/1) ... [2019-09-08 08:13:10,798 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 08:13:10,836 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 08:13:11,236 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:13:11,256 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 08:13:11,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:13:11,345 INFO L192 MainTranslator]: Completed translation [2019-09-08 08:13:11,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:11 WrapperNode [2019-09-08 08:13:11,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 08:13:11,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 08:13:11,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 08:13:11,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 08:13:11,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:11" (1/1) ... [2019-09-08 08:13:11,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:11" (1/1) ... [2019-09-08 08:13:11,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:11" (1/1) ... [2019-09-08 08:13:11,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:11" (1/1) ... [2019-09-08 08:13:11,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:11" (1/1) ... [2019-09-08 08:13:11,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:11" (1/1) ... [2019-09-08 08:13:11,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:11" (1/1) ... [2019-09-08 08:13:11,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 08:13:11,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 08:13:11,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 08:13:11,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 08:13:11,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:11" (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:13:11,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 08:13:11,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 08:13:11,488 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 08:13:11,489 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 08:13:11,489 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 08:13:11,489 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 08:13:11,489 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 08:13:11,489 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 08:13:11,489 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 08:13:11,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 08:13:11,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 08:13:11,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 08:13:11,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 08:13:11,490 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 08:13:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 08:13:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 08:13:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 08:13:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 08:13:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 08:13:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 08:13:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 08:13:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 08:13:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 08:13:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 08:13:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 08:13:12,383 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 08:13:12,384 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 08:13:12,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:13:12 BoogieIcfgContainer [2019-09-08 08:13:12,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 08:13:12,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 08:13:12,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 08:13:12,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 08:13:12,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:13:10" (1/3) ... [2019-09-08 08:13:12,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd6cb34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:13:12, skipping insertion in model container [2019-09-08 08:13:12,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:11" (2/3) ... [2019-09-08 08:13:12,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd6cb34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:13:12, skipping insertion in model container [2019-09-08 08:13:12,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:13:12" (3/3) ... [2019-09-08 08:13:12,396 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2019-09-08 08:13:12,406 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 08:13:12,414 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 08:13:12,430 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 08:13:12,469 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 08:13:12,470 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 08:13:12,470 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 08:13:12,470 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 08:13:12,470 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 08:13:12,471 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 08:13:12,471 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 08:13:12,471 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 08:13:12,471 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 08:13:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2019-09-08 08:13:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 08:13:12,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:12,503 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] [2019-09-08 08:13:12,505 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:12,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:12,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1222599780, now seen corresponding path program 1 times [2019-09-08 08:13:12,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:12,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:12,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:12,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:12,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:12,950 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:13:12,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:12,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:13:12,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:13:12,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:13:12,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:13:12,979 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 5 states. [2019-09-08 08:13:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:13,168 INFO L93 Difference]: Finished difference Result 279 states and 447 transitions. [2019-09-08 08:13:13,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:13:13,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-08 08:13:13,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:13,184 INFO L225 Difference]: With dead ends: 279 [2019-09-08 08:13:13,185 INFO L226 Difference]: Without dead ends: 168 [2019-09-08 08:13:13,189 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:13:13,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-08 08:13:13,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-09-08 08:13:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-08 08:13:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 243 transitions. [2019-09-08 08:13:13,258 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 243 transitions. Word has length 59 [2019-09-08 08:13:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:13,259 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 243 transitions. [2019-09-08 08:13:13,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:13:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 243 transitions. [2019-09-08 08:13:13,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 08:13:13,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:13,263 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] [2019-09-08 08:13:13,264 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:13,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:13,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1294429502, now seen corresponding path program 1 times [2019-09-08 08:13:13,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:13,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:13,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:13,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:13,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:13,641 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:13:13,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:13,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:13:13,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:13:13,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:13:13,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:13:13,646 INFO L87 Difference]: Start difference. First operand 168 states and 243 transitions. Second operand 9 states. [2019-09-08 08:13:16,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:16,567 INFO L93 Difference]: Finished difference Result 1074 states and 1664 transitions. [2019-09-08 08:13:16,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 08:13:16,568 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 08:13:16,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:16,591 INFO L225 Difference]: With dead ends: 1074 [2019-09-08 08:13:16,592 INFO L226 Difference]: Without dead ends: 972 [2019-09-08 08:13:16,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-09-08 08:13:16,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2019-09-08 08:13:16,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 664. [2019-09-08 08:13:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-09-08 08:13:16,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1017 transitions. [2019-09-08 08:13:16,722 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1017 transitions. Word has length 88 [2019-09-08 08:13:16,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:16,723 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 1017 transitions. [2019-09-08 08:13:16,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:13:16,724 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1017 transitions. [2019-09-08 08:13:16,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 08:13:16,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:16,728 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] [2019-09-08 08:13:16,728 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:16,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:16,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1877557831, now seen corresponding path program 1 times [2019-09-08 08:13:16,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:16,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:16,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:16,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:16,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:16,870 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:13:16,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:16,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:13:16,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:13:16,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:13:16,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:13:16,872 INFO L87 Difference]: Start difference. First operand 664 states and 1017 transitions. Second operand 6 states. [2019-09-08 08:13:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:18,005 INFO L93 Difference]: Finished difference Result 1882 states and 2913 transitions. [2019-09-08 08:13:18,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 08:13:18,006 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-09-08 08:13:18,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:18,014 INFO L225 Difference]: With dead ends: 1882 [2019-09-08 08:13:18,014 INFO L226 Difference]: Without dead ends: 1284 [2019-09-08 08:13:18,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 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:13:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-09-08 08:13:18,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 974. [2019-09-08 08:13:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-09-08 08:13:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1495 transitions. [2019-09-08 08:13:18,075 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1495 transitions. Word has length 89 [2019-09-08 08:13:18,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:18,076 INFO L475 AbstractCegarLoop]: Abstraction has 974 states and 1495 transitions. [2019-09-08 08:13:18,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:13:18,076 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1495 transitions. [2019-09-08 08:13:18,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 08:13:18,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:18,079 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:18,079 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:18,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:18,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1476602283, now seen corresponding path program 1 times [2019-09-08 08:13:18,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:18,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:18,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:18,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:18,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:18,198 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:13:18,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:18,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:13:18,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:13:18,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:13:18,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:13:18,200 INFO L87 Difference]: Start difference. First operand 974 states and 1495 transitions. Second operand 6 states. [2019-09-08 08:13:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:19,659 INFO L93 Difference]: Finished difference Result 5433 states and 8433 transitions. [2019-09-08 08:13:19,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:13:19,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-08 08:13:19,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:19,696 INFO L225 Difference]: With dead ends: 5433 [2019-09-08 08:13:19,697 INFO L226 Difference]: Without dead ends: 4525 [2019-09-08 08:13:19,704 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:13:19,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4525 states. [2019-09-08 08:13:19,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4525 to 4499. [2019-09-08 08:13:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4499 states. [2019-09-08 08:13:19,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 6940 transitions. [2019-09-08 08:13:19,946 INFO L78 Accepts]: Start accepts. Automaton has 4499 states and 6940 transitions. Word has length 90 [2019-09-08 08:13:19,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:19,947 INFO L475 AbstractCegarLoop]: Abstraction has 4499 states and 6940 transitions. [2019-09-08 08:13:19,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:13:19,947 INFO L276 IsEmpty]: Start isEmpty. Operand 4499 states and 6940 transitions. [2019-09-08 08:13:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 08:13:19,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:19,950 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] [2019-09-08 08:13:19,950 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:19,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:19,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1983567120, now seen corresponding path program 1 times [2019-09-08 08:13:19,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:19,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:19,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:19,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:19,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:20,076 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:13:20,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:20,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:13:20,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:13:20,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:13:20,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:13:20,079 INFO L87 Difference]: Start difference. First operand 4499 states and 6940 transitions. Second operand 6 states. [2019-09-08 08:13:21,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:21,839 INFO L93 Difference]: Finished difference Result 23027 states and 35626 transitions. [2019-09-08 08:13:21,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:13:21,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-09-08 08:13:21,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:21,961 INFO L225 Difference]: With dead ends: 23027 [2019-09-08 08:13:21,961 INFO L226 Difference]: Without dead ends: 18594 [2019-09-08 08:13:21,978 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:13:22,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18594 states. [2019-09-08 08:13:22,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18594 to 18508. [2019-09-08 08:13:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18508 states. [2019-09-08 08:13:22,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18508 states to 18508 states and 28504 transitions. [2019-09-08 08:13:22,905 INFO L78 Accepts]: Start accepts. Automaton has 18508 states and 28504 transitions. Word has length 91 [2019-09-08 08:13:22,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:22,905 INFO L475 AbstractCegarLoop]: Abstraction has 18508 states and 28504 transitions. [2019-09-08 08:13:22,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:13:22,906 INFO L276 IsEmpty]: Start isEmpty. Operand 18508 states and 28504 transitions. [2019-09-08 08:13:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 08:13:22,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:22,909 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:13:22,909 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:22,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:22,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1312570520, now seen corresponding path program 1 times [2019-09-08 08:13:22,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:22,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:22,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:22,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:22,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:23,081 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:13:23,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:23,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:13:23,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:13:23,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:13:23,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:13:23,085 INFO L87 Difference]: Start difference. First operand 18508 states and 28504 transitions. Second operand 6 states. [2019-09-08 08:13:25,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:25,386 INFO L93 Difference]: Finished difference Result 69083 states and 106872 transitions. [2019-09-08 08:13:25,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 08:13:25,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-09-08 08:13:25,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:25,722 INFO L225 Difference]: With dead ends: 69083 [2019-09-08 08:13:25,723 INFO L226 Difference]: Without dead ends: 50641 [2019-09-08 08:13:25,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:13:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50641 states. [2019-09-08 08:13:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50641 to 50163. [2019-09-08 08:13:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50163 states. [2019-09-08 08:13:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50163 states to 50163 states and 75695 transitions. [2019-09-08 08:13:28,751 INFO L78 Accepts]: Start accepts. Automaton has 50163 states and 75695 transitions. Word has length 93 [2019-09-08 08:13:28,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:28,751 INFO L475 AbstractCegarLoop]: Abstraction has 50163 states and 75695 transitions. [2019-09-08 08:13:28,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:13:28,752 INFO L276 IsEmpty]: Start isEmpty. Operand 50163 states and 75695 transitions. [2019-09-08 08:13:28,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 08:13:28,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:28,757 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] [2019-09-08 08:13:28,758 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:28,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:28,765 INFO L82 PathProgramCache]: Analyzing trace with hash -27207661, now seen corresponding path program 1 times [2019-09-08 08:13:28,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:28,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:28,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:28,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:28,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:28,925 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:13:28,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:28,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:13:28,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:13:28,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:13:28,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:13:28,927 INFO L87 Difference]: Start difference. First operand 50163 states and 75695 transitions. Second operand 5 states. [2019-09-08 08:13:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:32,801 INFO L93 Difference]: Finished difference Result 149329 states and 229507 transitions. [2019-09-08 08:13:32,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:13:32,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-08 08:13:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:33,248 INFO L225 Difference]: With dead ends: 149329 [2019-09-08 08:13:33,249 INFO L226 Difference]: Without dead ends: 99180 [2019-09-08 08:13:33,420 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:13:33,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99180 states. [2019-09-08 08:13:36,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99180 to 99178. [2019-09-08 08:13:36,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99178 states. [2019-09-08 08:13:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99178 states to 99178 states and 147778 transitions. [2019-09-08 08:13:36,502 INFO L78 Accepts]: Start accepts. Automaton has 99178 states and 147778 transitions. Word has length 95 [2019-09-08 08:13:36,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:36,503 INFO L475 AbstractCegarLoop]: Abstraction has 99178 states and 147778 transitions. [2019-09-08 08:13:36,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:13:36,503 INFO L276 IsEmpty]: Start isEmpty. Operand 99178 states and 147778 transitions. [2019-09-08 08:13:36,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:13:36,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:36,507 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:13:36,508 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:36,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:36,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1417757155, now seen corresponding path program 1 times [2019-09-08 08:13:36,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:36,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:36,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:36,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:36,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:36,647 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:13:36,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:36,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:13:36,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:13:36,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:13:36,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:13:36,650 INFO L87 Difference]: Start difference. First operand 99178 states and 147778 transitions. Second operand 5 states. [2019-09-08 08:13:40,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:40,849 INFO L93 Difference]: Finished difference Result 231491 states and 347189 transitions. [2019-09-08 08:13:40,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:13:40,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-08 08:13:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:41,367 INFO L225 Difference]: With dead ends: 231491 [2019-09-08 08:13:41,367 INFO L226 Difference]: Without dead ends: 132433 [2019-09-08 08:13:41,559 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:13:41,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132433 states. [2019-09-08 08:13:47,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132433 to 129218. [2019-09-08 08:13:47,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129218 states. [2019-09-08 08:13:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129218 states to 129218 states and 192754 transitions. [2019-09-08 08:13:47,713 INFO L78 Accepts]: Start accepts. Automaton has 129218 states and 192754 transitions. Word has length 96 [2019-09-08 08:13:47,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:47,714 INFO L475 AbstractCegarLoop]: Abstraction has 129218 states and 192754 transitions. [2019-09-08 08:13:47,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:13:47,714 INFO L276 IsEmpty]: Start isEmpty. Operand 129218 states and 192754 transitions. [2019-09-08 08:13:47,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:13:47,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:47,718 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] [2019-09-08 08:13:47,719 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:47,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:47,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1696645317, now seen corresponding path program 1 times [2019-09-08 08:13:47,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:47,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:47,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:47,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:47,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:47,777 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:13:47,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:47,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 08:13:47,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 08:13:47,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 08:13:47,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 08:13:47,779 INFO L87 Difference]: Start difference. First operand 129218 states and 192754 transitions. Second operand 3 states. [2019-09-08 08:13:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:53,730 INFO L93 Difference]: Finished difference Result 193165 states and 288016 transitions. [2019-09-08 08:13:53,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 08:13:53,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-08 08:13:53,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:54,190 INFO L225 Difference]: With dead ends: 193165 [2019-09-08 08:13:54,190 INFO L226 Difference]: Without dead ends: 129320 [2019-09-08 08:13:54,299 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:13:54,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129320 states. [2019-09-08 08:13:56,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129320 to 129220. [2019-09-08 08:13:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129220 states. [2019-09-08 08:13:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129220 states to 129220 states and 192756 transitions. [2019-09-08 08:13:57,259 INFO L78 Accepts]: Start accepts. Automaton has 129220 states and 192756 transitions. Word has length 96 [2019-09-08 08:13:57,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:57,260 INFO L475 AbstractCegarLoop]: Abstraction has 129220 states and 192756 transitions. [2019-09-08 08:13:57,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 08:13:57,260 INFO L276 IsEmpty]: Start isEmpty. Operand 129220 states and 192756 transitions. [2019-09-08 08:13:57,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 08:13:57,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:57,264 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] [2019-09-08 08:13:57,264 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:57,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:57,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1504546431, now seen corresponding path program 1 times [2019-09-08 08:13:57,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:57,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:57,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:57,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:57,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:57,370 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:13:57,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:57,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 08:13:57,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 08:13:57,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 08:13:57,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 08:13:57,372 INFO L87 Difference]: Start difference. First operand 129220 states and 192756 transitions. Second operand 4 states. [2019-09-08 08:14:00,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:00,416 INFO L93 Difference]: Finished difference Result 258420 states and 385486 transitions. [2019-09-08 08:14:00,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 08:14:00,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-08 08:14:00,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:00,865 INFO L225 Difference]: With dead ends: 258420 [2019-09-08 08:14:00,865 INFO L226 Difference]: Without dead ends: 129217 [2019-09-08 08:14:01,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:14:01,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129217 states. [2019-09-08 08:14:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129217 to 129217. [2019-09-08 08:14:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129217 states. [2019-09-08 08:14:07,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129217 states to 129217 states and 192750 transitions. [2019-09-08 08:14:07,804 INFO L78 Accepts]: Start accepts. Automaton has 129217 states and 192750 transitions. Word has length 97 [2019-09-08 08:14:07,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:07,804 INFO L475 AbstractCegarLoop]: Abstraction has 129217 states and 192750 transitions. [2019-09-08 08:14:07,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 08:14:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 129217 states and 192750 transitions. [2019-09-08 08:14:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 08:14:07,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:07,808 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] [2019-09-08 08:14:07,808 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:07,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:07,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1912897000, now seen corresponding path program 1 times [2019-09-08 08:14:07,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:07,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:07,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:07,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:07,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:07,931 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:14:07,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:07,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:14:07,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:14:07,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:14:07,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:14:07,932 INFO L87 Difference]: Start difference. First operand 129217 states and 192750 transitions. Second operand 5 states. [2019-09-08 08:14:11,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:11,986 INFO L93 Difference]: Finished difference Result 322246 states and 490795 transitions. [2019-09-08 08:14:11,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:14:11,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 08:14:11,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:12,662 INFO L225 Difference]: With dead ends: 322246 [2019-09-08 08:14:12,663 INFO L226 Difference]: Without dead ends: 193062 [2019-09-08 08:14:12,928 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:14:13,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193062 states. [2019-09-08 08:14:21,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193062 to 193060. [2019-09-08 08:14:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193060 states. [2019-09-08 08:14:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193060 states to 193060 states and 284481 transitions. [2019-09-08 08:14:22,307 INFO L78 Accepts]: Start accepts. Automaton has 193060 states and 284481 transitions. Word has length 97 [2019-09-08 08:14:22,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:22,307 INFO L475 AbstractCegarLoop]: Abstraction has 193060 states and 284481 transitions. [2019-09-08 08:14:22,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:14:22,307 INFO L276 IsEmpty]: Start isEmpty. Operand 193060 states and 284481 transitions. [2019-09-08 08:14:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 08:14:22,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:22,311 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] [2019-09-08 08:14:22,311 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:22,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:22,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1016547523, now seen corresponding path program 1 times [2019-09-08 08:14:22,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:22,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:22,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:22,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:22,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:22,428 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:14:22,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:22,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:14:22,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:14:22,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:14:22,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:14:22,430 INFO L87 Difference]: Start difference. First operand 193060 states and 284481 transitions. Second operand 5 states. [2019-09-08 08:14:34,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:34,838 INFO L93 Difference]: Finished difference Result 571172 states and 852443 transitions. [2019-09-08 08:14:34,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:14:34,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 08:14:34,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:35,910 INFO L225 Difference]: With dead ends: 571172 [2019-09-08 08:14:35,911 INFO L226 Difference]: Without dead ends: 378150 [2019-09-08 08:14:36,180 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:14:36,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378150 states. [2019-09-08 08:14:54,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378150 to 378148. [2019-09-08 08:14:54,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378148 states. [2019-09-08 08:14:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378148 states to 378148 states and 548493 transitions. [2019-09-08 08:14:55,728 INFO L78 Accepts]: Start accepts. Automaton has 378148 states and 548493 transitions. Word has length 98 [2019-09-08 08:14:55,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:55,729 INFO L475 AbstractCegarLoop]: Abstraction has 378148 states and 548493 transitions. [2019-09-08 08:14:55,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:14:55,729 INFO L276 IsEmpty]: Start isEmpty. Operand 378148 states and 548493 transitions. [2019-09-08 08:14:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 08:14:55,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:55,737 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] [2019-09-08 08:14:55,737 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:55,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:55,738 INFO L82 PathProgramCache]: Analyzing trace with hash 411512272, now seen corresponding path program 1 times [2019-09-08 08:14:55,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:55,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:55,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:55,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:55,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:55,894 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:14:55,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:55,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:14:55,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:14:55,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:14:55,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:14:55,896 INFO L87 Difference]: Start difference. First operand 378148 states and 548493 transitions. Second operand 11 states. [2019-09-08 08:15:21,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:15:21,155 INFO L93 Difference]: Finished difference Result 1094806 states and 1609064 transitions. [2019-09-08 08:15:21,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 08:15:21,156 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-09-08 08:15:21,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:15:25,233 INFO L225 Difference]: With dead ends: 1094806 [2019-09-08 08:15:25,233 INFO L226 Difference]: Without dead ends: 772667 [2019-09-08 08:15:25,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-08 08:15:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772667 states. [2019-09-08 08:16:08,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772667 to 652749. [2019-09-08 08:16:08,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652749 states. [2019-09-08 08:16:10,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652749 states to 652749 states and 951015 transitions. [2019-09-08 08:16:10,188 INFO L78 Accepts]: Start accepts. Automaton has 652749 states and 951015 transitions. Word has length 99 [2019-09-08 08:16:10,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:16:10,188 INFO L475 AbstractCegarLoop]: Abstraction has 652749 states and 951015 transitions. [2019-09-08 08:16:10,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:16:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand 652749 states and 951015 transitions. [2019-09-08 08:16:10,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 08:16:10,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:16:10,198 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] [2019-09-08 08:16:10,199 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:16:10,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:16:10,199 INFO L82 PathProgramCache]: Analyzing trace with hash -617847026, now seen corresponding path program 1 times [2019-09-08 08:16:10,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:16:10,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:16:10,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:16:10,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:16:10,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:16:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:16:10,308 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:16:10,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:16:10,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:16:10,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:16:10,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:16:10,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:16:10,310 INFO L87 Difference]: Start difference. First operand 652749 states and 951015 transitions. Second operand 5 states. [2019-09-08 08:17:02,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:17:02,257 INFO L93 Difference]: Finished difference Result 1743273 states and 2578000 transitions. [2019-09-08 08:17:02,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:17:02,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 08:17:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:17:18,479 INFO L225 Difference]: With dead ends: 1743273 [2019-09-08 08:17:18,479 INFO L226 Difference]: Without dead ends: 1090601 [2019-09-08 08:17:19,939 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:17:20,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090601 states. [2019-09-08 08:18:27,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090601 to 1089639. [2019-09-08 08:18:27,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089639 states. [2019-09-08 08:18:31,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089639 states to 1089639 states and 1561370 transitions. [2019-09-08 08:18:31,436 INFO L78 Accepts]: Start accepts. Automaton has 1089639 states and 1561370 transitions. Word has length 99 [2019-09-08 08:18:31,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:18:31,436 INFO L475 AbstractCegarLoop]: Abstraction has 1089639 states and 1561370 transitions. [2019-09-08 08:18:31,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:18:31,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1089639 states and 1561370 transitions. [2019-09-08 08:18:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 08:18:31,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:18:31,452 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] [2019-09-08 08:18:31,453 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:18:31,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:18:31,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1640107265, now seen corresponding path program 1 times [2019-09-08 08:18:31,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:18:31,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:18:31,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:31,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:18:31,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:18:31,591 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:18:31,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:18:31,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:18:31,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:18:31,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:18:31,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:18:31,593 INFO L87 Difference]: Start difference. First operand 1089639 states and 1561370 transitions. Second operand 11 states.