java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:57:05,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:57:05,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:57:06,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:57:06,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:57:06,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:57:06,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:57:06,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:57:06,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:57:06,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:57:06,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:57:06,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:57:06,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:57:06,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:57:06,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:57:06,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:57:06,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:57:06,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:57:06,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:57:06,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:57:06,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:57:06,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:57:06,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:57:06,022 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:57:06,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:57:06,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:57:06,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:57:06,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:57:06,026 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:57:06,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:57:06,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:57:06,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:57:06,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:57:06,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:57:06,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:57:06,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:57:06,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:57:06,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:57:06,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:57:06,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:57:06,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:57:06,035 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 09:57:06,049 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:57:06,050 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:57:06,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:57:06,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:57:06,051 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:57:06,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:57:06,052 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:57:06,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:57:06,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:57:06,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:57:06,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:57:06,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:57:06,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:57:06,053 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:57:06,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:57:06,054 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:57:06,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:57:06,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:57:06,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:57:06,054 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:57:06,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:57:06,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:57:06,055 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:57:06,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:57:06,056 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:57:06,056 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:57:06,056 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:57:06,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:57:06,056 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:57:06,085 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:57:06,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:57:06,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:57:06,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:57:06,103 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:57:06,104 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:57:06,165 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54845e948/4f9526f73fb94fba8bb25543e9942e9e/FLAG0df560b78 [2019-09-08 09:57:06,669 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:57:06,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:57:06,688 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54845e948/4f9526f73fb94fba8bb25543e9942e9e/FLAG0df560b78 [2019-09-08 09:57:06,997 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54845e948/4f9526f73fb94fba8bb25543e9942e9e [2019-09-08 09:57:07,007 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:57:07,009 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:57:07,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:57:07,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:57:07,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:57:07,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:57:06" (1/1) ... [2019-09-08 09:57:07,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b28937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:57:07, skipping insertion in model container [2019-09-08 09:57:07,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:57:06" (1/1) ... [2019-09-08 09:57:07,025 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:57:07,081 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:57:07,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:57:07,678 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:57:07,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:57:07,879 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:57:07,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:57:07 WrapperNode [2019-09-08 09:57:07,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:57:07,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:57:07,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:57:07,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:57:07,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:57:07" (1/1) ... [2019-09-08 09:57:07,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:57:07" (1/1) ... [2019-09-08 09:57:07,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:57:07" (1/1) ... [2019-09-08 09:57:07,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:57:07" (1/1) ... [2019-09-08 09:57:07,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:57:07" (1/1) ... [2019-09-08 09:57:07,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:57:07" (1/1) ... [2019-09-08 09:57:08,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:57:07" (1/1) ... [2019-09-08 09:57:08,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:57:08,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:57:08,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:57:08,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:57:08,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:57:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:57:08,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:57:08,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:57:08,091 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:57:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:57:08,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:57:08,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 09:57:08,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:57:08,092 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:57:08,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:57:08,093 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:57:08,093 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:57:08,093 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:57:08,093 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:57:08,094 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:57:08,094 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:57:08,094 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:57:08,094 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:57:08,094 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:57:08,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:57:08,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:57:09,750 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:57:09,751 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:57:09,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:57:09 BoogieIcfgContainer [2019-09-08 09:57:09,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:57:09,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:57:09,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:57:09,756 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:57:09,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:57:06" (1/3) ... [2019-09-08 09:57:09,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c437ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:57:09, skipping insertion in model container [2019-09-08 09:57:09,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:57:07" (2/3) ... [2019-09-08 09:57:09,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c437ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:57:09, skipping insertion in model container [2019-09-08 09:57:09,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:57:09" (3/3) ... [2019-09-08 09:57:09,764 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:57:09,773 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:57:09,782 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:57:09,799 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:57:09,833 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:57:09,833 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:57:09,834 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:57:09,834 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:57:09,836 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:57:09,836 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:57:09,837 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:57:09,837 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:57:09,837 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:57:09,872 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states. [2019-09-08 09:57:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 09:57:09,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:09,889 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:09,891 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:09,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:09,896 INFO L82 PathProgramCache]: Analyzing trace with hash 175889663, now seen corresponding path program 1 times [2019-09-08 09:57:09,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:09,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:09,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:09,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:09,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:10,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:10,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:57:10,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:57:10,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:57:10,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:10,616 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 3 states. [2019-09-08 09:57:10,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:10,804 INFO L93 Difference]: Finished difference Result 596 states and 1028 transitions. [2019-09-08 09:57:10,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:57:10,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-08 09:57:10,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:10,832 INFO L225 Difference]: With dead ends: 596 [2019-09-08 09:57:10,833 INFO L226 Difference]: Without dead ends: 450 [2019-09-08 09:57:10,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:10,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-08 09:57:10,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 447. [2019-09-08 09:57:10,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-08 09:57:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 738 transitions. [2019-09-08 09:57:10,922 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 738 transitions. Word has length 114 [2019-09-08 09:57:10,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:10,923 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 738 transitions. [2019-09-08 09:57:10,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:57:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 738 transitions. [2019-09-08 09:57:10,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 09:57:10,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:10,930 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:10,930 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:10,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:10,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1851484959, now seen corresponding path program 1 times [2019-09-08 09:57:10,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:10,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:10,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:10,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:10,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:11,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:11,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:57:11,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:57:11,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:57:11,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:11,172 INFO L87 Difference]: Start difference. First operand 447 states and 738 transitions. Second operand 3 states. [2019-09-08 09:57:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:11,249 INFO L93 Difference]: Finished difference Result 937 states and 1554 transitions. [2019-09-08 09:57:11,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:57:11,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-08 09:57:11,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:11,256 INFO L225 Difference]: With dead ends: 937 [2019-09-08 09:57:11,256 INFO L226 Difference]: Without dead ends: 683 [2019-09-08 09:57:11,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:11,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-08 09:57:11,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 679. [2019-09-08 09:57:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-09-08 09:57:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1122 transitions. [2019-09-08 09:57:11,307 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1122 transitions. Word has length 117 [2019-09-08 09:57:11,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:11,308 INFO L475 AbstractCegarLoop]: Abstraction has 679 states and 1122 transitions. [2019-09-08 09:57:11,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:57:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1122 transitions. [2019-09-08 09:57:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 09:57:11,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:11,320 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:11,320 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:11,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:11,320 INFO L82 PathProgramCache]: Analyzing trace with hash 278942115, now seen corresponding path program 1 times [2019-09-08 09:57:11,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:11,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:11,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:11,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:11,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:11,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:11,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:57:11,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:57:11,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:57:11,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:11,509 INFO L87 Difference]: Start difference. First operand 679 states and 1122 transitions. Second operand 3 states. [2019-09-08 09:57:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:11,589 INFO L93 Difference]: Finished difference Result 1615 states and 2672 transitions. [2019-09-08 09:57:11,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:57:11,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-08 09:57:11,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:11,598 INFO L225 Difference]: With dead ends: 1615 [2019-09-08 09:57:11,598 INFO L226 Difference]: Without dead ends: 1129 [2019-09-08 09:57:11,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:11,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-08 09:57:11,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1123. [2019-09-08 09:57:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-09-08 09:57:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1850 transitions. [2019-09-08 09:57:11,662 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1850 transitions. Word has length 120 [2019-09-08 09:57:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:11,663 INFO L475 AbstractCegarLoop]: Abstraction has 1123 states and 1850 transitions. [2019-09-08 09:57:11,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:57:11,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1850 transitions. [2019-09-08 09:57:11,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 09:57:11,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:11,667 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:11,667 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:11,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:11,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1985226691, now seen corresponding path program 1 times [2019-09-08 09:57:11,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:11,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:11,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:11,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:11,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:11,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:11,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:57:11,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:57:11,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:57:11,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:11,848 INFO L87 Difference]: Start difference. First operand 1123 states and 1850 transitions. Second operand 3 states. [2019-09-08 09:57:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:11,966 INFO L93 Difference]: Finished difference Result 2911 states and 4788 transitions. [2019-09-08 09:57:11,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:57:11,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-08 09:57:11,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:11,979 INFO L225 Difference]: With dead ends: 2911 [2019-09-08 09:57:11,979 INFO L226 Difference]: Without dead ends: 1981 [2019-09-08 09:57:11,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-09-08 09:57:12,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1971. [2019-09-08 09:57:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-09-08 09:57:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 3226 transitions. [2019-09-08 09:57:12,081 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 3226 transitions. Word has length 123 [2019-09-08 09:57:12,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:12,082 INFO L475 AbstractCegarLoop]: Abstraction has 1971 states and 3226 transitions. [2019-09-08 09:57:12,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:57:12,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 3226 transitions. [2019-09-08 09:57:12,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 09:57:12,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:12,086 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:12,086 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:12,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:12,086 INFO L82 PathProgramCache]: Analyzing trace with hash 664168007, now seen corresponding path program 1 times [2019-09-08 09:57:12,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:12,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:12,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:12,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:12,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:12,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:12,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:57:12,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:57:12,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:57:12,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:57:12,326 INFO L87 Difference]: Start difference. First operand 1971 states and 3226 transitions. Second operand 6 states. [2019-09-08 09:57:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:13,217 INFO L93 Difference]: Finished difference Result 10227 states and 16902 transitions. [2019-09-08 09:57:13,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 09:57:13,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-08 09:57:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:13,265 INFO L225 Difference]: With dead ends: 10227 [2019-09-08 09:57:13,265 INFO L226 Difference]: Without dead ends: 8449 [2019-09-08 09:57:13,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-08 09:57:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8449 states. [2019-09-08 09:57:13,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8449 to 3629. [2019-09-08 09:57:13,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3629 states. [2019-09-08 09:57:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 5941 transitions. [2019-09-08 09:57:13,637 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 5941 transitions. Word has length 126 [2019-09-08 09:57:13,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:13,638 INFO L475 AbstractCegarLoop]: Abstraction has 3629 states and 5941 transitions. [2019-09-08 09:57:13,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:57:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 5941 transitions. [2019-09-08 09:57:13,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 09:57:13,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:13,643 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:13,643 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:13,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:13,643 INFO L82 PathProgramCache]: Analyzing trace with hash -951796549, now seen corresponding path program 1 times [2019-09-08 09:57:13,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:13,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:13,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:13,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:13,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:13,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:13,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:13,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:57:13,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:57:13,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:57:13,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:57:13,886 INFO L87 Difference]: Start difference. First operand 3629 states and 5941 transitions. Second operand 4 states. [2019-09-08 09:57:14,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:14,487 INFO L93 Difference]: Finished difference Result 10711 states and 17645 transitions. [2019-09-08 09:57:14,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:57:14,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-08 09:57:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:14,529 INFO L225 Difference]: With dead ends: 10711 [2019-09-08 09:57:14,530 INFO L226 Difference]: Without dead ends: 7275 [2019-09-08 09:57:14,541 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 09:57:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7275 states. [2019-09-08 09:57:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7275 to 5384. [2019-09-08 09:57:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5384 states. [2019-09-08 09:57:14,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 8835 transitions. [2019-09-08 09:57:14,885 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 8835 transitions. Word has length 127 [2019-09-08 09:57:14,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:14,886 INFO L475 AbstractCegarLoop]: Abstraction has 5384 states and 8835 transitions. [2019-09-08 09:57:14,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:57:14,887 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 8835 transitions. [2019-09-08 09:57:14,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 09:57:14,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:14,893 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:14,893 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:14,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:14,893 INFO L82 PathProgramCache]: Analyzing trace with hash 497467790, now seen corresponding path program 1 times [2019-09-08 09:57:14,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:14,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:14,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:14,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:14,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:15,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:15,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:57:15,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:57:15,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:57:15,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:57:15,027 INFO L87 Difference]: Start difference. First operand 5384 states and 8835 transitions. Second operand 4 states. [2019-09-08 09:57:15,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:15,859 INFO L93 Difference]: Finished difference Result 15781 states and 25985 transitions. [2019-09-08 09:57:15,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:57:15,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-08 09:57:15,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:15,926 INFO L225 Difference]: With dead ends: 15781 [2019-09-08 09:57:15,927 INFO L226 Difference]: Without dead ends: 10590 [2019-09-08 09:57:15,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:57:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10590 states. [2019-09-08 09:57:16,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10590 to 7963. [2019-09-08 09:57:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7963 states. [2019-09-08 09:57:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7963 states to 7963 states and 13060 transitions. [2019-09-08 09:57:16,581 INFO L78 Accepts]: Start accepts. Automaton has 7963 states and 13060 transitions. Word has length 128 [2019-09-08 09:57:16,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:16,582 INFO L475 AbstractCegarLoop]: Abstraction has 7963 states and 13060 transitions. [2019-09-08 09:57:16,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:57:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand 7963 states and 13060 transitions. [2019-09-08 09:57:16,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 09:57:16,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:16,589 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:16,589 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:16,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:16,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1437707567, now seen corresponding path program 1 times [2019-09-08 09:57:16,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:16,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:16,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:16,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:16,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:16,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:16,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:16,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:57:16,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:57:16,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:57:16,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:16,697 INFO L87 Difference]: Start difference. First operand 7963 states and 13060 transitions. Second operand 3 states. [2019-09-08 09:57:17,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:17,394 INFO L93 Difference]: Finished difference Result 17514 states and 28795 transitions. [2019-09-08 09:57:17,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:57:17,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-08 09:57:17,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:17,428 INFO L225 Difference]: With dead ends: 17514 [2019-09-08 09:57:17,429 INFO L226 Difference]: Without dead ends: 12121 [2019-09-08 09:57:17,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:17,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12121 states. [2019-09-08 09:57:18,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12121 to 12119. [2019-09-08 09:57:18,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12119 states. [2019-09-08 09:57:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12119 states to 12119 states and 19844 transitions. [2019-09-08 09:57:18,394 INFO L78 Accepts]: Start accepts. Automaton has 12119 states and 19844 transitions. Word has length 129 [2019-09-08 09:57:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:18,395 INFO L475 AbstractCegarLoop]: Abstraction has 12119 states and 19844 transitions. [2019-09-08 09:57:18,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:57:18,395 INFO L276 IsEmpty]: Start isEmpty. Operand 12119 states and 19844 transitions. [2019-09-08 09:57:18,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 09:57:18,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:18,399 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:18,400 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:18,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:18,400 INFO L82 PathProgramCache]: Analyzing trace with hash -686882823, now seen corresponding path program 1 times [2019-09-08 09:57:18,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:18,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:18,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:18,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:18,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:18,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:18,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:18,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:57:18,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:57:18,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:57:18,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:18,513 INFO L87 Difference]: Start difference. First operand 12119 states and 19844 transitions. Second operand 3 states. [2019-09-08 09:57:19,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:19,723 INFO L93 Difference]: Finished difference Result 23551 states and 38678 transitions. [2019-09-08 09:57:19,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:57:19,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-08 09:57:19,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:19,770 INFO L225 Difference]: With dead ends: 23551 [2019-09-08 09:57:19,770 INFO L226 Difference]: Without dead ends: 17029 [2019-09-08 09:57:19,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:19,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17029 states. [2019-09-08 09:57:21,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17029 to 17027. [2019-09-08 09:57:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17027 states. [2019-09-08 09:57:21,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17027 states to 17027 states and 27840 transitions. [2019-09-08 09:57:21,378 INFO L78 Accepts]: Start accepts. Automaton has 17027 states and 27840 transitions. Word has length 129 [2019-09-08 09:57:21,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:21,379 INFO L475 AbstractCegarLoop]: Abstraction has 17027 states and 27840 transitions. [2019-09-08 09:57:21,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:57:21,379 INFO L276 IsEmpty]: Start isEmpty. Operand 17027 states and 27840 transitions. [2019-09-08 09:57:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 09:57:21,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:21,382 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:21,382 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:21,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:21,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1815419934, now seen corresponding path program 1 times [2019-09-08 09:57:21,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:21,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:21,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:21,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:21,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:21,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:21,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:57:21,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:57:21,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:57:21,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:57:21,491 INFO L87 Difference]: Start difference. First operand 17027 states and 27840 transitions. Second operand 4 states. [2019-09-08 09:57:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:23,282 INFO L93 Difference]: Finished difference Result 54386 states and 89180 transitions. [2019-09-08 09:57:23,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:57:23,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-08 09:57:23,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:23,423 INFO L225 Difference]: With dead ends: 54386 [2019-09-08 09:57:23,423 INFO L226 Difference]: Without dead ends: 37659 [2019-09-08 09:57:23,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:57:23,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37659 states. [2019-09-08 09:57:25,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37659 to 27287. [2019-09-08 09:57:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27287 states. [2019-09-08 09:57:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27287 states to 27287 states and 44556 transitions. [2019-09-08 09:57:25,413 INFO L78 Accepts]: Start accepts. Automaton has 27287 states and 44556 transitions. Word has length 129 [2019-09-08 09:57:25,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:25,414 INFO L475 AbstractCegarLoop]: Abstraction has 27287 states and 44556 transitions. [2019-09-08 09:57:25,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:57:25,414 INFO L276 IsEmpty]: Start isEmpty. Operand 27287 states and 44556 transitions. [2019-09-08 09:57:25,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 09:57:25,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:25,417 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:25,417 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:25,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:25,417 INFO L82 PathProgramCache]: Analyzing trace with hash -332561375, now seen corresponding path program 1 times [2019-09-08 09:57:25,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:25,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:25,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:25,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:25,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:25,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:25,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:25,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:57:25,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:57:25,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:57:25,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:25,519 INFO L87 Difference]: Start difference. First operand 27287 states and 44556 transitions. Second operand 3 states. [2019-09-08 09:57:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:27,206 INFO L93 Difference]: Finished difference Result 53227 states and 87204 transitions. [2019-09-08 09:57:27,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:57:27,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-08 09:57:27,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:27,314 INFO L225 Difference]: With dead ends: 53227 [2019-09-08 09:57:27,315 INFO L226 Difference]: Without dead ends: 38191 [2019-09-08 09:57:28,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:28,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38191 states. [2019-09-08 09:57:29,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38191 to 38189. [2019-09-08 09:57:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38189 states. [2019-09-08 09:57:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38189 states to 38189 states and 62254 transitions. [2019-09-08 09:57:29,953 INFO L78 Accepts]: Start accepts. Automaton has 38189 states and 62254 transitions. Word has length 129 [2019-09-08 09:57:29,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:29,954 INFO L475 AbstractCegarLoop]: Abstraction has 38189 states and 62254 transitions. [2019-09-08 09:57:29,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:57:29,954 INFO L276 IsEmpty]: Start isEmpty. Operand 38189 states and 62254 transitions. [2019-09-08 09:57:29,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 09:57:29,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:29,956 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:29,957 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:29,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:29,957 INFO L82 PathProgramCache]: Analyzing trace with hash -390628183, now seen corresponding path program 1 times [2019-09-08 09:57:29,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:29,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:29,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:29,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:29,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:30,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:30,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:30,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:57:30,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:57:30,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:57:30,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:30,055 INFO L87 Difference]: Start difference. First operand 38189 states and 62254 transitions. Second operand 3 states. [2019-09-08 09:57:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:32,172 INFO L93 Difference]: Finished difference Result 83696 states and 137543 transitions. [2019-09-08 09:57:32,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:57:32,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-08 09:57:32,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:32,318 INFO L225 Difference]: With dead ends: 83696 [2019-09-08 09:57:32,318 INFO L226 Difference]: Without dead ends: 56815 [2019-09-08 09:57:32,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:32,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56815 states. [2019-09-08 09:57:35,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56815 to 56813. [2019-09-08 09:57:35,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56813 states. [2019-09-08 09:57:35,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56813 states to 56813 states and 92722 transitions. [2019-09-08 09:57:35,936 INFO L78 Accepts]: Start accepts. Automaton has 56813 states and 92722 transitions. Word has length 129 [2019-09-08 09:57:35,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:35,936 INFO L475 AbstractCegarLoop]: Abstraction has 56813 states and 92722 transitions. [2019-09-08 09:57:35,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:57:35,936 INFO L276 IsEmpty]: Start isEmpty. Operand 56813 states and 92722 transitions. [2019-09-08 09:57:35,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 09:57:35,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:35,938 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:35,938 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:35,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:35,938 INFO L82 PathProgramCache]: Analyzing trace with hash -495937323, now seen corresponding path program 1 times [2019-09-08 09:57:35,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:35,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:35,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:35,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:35,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:36,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:36,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:57:36,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:57:36,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:57:36,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:57:36,040 INFO L87 Difference]: Start difference. First operand 56813 states and 92722 transitions. Second operand 4 states. [2019-09-08 09:57:41,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:41,999 INFO L93 Difference]: Finished difference Result 182066 states and 297987 transitions. [2019-09-08 09:57:41,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:57:41,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-08 09:57:42,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:42,342 INFO L225 Difference]: With dead ends: 182066 [2019-09-08 09:57:42,342 INFO L226 Difference]: Without dead ends: 125501 [2019-09-08 09:57:42,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:57:42,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125501 states. [2019-09-08 09:57:46,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125501 to 90932. [2019-09-08 09:57:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90932 states. [2019-09-08 09:57:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90932 states to 90932 states and 148075 transitions. [2019-09-08 09:57:46,798 INFO L78 Accepts]: Start accepts. Automaton has 90932 states and 148075 transitions. Word has length 130 [2019-09-08 09:57:46,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:46,799 INFO L475 AbstractCegarLoop]: Abstraction has 90932 states and 148075 transitions. [2019-09-08 09:57:46,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:57:46,799 INFO L276 IsEmpty]: Start isEmpty. Operand 90932 states and 148075 transitions. [2019-09-08 09:57:46,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 09:57:46,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:46,800 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:46,801 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:46,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:46,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1344026747, now seen corresponding path program 1 times [2019-09-08 09:57:46,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:46,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:46,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:46,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:46,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:47,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:47,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:57:47,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:57:47,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:57:47,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:57:47,042 INFO L87 Difference]: Start difference. First operand 90932 states and 148075 transitions. Second operand 6 states. [2019-09-08 09:57:53,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:53,197 INFO L93 Difference]: Finished difference Result 181618 states and 295756 transitions. [2019-09-08 09:57:53,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:57:53,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-08 09:57:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:53,372 INFO L225 Difference]: With dead ends: 181618 [2019-09-08 09:57:53,372 INFO L226 Difference]: Without dead ends: 90934 [2019-09-08 09:57:53,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:57:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90934 states. [2019-09-08 09:57:57,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90934 to 90932. [2019-09-08 09:57:57,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90932 states. [2019-09-08 09:57:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90932 states to 90932 states and 147450 transitions. [2019-09-08 09:57:57,492 INFO L78 Accepts]: Start accepts. Automaton has 90932 states and 147450 transitions. Word has length 132 [2019-09-08 09:57:57,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:57,492 INFO L475 AbstractCegarLoop]: Abstraction has 90932 states and 147450 transitions. [2019-09-08 09:57:57,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:57:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 90932 states and 147450 transitions. [2019-09-08 09:57:57,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 09:57:57,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:57,494 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:57,494 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:57,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:57,495 INFO L82 PathProgramCache]: Analyzing trace with hash 29972819, now seen corresponding path program 1 times [2019-09-08 09:57:57,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:57,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:57,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:57,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:57,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:57,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:57,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:57:57,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:57:57,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:57:57,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:57:57,784 INFO L87 Difference]: Start difference. First operand 90932 states and 147450 transitions. Second operand 6 states. [2019-09-08 09:58:08,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:58:08,197 INFO L93 Difference]: Finished difference Result 296146 states and 481653 transitions. [2019-09-08 09:58:08,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:58:08,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-09-08 09:58:08,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:58:08,549 INFO L225 Difference]: With dead ends: 296146 [2019-09-08 09:58:08,550 INFO L226 Difference]: Without dead ends: 205462 [2019-09-08 09:58:08,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:58:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205462 states. [2019-09-08 09:58:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205462 to 205458. [2019-09-08 09:58:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205458 states. [2019-09-08 09:58:22,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205458 states to 205458 states and 332579 transitions. [2019-09-08 09:58:22,151 INFO L78 Accepts]: Start accepts. Automaton has 205458 states and 332579 transitions. Word has length 135 [2019-09-08 09:58:22,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:58:22,152 INFO L475 AbstractCegarLoop]: Abstraction has 205458 states and 332579 transitions. [2019-09-08 09:58:22,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:58:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 205458 states and 332579 transitions. [2019-09-08 09:58:22,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 09:58:22,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:58:22,153 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:58:22,153 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:58:22,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:58:22,154 INFO L82 PathProgramCache]: Analyzing trace with hash 927248290, now seen corresponding path program 1 times [2019-09-08 09:58:22,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:58:22,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:58:22,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:58:22,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:58:22,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:58:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:58:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:58:22,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:58:22,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:58:22,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:58:22,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:58:22,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:58:22,291 INFO L87 Difference]: Start difference. First operand 205458 states and 332579 transitions. Second operand 5 states. [2019-09-08 09:58:42,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:58:42,872 INFO L93 Difference]: Finished difference Result 394480 states and 636518 transitions. [2019-09-08 09:58:42,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:58:42,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-09-08 09:58:42,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:58:43,596 INFO L225 Difference]: With dead ends: 394480 [2019-09-08 09:58:43,596 INFO L226 Difference]: Without dead ends: 394478 [2019-09-08 09:58:43,673 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 09:58:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394478 states. [2019-09-08 09:59:02,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394478 to 210114. [2019-09-08 09:59:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210114 states. [2019-09-08 09:59:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210114 states to 210114 states and 337208 transitions. [2019-09-08 09:59:02,790 INFO L78 Accepts]: Start accepts. Automaton has 210114 states and 337208 transitions. Word has length 136 [2019-09-08 09:59:02,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:02,790 INFO L475 AbstractCegarLoop]: Abstraction has 210114 states and 337208 transitions. [2019-09-08 09:59:02,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:59:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 210114 states and 337208 transitions. [2019-09-08 09:59:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 09:59:02,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:02,796 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:59:02,797 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:02,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:02,797 INFO L82 PathProgramCache]: Analyzing trace with hash 179427060, now seen corresponding path program 1 times [2019-09-08 09:59:02,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:02,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:02,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:02,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:02,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 09:59:02,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:02,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:59:02,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:59:02,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:59:02,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:59:02,995 INFO L87 Difference]: Start difference. First operand 210114 states and 337208 transitions. Second operand 6 states. [2019-09-08 09:59:27,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:27,593 INFO L93 Difference]: Finished difference Result 468069 states and 753119 transitions. [2019-09-08 09:59:27,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:59:27,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-08 09:59:27,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:28,267 INFO L225 Difference]: With dead ends: 468069 [2019-09-08 09:59:28,267 INFO L226 Difference]: Without dead ends: 373577 [2019-09-08 09:59:28,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:59:28,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373577 states. [2019-09-08 09:59:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373577 to 291115. [2019-09-08 09:59:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291115 states. [2019-09-08 09:59:58,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291115 states to 291115 states and 466642 transitions. [2019-09-08 09:59:58,390 INFO L78 Accepts]: Start accepts. Automaton has 291115 states and 466642 transitions. Word has length 167 [2019-09-08 09:59:58,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:58,390 INFO L475 AbstractCegarLoop]: Abstraction has 291115 states and 466642 transitions. [2019-09-08 09:59:58,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:59:58,390 INFO L276 IsEmpty]: Start isEmpty. Operand 291115 states and 466642 transitions. [2019-09-08 09:59:58,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 09:59:58,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:58,395 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:59:58,395 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:58,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:58,396 INFO L82 PathProgramCache]: Analyzing trace with hash 930251804, now seen corresponding path program 1 times [2019-09-08 09:59:58,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:58,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:58,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:58,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:58,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 09:59:58,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:58,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:59:58,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:59:58,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:59:58,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:59:58,587 INFO L87 Difference]: Start difference. First operand 291115 states and 466642 transitions. Second operand 6 states. [2019-09-08 10:00:26,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:00:26,387 INFO L93 Difference]: Finished difference Result 508165 states and 817743 transitions. [2019-09-08 10:00:26,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:00:26,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-08 10:00:26,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:00:27,094 INFO L225 Difference]: With dead ends: 508165 [2019-09-08 10:00:27,094 INFO L226 Difference]: Without dead ends: 413673 [2019-09-08 10:00:27,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:00:27,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413673 states. [2019-09-08 10:00:57,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413673 to 368773. [2019-09-08 10:00:57,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368773 states. [2019-09-08 10:00:58,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368773 states to 368773 states and 591198 transitions. [2019-09-08 10:00:58,724 INFO L78 Accepts]: Start accepts. Automaton has 368773 states and 591198 transitions. Word has length 167 [2019-09-08 10:00:58,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:00:58,724 INFO L475 AbstractCegarLoop]: Abstraction has 368773 states and 591198 transitions. [2019-09-08 10:00:58,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:00:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand 368773 states and 591198 transitions. [2019-09-08 10:00:58,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 10:00:58,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:00:58,731 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:00:58,731 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:00:58,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:00:58,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1284573252, now seen corresponding path program 1 times [2019-09-08 10:00:58,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:00:58,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:00:58,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:58,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:00:58,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:00:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 10:00:58,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:00:58,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:00:58,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:00:58,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:00:58,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:00:58,918 INFO L87 Difference]: Start difference. First operand 368773 states and 591198 transitions. Second operand 6 states. [2019-09-08 10:01:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:01:34,583 INFO L93 Difference]: Finished difference Result 533177 states and 857999 transitions. [2019-09-08 10:01:34,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:01:34,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-08 10:01:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:01:35,414 INFO L225 Difference]: With dead ends: 533177 [2019-09-08 10:01:35,415 INFO L226 Difference]: Without dead ends: 438685 [2019-09-08 10:01:35,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:01:35,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438685 states. [2019-09-08 10:02:09,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438685 to 414701. [2019-09-08 10:02:09,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414701 states. [2019-09-08 10:02:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414701 states to 414701 states and 665314 transitions. [2019-09-08 10:02:10,581 INFO L78 Accepts]: Start accepts. Automaton has 414701 states and 665314 transitions. Word has length 167 [2019-09-08 10:02:10,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:10,581 INFO L475 AbstractCegarLoop]: Abstraction has 414701 states and 665314 transitions. [2019-09-08 10:02:10,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:02:10,581 INFO L276 IsEmpty]: Start isEmpty. Operand 414701 states and 665314 transitions. [2019-09-08 10:02:10,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 10:02:10,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:10,586 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:10,586 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:10,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:10,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1226506444, now seen corresponding path program 1 times [2019-09-08 10:02:10,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:10,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:10,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:10,767 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 10:02:10,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:10,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:02:10,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:02:10,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:02:10,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:02:10,769 INFO L87 Difference]: Start difference. First operand 414701 states and 665314 transitions. Second operand 6 states. [2019-09-08 10:02:53,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:53,057 INFO L93 Difference]: Finished difference Result 675623 states and 1090211 transitions. [2019-09-08 10:02:53,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:02:53,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-08 10:02:53,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:54,063 INFO L225 Difference]: With dead ends: 675623 [2019-09-08 10:02:54,064 INFO L226 Difference]: Without dead ends: 564669 [2019-09-08 10:02:54,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:02:54,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564669 states. [2019-09-08 10:03:44,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564669 to 508157. [2019-09-08 10:03:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508157 states. [2019-09-08 10:03:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508157 states to 508157 states and 816726 transitions. [2019-09-08 10:03:45,778 INFO L78 Accepts]: Start accepts. Automaton has 508157 states and 816726 transitions. Word has length 167 [2019-09-08 10:03:45,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:45,779 INFO L475 AbstractCegarLoop]: Abstraction has 508157 states and 816726 transitions. [2019-09-08 10:03:45,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:03:45,779 INFO L276 IsEmpty]: Start isEmpty. Operand 508157 states and 816726 transitions. [2019-09-08 10:03:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 10:03:45,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:45,785 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:45,785 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:45,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:45,785 INFO L82 PathProgramCache]: Analyzing trace with hash 498916304, now seen corresponding path program 1 times [2019-09-08 10:03:45,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:45,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:45,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:45,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:45,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:45,905 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 10:03:45,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:45,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:45,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:45,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:45,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:45,907 INFO L87 Difference]: Start difference. First operand 508157 states and 816726 transitions. Second operand 3 states. [2019-09-08 10:04:50,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:50,848 INFO L93 Difference]: Finished difference Result 1009225 states and 1627774 transitions. [2019-09-08 10:04:50,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:04:50,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 10:04:50,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:52,622 INFO L225 Difference]: With dead ends: 1009225 [2019-09-08 10:04:52,622 INFO L226 Difference]: Without dead ends: 870701 [2019-09-08 10:04:52,925 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 10:04:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870701 states. [2019-09-08 10:06:25,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870701 to 869234. [2019-09-08 10:06:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869234 states. [2019-09-08 10:06:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869234 states to 869234 states and 1398676 transitions. [2019-09-08 10:06:27,198 INFO L78 Accepts]: Start accepts. Automaton has 869234 states and 1398676 transitions. Word has length 168 [2019-09-08 10:06:27,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:06:27,199 INFO L475 AbstractCegarLoop]: Abstraction has 869234 states and 1398676 transitions. [2019-09-08 10:06:27,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:06:27,199 INFO L276 IsEmpty]: Start isEmpty. Operand 869234 states and 1398676 transitions. [2019-09-08 10:06:27,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 10:06:27,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:06:27,208 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:06:27,209 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:06:27,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:06:27,209 INFO L82 PathProgramCache]: Analyzing trace with hash -699174186, now seen corresponding path program 1 times [2019-09-08 10:06:27,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:06:27,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:06:27,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:27,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:06:27,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:06:27,448 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:06:27,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:06:27,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:06:29,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:06:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:06:29,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 10:06:29,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:06:30,051 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 10:06:30,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 10:06:30,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-09-08 10:06:30,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:06:30,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:06:30,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:06:30,068 INFO L87 Difference]: Start difference. First operand 869234 states and 1398676 transitions. Second operand 12 states.