java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:25:35,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:25:35,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:25:35,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:25:35,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:25:35,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:25:35,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:25:35,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:25:35,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:25:35,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:25:35,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:25:35,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:25:35,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:25:35,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:25:35,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:25:35,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:25:35,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:25:35,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:25:35,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:25:35,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:25:35,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:25:35,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:25:35,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:25:35,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:25:35,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:25:35,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:25:35,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:25:35,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:25:35,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:25:35,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:25:35,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:25:35,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:25:35,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:25:35,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:25:35,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:25:35,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:25:35,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:25:35,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:25:35,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:25:35,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:25:35,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:25:35,745 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 11:25:35,774 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:25:35,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:25:35,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:25:35,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:25:35,782 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:25:35,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:25:35,782 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:25:35,782 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:25:35,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:25:35,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:25:35,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:25:35,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:25:35,783 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:25:35,784 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:25:35,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:25:35,784 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:25:35,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:25:35,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:25:35,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:25:35,786 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:25:35,786 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:25:35,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:25:35,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:25:35,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:25:35,787 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:25:35,787 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:25:35,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:25:35,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:25:35,788 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:25:35,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:25:35,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:25:35,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:25:35,861 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:25:35,861 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:25:35,862 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-08 11:25:35,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e47b2e6/81523c22de85496d9d55ccc29fd982c5/FLAGfa11bf2fe [2019-09-08 11:25:36,495 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:25:36,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-08 11:25:36,510 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e47b2e6/81523c22de85496d9d55ccc29fd982c5/FLAGfa11bf2fe [2019-09-08 11:25:36,858 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e47b2e6/81523c22de85496d9d55ccc29fd982c5 [2019-09-08 11:25:36,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:25:36,871 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:25:36,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:25:36,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:25:36,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:25:36,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:25:36" (1/1) ... [2019-09-08 11:25:36,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e6b5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:36, skipping insertion in model container [2019-09-08 11:25:36,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:25:36" (1/1) ... [2019-09-08 11:25:36,887 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:25:36,944 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:25:37,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:25:37,455 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:25:37,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:25:37,613 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:25:37,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:37 WrapperNode [2019-09-08 11:25:37,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:25:37,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:25:37,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:25:37,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:25:37,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:37" (1/1) ... [2019-09-08 11:25:37,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:37" (1/1) ... [2019-09-08 11:25:37,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:37" (1/1) ... [2019-09-08 11:25:37,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:37" (1/1) ... [2019-09-08 11:25:37,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:37" (1/1) ... [2019-09-08 11:25:37,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:37" (1/1) ... [2019-09-08 11:25:37,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:37" (1/1) ... [2019-09-08 11:25:37,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:25:37,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:25:37,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:25:37,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:25:37,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:37" (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 11:25:37,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:25:37,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:25:37,771 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:25:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:25:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:25:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:25:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:25:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:25:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:25:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:25:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:25:37,775 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:25:37,775 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:25:37,776 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:25:37,777 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:25:37,777 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 11:25:37,780 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:25:37,780 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:25:37,780 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:25:37,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:25:37,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:25:39,059 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:25:39,060 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:25:39,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:25:39 BoogieIcfgContainer [2019-09-08 11:25:39,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:25:39,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:25:39,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:25:39,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:25:39,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:25:36" (1/3) ... [2019-09-08 11:25:39,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1411f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:25:39, skipping insertion in model container [2019-09-08 11:25:39,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:37" (2/3) ... [2019-09-08 11:25:39,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1411f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:25:39, skipping insertion in model container [2019-09-08 11:25:39,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:25:39" (3/3) ... [2019-09-08 11:25:39,070 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-08 11:25:39,081 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:25:39,093 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:25:39,113 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:25:39,169 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:25:39,170 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:25:39,170 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:25:39,172 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:25:39,172 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:25:39,172 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:25:39,172 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:25:39,172 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:25:39,172 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:25:39,197 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states. [2019-09-08 11:25:39,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 11:25:39,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:39,211 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] [2019-09-08 11:25:39,213 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:39,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:39,219 INFO L82 PathProgramCache]: Analyzing trace with hash -515366270, now seen corresponding path program 1 times [2019-09-08 11:25:39,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:39,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:39,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:39,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:39,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:39,746 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 11:25:39,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:39,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:25:39,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:25:39,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:25:39,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:39,774 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 3 states. [2019-09-08 11:25:39,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:39,978 INFO L93 Difference]: Finished difference Result 529 states and 871 transitions. [2019-09-08 11:25:39,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:25:39,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-08 11:25:39,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:39,999 INFO L225 Difference]: With dead ends: 529 [2019-09-08 11:25:39,999 INFO L226 Difference]: Without dead ends: 400 [2019-09-08 11:25:40,004 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 11:25:40,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-09-08 11:25:40,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 398. [2019-09-08 11:25:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-09-08 11:25:40,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 594 transitions. [2019-09-08 11:25:40,159 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 594 transitions. Word has length 101 [2019-09-08 11:25:40,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:40,161 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 594 transitions. [2019-09-08 11:25:40,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:25:40,161 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 594 transitions. [2019-09-08 11:25:40,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:25:40,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:40,170 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:25:40,170 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:40,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:40,171 INFO L82 PathProgramCache]: Analyzing trace with hash 862673413, now seen corresponding path program 1 times [2019-09-08 11:25:40,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:40,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:40,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:40,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:40,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:40,722 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 11:25:40,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:40,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:25:40,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:25:40,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:25:40,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:25:40,726 INFO L87 Difference]: Start difference. First operand 398 states and 594 transitions. Second operand 8 states. [2019-09-08 11:25:41,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:41,339 INFO L93 Difference]: Finished difference Result 1963 states and 3040 transitions. [2019-09-08 11:25:41,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:25:41,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-09-08 11:25:41,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:41,355 INFO L225 Difference]: With dead ends: 1963 [2019-09-08 11:25:41,355 INFO L226 Difference]: Without dead ends: 1669 [2019-09-08 11:25:41,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:25:41,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2019-09-08 11:25:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1659. [2019-09-08 11:25:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1659 states. [2019-09-08 11:25:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2562 transitions. [2019-09-08 11:25:41,487 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2562 transitions. Word has length 102 [2019-09-08 11:25:41,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:41,487 INFO L475 AbstractCegarLoop]: Abstraction has 1659 states and 2562 transitions. [2019-09-08 11:25:41,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:25:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2562 transitions. [2019-09-08 11:25:41,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:25:41,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:41,498 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] [2019-09-08 11:25:41,498 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:41,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:41,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1435350370, now seen corresponding path program 1 times [2019-09-08 11:25:41,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:41,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:41,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:41,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:41,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:41,729 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 11:25:41,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:41,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:25:41,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:25:41,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:25:41,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:25:41,731 INFO L87 Difference]: Start difference. First operand 1659 states and 2562 transitions. Second operand 6 states. [2019-09-08 11:25:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:42,469 INFO L93 Difference]: Finished difference Result 5768 states and 9027 transitions. [2019-09-08 11:25:42,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:25:42,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-09-08 11:25:42,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:42,505 INFO L225 Difference]: With dead ends: 5768 [2019-09-08 11:25:42,513 INFO L226 Difference]: Without dead ends: 4181 [2019-09-08 11:25:42,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:25:42,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2019-09-08 11:25:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 4177. [2019-09-08 11:25:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4177 states. [2019-09-08 11:25:42,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4177 states to 4177 states and 6523 transitions. [2019-09-08 11:25:42,876 INFO L78 Accepts]: Start accepts. Automaton has 4177 states and 6523 transitions. Word has length 103 [2019-09-08 11:25:42,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:42,877 INFO L475 AbstractCegarLoop]: Abstraction has 4177 states and 6523 transitions. [2019-09-08 11:25:42,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:25:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 4177 states and 6523 transitions. [2019-09-08 11:25:42,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:25:42,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:42,885 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] [2019-09-08 11:25:42,885 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:42,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:42,886 INFO L82 PathProgramCache]: Analyzing trace with hash -49006449, now seen corresponding path program 1 times [2019-09-08 11:25:42,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:42,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:42,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:42,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:42,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:43,050 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 11:25:43,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:43,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:25:43,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:25:43,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:25:43,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:25:43,052 INFO L87 Difference]: Start difference. First operand 4177 states and 6523 transitions. Second operand 5 states. [2019-09-08 11:25:43,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:43,842 INFO L93 Difference]: Finished difference Result 11534 states and 18094 transitions. [2019-09-08 11:25:43,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:25:43,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 11:25:43,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:43,884 INFO L225 Difference]: With dead ends: 11534 [2019-09-08 11:25:43,884 INFO L226 Difference]: Without dead ends: 7519 [2019-09-08 11:25:43,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:25:43,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7519 states. [2019-09-08 11:25:44,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7519 to 7517. [2019-09-08 11:25:44,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7517 states. [2019-09-08 11:25:44,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7517 states to 7517 states and 11731 transitions. [2019-09-08 11:25:44,291 INFO L78 Accepts]: Start accepts. Automaton has 7517 states and 11731 transitions. Word has length 103 [2019-09-08 11:25:44,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:44,291 INFO L475 AbstractCegarLoop]: Abstraction has 7517 states and 11731 transitions. [2019-09-08 11:25:44,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:25:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 7517 states and 11731 transitions. [2019-09-08 11:25:44,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:25:44,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:44,298 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:25:44,299 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:44,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:44,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1556143714, now seen corresponding path program 1 times [2019-09-08 11:25:44,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:44,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:44,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:44,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:44,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:44,513 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 11:25:44,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:44,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:25:44,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:25:44,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:25:44,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:25:44,516 INFO L87 Difference]: Start difference. First operand 7517 states and 11731 transitions. Second operand 5 states. [2019-09-08 11:25:45,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:45,482 INFO L93 Difference]: Finished difference Result 21461 states and 33621 transitions. [2019-09-08 11:25:45,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:25:45,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 11:25:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:45,547 INFO L225 Difference]: With dead ends: 21461 [2019-09-08 11:25:45,548 INFO L226 Difference]: Without dead ends: 14147 [2019-09-08 11:25:45,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:25:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14147 states. [2019-09-08 11:25:46,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14147 to 14145. [2019-09-08 11:25:46,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14145 states. [2019-09-08 11:25:46,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14145 states to 14145 states and 22071 transitions. [2019-09-08 11:25:46,322 INFO L78 Accepts]: Start accepts. Automaton has 14145 states and 22071 transitions. Word has length 103 [2019-09-08 11:25:46,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:46,323 INFO L475 AbstractCegarLoop]: Abstraction has 14145 states and 22071 transitions. [2019-09-08 11:25:46,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:25:46,323 INFO L276 IsEmpty]: Start isEmpty. Operand 14145 states and 22071 transitions. [2019-09-08 11:25:46,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:25:46,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:46,329 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] [2019-09-08 11:25:46,329 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:46,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:46,330 INFO L82 PathProgramCache]: Analyzing trace with hash 202933120, now seen corresponding path program 1 times [2019-09-08 11:25:46,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:46,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:46,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:46,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:46,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:46,429 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 11:25:46,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:46,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:25:46,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:25:46,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:25:46,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:25:46,431 INFO L87 Difference]: Start difference. First operand 14145 states and 22071 transitions. Second operand 5 states. [2019-09-08 11:25:48,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:48,528 INFO L93 Difference]: Finished difference Result 41597 states and 65001 transitions. [2019-09-08 11:25:48,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:25:48,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 11:25:48,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:48,611 INFO L225 Difference]: With dead ends: 41597 [2019-09-08 11:25:48,611 INFO L226 Difference]: Without dead ends: 27577 [2019-09-08 11:25:48,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:25:48,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27577 states. [2019-09-08 11:25:49,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27577 to 27575. [2019-09-08 11:25:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27575 states. [2019-09-08 11:25:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27575 states to 27575 states and 42888 transitions. [2019-09-08 11:25:49,768 INFO L78 Accepts]: Start accepts. Automaton has 27575 states and 42888 transitions. Word has length 103 [2019-09-08 11:25:49,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:49,768 INFO L475 AbstractCegarLoop]: Abstraction has 27575 states and 42888 transitions. [2019-09-08 11:25:49,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:25:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 27575 states and 42888 transitions. [2019-09-08 11:25:49,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:25:49,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:49,777 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] [2019-09-08 11:25:49,778 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:49,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:49,778 INFO L82 PathProgramCache]: Analyzing trace with hash -76299663, now seen corresponding path program 1 times [2019-09-08 11:25:49,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:49,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:49,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:49,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:49,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:49,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 11:25:49,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:49,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:25:49,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:25:49,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:25:49,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:25:49,896 INFO L87 Difference]: Start difference. First operand 27575 states and 42888 transitions. Second operand 5 states. [2019-09-08 11:25:52,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:52,909 INFO L93 Difference]: Finished difference Result 82021 states and 127680 transitions. [2019-09-08 11:25:52,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:25:52,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 11:25:52,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:53,057 INFO L225 Difference]: With dead ends: 82021 [2019-09-08 11:25:53,058 INFO L226 Difference]: Without dead ends: 54541 [2019-09-08 11:25:53,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:25:53,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54541 states. [2019-09-08 11:25:55,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54541 to 54539. [2019-09-08 11:25:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54539 states. [2019-09-08 11:25:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54539 states to 54539 states and 84468 transitions. [2019-09-08 11:25:55,239 INFO L78 Accepts]: Start accepts. Automaton has 54539 states and 84468 transitions. Word has length 103 [2019-09-08 11:25:55,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:55,240 INFO L475 AbstractCegarLoop]: Abstraction has 54539 states and 84468 transitions. [2019-09-08 11:25:55,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:25:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 54539 states and 84468 transitions. [2019-09-08 11:25:55,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:25:55,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:55,253 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] [2019-09-08 11:25:55,253 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:55,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:55,254 INFO L82 PathProgramCache]: Analyzing trace with hash -737272749, now seen corresponding path program 1 times [2019-09-08 11:25:55,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:55,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:55,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:55,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:55,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:55,355 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 11:25:55,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:55,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:25:55,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:25:55,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:25:55,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:25:55,358 INFO L87 Difference]: Start difference. First operand 54539 states and 84468 transitions. Second operand 5 states. [2019-09-08 11:25:59,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:59,971 INFO L93 Difference]: Finished difference Result 155540 states and 241043 transitions. [2019-09-08 11:25:59,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:25:59,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 11:25:59,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:26:00,142 INFO L225 Difference]: With dead ends: 155540 [2019-09-08 11:26:00,142 INFO L226 Difference]: Without dead ends: 101057 [2019-09-08 11:26:00,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:26:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101057 states. [2019-09-08 11:26:05,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101057 to 101055. [2019-09-08 11:26:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101055 states. [2019-09-08 11:26:05,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101055 states to 101055 states and 155576 transitions. [2019-09-08 11:26:05,587 INFO L78 Accepts]: Start accepts. Automaton has 101055 states and 155576 transitions. Word has length 103 [2019-09-08 11:26:05,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:26:05,587 INFO L475 AbstractCegarLoop]: Abstraction has 101055 states and 155576 transitions. [2019-09-08 11:26:05,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:26:05,587 INFO L276 IsEmpty]: Start isEmpty. Operand 101055 states and 155576 transitions. [2019-09-08 11:26:05,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:26:05,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:26:05,606 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] [2019-09-08 11:26:05,606 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:26:05,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:26:05,606 INFO L82 PathProgramCache]: Analyzing trace with hash 303097242, now seen corresponding path program 1 times [2019-09-08 11:26:05,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:26:05,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:26:05,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:05,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:26:05,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:26:05,712 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 11:26:05,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:26:05,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:26:05,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:26:05,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:26:05,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:26:05,713 INFO L87 Difference]: Start difference. First operand 101055 states and 155576 transitions. Second operand 5 states. [2019-09-08 11:26:13,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:26:13,479 INFO L93 Difference]: Finished difference Result 191473 states and 293657 transitions. [2019-09-08 11:26:13,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:26:13,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-08 11:26:13,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:26:13,746 INFO L225 Difference]: With dead ends: 191473 [2019-09-08 11:26:13,746 INFO L226 Difference]: Without dead ends: 191471 [2019-09-08 11:26:13,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 11:26:13,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191471 states. [2019-09-08 11:26:20,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191471 to 102111. [2019-09-08 11:26:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102111 states. [2019-09-08 11:26:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102111 states to 102111 states and 156632 transitions. [2019-09-08 11:26:20,696 INFO L78 Accepts]: Start accepts. Automaton has 102111 states and 156632 transitions. Word has length 104 [2019-09-08 11:26:20,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:26:20,696 INFO L475 AbstractCegarLoop]: Abstraction has 102111 states and 156632 transitions. [2019-09-08 11:26:20,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:26:20,696 INFO L276 IsEmpty]: Start isEmpty. Operand 102111 states and 156632 transitions. [2019-09-08 11:26:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:26:20,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:26:20,717 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] [2019-09-08 11:26:20,717 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:26:20,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:26:20,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1148405721, now seen corresponding path program 1 times [2019-09-08 11:26:20,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:26:20,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:26:20,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:20,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:26:20,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:26:20,837 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 11:26:20,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:26:20,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:26:20,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:26:20,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:26:20,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:26:20,839 INFO L87 Difference]: Start difference. First operand 102111 states and 156632 transitions. Second operand 4 states. [2019-09-08 11:26:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:26:30,800 INFO L93 Difference]: Finished difference Result 292099 states and 446666 transitions. [2019-09-08 11:26:30,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 11:26:30,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-08 11:26:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:26:31,134 INFO L225 Difference]: With dead ends: 292099 [2019-09-08 11:26:31,134 INFO L226 Difference]: Without dead ends: 192417 [2019-09-08 11:26:31,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:26:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192417 states. [2019-09-08 11:26:43,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192417 to 192415. [2019-09-08 11:26:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192415 states. [2019-09-08 11:26:43,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192415 states to 192415 states and 293144 transitions. [2019-09-08 11:26:43,603 INFO L78 Accepts]: Start accepts. Automaton has 192415 states and 293144 transitions. Word has length 105 [2019-09-08 11:26:43,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:26:43,603 INFO L475 AbstractCegarLoop]: Abstraction has 192415 states and 293144 transitions. [2019-09-08 11:26:43,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:26:43,603 INFO L276 IsEmpty]: Start isEmpty. Operand 192415 states and 293144 transitions. [2019-09-08 11:26:43,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:26:43,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:26:43,620 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] [2019-09-08 11:26:43,620 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:26:43,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:26:43,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1796571939, now seen corresponding path program 1 times [2019-09-08 11:26:43,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:26:43,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:26:43,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:43,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:26:43,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:26:43,688 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 11:26:43,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:26:43,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:26:43,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:26:43,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:26:43,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:26:43,690 INFO L87 Difference]: Start difference. First operand 192415 states and 293144 transitions. Second operand 3 states. [2019-09-08 11:26:55,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:26:55,257 INFO L93 Difference]: Finished difference Result 401579 states and 611660 transitions. [2019-09-08 11:26:55,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:26:55,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 11:26:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:26:55,902 INFO L225 Difference]: With dead ends: 401579 [2019-09-08 11:26:55,902 INFO L226 Difference]: Without dead ends: 254097 [2019-09-08 11:26:56,089 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 11:26:56,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254097 states. [2019-09-08 11:27:12,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254097 to 252476. [2019-09-08 11:27:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252476 states. [2019-09-08 11:27:12,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252476 states to 252476 states and 380787 transitions. [2019-09-08 11:27:12,843 INFO L78 Accepts]: Start accepts. Automaton has 252476 states and 380787 transitions. Word has length 106 [2019-09-08 11:27:12,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:12,843 INFO L475 AbstractCegarLoop]: Abstraction has 252476 states and 380787 transitions. [2019-09-08 11:27:12,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:27:12,843 INFO L276 IsEmpty]: Start isEmpty. Operand 252476 states and 380787 transitions. [2019-09-08 11:27:12,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:27:12,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:12,860 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] [2019-09-08 11:27:12,860 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:12,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:12,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1528380005, now seen corresponding path program 1 times [2019-09-08 11:27:12,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:12,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:12,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:12,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:12,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:12,929 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 11:27:12,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:12,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:27:12,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:27:12,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:27:12,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:12,931 INFO L87 Difference]: Start difference. First operand 252476 states and 380787 transitions. Second operand 3 states. [2019-09-08 11:27:31,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:31,385 INFO L93 Difference]: Finished difference Result 464893 states and 700322 transitions. [2019-09-08 11:27:31,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:27:31,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 11:27:31,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:31,884 INFO L225 Difference]: With dead ends: 464893 [2019-09-08 11:27:31,885 INFO L226 Difference]: Without dead ends: 304247 [2019-09-08 11:27:32,052 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 11:27:32,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304247 states. [2019-09-08 11:27:52,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304247 to 302331. [2019-09-08 11:27:52,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302331 states. [2019-09-08 11:27:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302331 states to 302331 states and 450427 transitions. [2019-09-08 11:27:53,302 INFO L78 Accepts]: Start accepts. Automaton has 302331 states and 450427 transitions. Word has length 106 [2019-09-08 11:27:53,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:53,303 INFO L475 AbstractCegarLoop]: Abstraction has 302331 states and 450427 transitions. [2019-09-08 11:27:53,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:27:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 302331 states and 450427 transitions. [2019-09-08 11:27:53,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:27:53,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:53,327 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] [2019-09-08 11:27:53,327 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:53,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:53,327 INFO L82 PathProgramCache]: Analyzing trace with hash -449321198, now seen corresponding path program 1 times [2019-09-08 11:27:53,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:53,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:53,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:53,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:53,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:53,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:53,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:53,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:27:53,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:27:53,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:27:53,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:53,401 INFO L87 Difference]: Start difference. First operand 302331 states and 450427 transitions. Second operand 3 states. [2019-09-08 11:28:12,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:12,582 INFO L93 Difference]: Finished difference Result 416159 states and 618793 transitions. [2019-09-08 11:28:12,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:28:12,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 11:28:12,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:13,084 INFO L225 Difference]: With dead ends: 416159 [2019-09-08 11:28:13,084 INFO L226 Difference]: Without dead ends: 334581 [2019-09-08 11:28:13,201 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 11:28:13,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334581 states. [2019-09-08 11:28:37,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334581 to 297215. [2019-09-08 11:28:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297215 states. [2019-09-08 11:28:37,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297215 states to 297215 states and 437407 transitions. [2019-09-08 11:28:37,541 INFO L78 Accepts]: Start accepts. Automaton has 297215 states and 437407 transitions. Word has length 106 [2019-09-08 11:28:37,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:37,542 INFO L475 AbstractCegarLoop]: Abstraction has 297215 states and 437407 transitions. [2019-09-08 11:28:37,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:28:37,542 INFO L276 IsEmpty]: Start isEmpty. Operand 297215 states and 437407 transitions. [2019-09-08 11:28:37,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:28:37,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:37,561 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] [2019-09-08 11:28:37,561 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:37,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:37,561 INFO L82 PathProgramCache]: Analyzing trace with hash -237205661, now seen corresponding path program 1 times [2019-09-08 11:28:37,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:37,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:37,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:37,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:37,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:37,637 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 11:28:37,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:37,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:28:37,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:28:37,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:28:37,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:28:37,639 INFO L87 Difference]: Start difference. First operand 297215 states and 437407 transitions. Second operand 3 states. [2019-09-08 11:28:57,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:57,219 INFO L93 Difference]: Finished difference Result 471091 states and 692747 transitions. [2019-09-08 11:28:57,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:28:57,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 11:28:57,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:57,730 INFO L225 Difference]: With dead ends: 471091 [2019-09-08 11:28:57,730 INFO L226 Difference]: Without dead ends: 320281 [2019-09-08 11:28:57,889 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 11:28:58,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320281 states. [2019-09-08 11:29:23,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320281 to 317799. [2019-09-08 11:29:23,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317799 states. [2019-09-08 11:29:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317799 states to 317799 states and 460917 transitions. [2019-09-08 11:29:24,237 INFO L78 Accepts]: Start accepts. Automaton has 317799 states and 460917 transitions. Word has length 106 [2019-09-08 11:29:24,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:29:24,238 INFO L475 AbstractCegarLoop]: Abstraction has 317799 states and 460917 transitions. [2019-09-08 11:29:24,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:29:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 317799 states and 460917 transitions. [2019-09-08 11:29:24,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:29:24,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:29:24,260 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] [2019-09-08 11:29:24,260 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:29:24,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:29:24,260 INFO L82 PathProgramCache]: Analyzing trace with hash -121059675, now seen corresponding path program 1 times [2019-09-08 11:29:24,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:29:24,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:29:24,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:24,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:29:24,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:24,384 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 11:29:24,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:29:24,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:29:24,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:29:24,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:29:24,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:29:24,386 INFO L87 Difference]: Start difference. First operand 317799 states and 460917 transitions. Second operand 7 states. [2019-09-08 11:31:35,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:31:35,625 INFO L93 Difference]: Finished difference Result 2175995 states and 3120330 transitions. [2019-09-08 11:31:35,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:31:35,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-09-08 11:31:35,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:31:39,065 INFO L225 Difference]: With dead ends: 2175995 [2019-09-08 11:31:39,065 INFO L226 Difference]: Without dead ends: 1883355 [2019-09-08 11:31:40,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:31:41,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883355 states. [2019-09-08 11:32:29,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883355 to 318431. [2019-09-08 11:32:29,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318431 states. [2019-09-08 11:32:30,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318431 states to 318431 states and 461747 transitions. [2019-09-08 11:32:30,292 INFO L78 Accepts]: Start accepts. Automaton has 318431 states and 461747 transitions. Word has length 106 [2019-09-08 11:32:30,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:30,293 INFO L475 AbstractCegarLoop]: Abstraction has 318431 states and 461747 transitions. [2019-09-08 11:32:30,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:32:30,293 INFO L276 IsEmpty]: Start isEmpty. Operand 318431 states and 461747 transitions. [2019-09-08 11:32:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:32:30,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:30,316 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] [2019-09-08 11:32:30,316 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:30,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:30,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1920757475, now seen corresponding path program 1 times [2019-09-08 11:32:30,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:30,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:30,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:30,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:30,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:30,379 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 11:32:30,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:30,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:32:30,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:32:30,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:32:30,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:32:30,381 INFO L87 Difference]: Start difference. First operand 318431 states and 461747 transitions. Second operand 3 states. [2019-09-08 11:33:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:33:10,196 INFO L93 Difference]: Finished difference Result 744397 states and 1078105 transitions. [2019-09-08 11:33:10,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:33:10,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 11:33:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:33:10,955 INFO L225 Difference]: With dead ends: 744397 [2019-09-08 11:33:10,955 INFO L226 Difference]: Without dead ends: 443301 [2019-09-08 11:33:11,918 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 11:33:12,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443301 states. [2019-09-08 11:33:53,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443301 to 442369. [2019-09-08 11:33:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442369 states. [2019-09-08 11:33:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442369 states to 442369 states and 634225 transitions. [2019-09-08 11:33:54,492 INFO L78 Accepts]: Start accepts. Automaton has 442369 states and 634225 transitions. Word has length 106 [2019-09-08 11:33:54,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:33:54,492 INFO L475 AbstractCegarLoop]: Abstraction has 442369 states and 634225 transitions. [2019-09-08 11:33:54,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:33:54,492 INFO L276 IsEmpty]: Start isEmpty. Operand 442369 states and 634225 transitions. [2019-09-08 11:33:54,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:33:54,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:33:54,529 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] [2019-09-08 11:33:54,529 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:33:54,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:33:54,530 INFO L82 PathProgramCache]: Analyzing trace with hash -2046382973, now seen corresponding path program 1 times [2019-09-08 11:33:54,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:33:54,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:33:54,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:33:54,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:33:54,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:33:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:33:54,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 11:33:54,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:33:54,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:33:54,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:33:54,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:33:54,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:33:54,643 INFO L87 Difference]: Start difference. First operand 442369 states and 634225 transitions. Second operand 7 states.