/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 07:46:30,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 07:46:30,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 07:46:30,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 07:46:30,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 07:46:30,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 07:46:30,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 07:46:30,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 07:46:30,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 07:46:30,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 07:46:30,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 07:46:30,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 07:46:30,750 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 07:46:30,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 07:46:30,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 07:46:30,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 07:46:30,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 07:46:30,753 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 07:46:30,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 07:46:30,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 07:46:30,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 07:46:30,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 07:46:30,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 07:46:30,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 07:46:30,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 07:46:30,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 07:46:30,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 07:46:30,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 07:46:30,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 07:46:30,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 07:46:30,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 07:46:30,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 07:46:30,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 07:46:30,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 07:46:30,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 07:46:30,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 07:46:30,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 07:46:30,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 07:46:30,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 07:46:30,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 07:46:30,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 07:46:30,778 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2021-06-05 07:46:30,811 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 07:46:30,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 07:46:30,811 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 07:46:30,811 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 07:46:30,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 07:46:30,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 07:46:30,812 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 07:46:30,812 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 07:46:30,813 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 07:46:30,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 07:46:30,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 07:46:30,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 07:46:30,813 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 07:46:30,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 07:46:30,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 07:46:30,813 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 07:46:30,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 07:46:30,813 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 07:46:30,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 07:46:30,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 07:46:30,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 07:46:30,814 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 07:46:30,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 07:46:30,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 07:46:30,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 07:46:30,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 07:46:30,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 07:46:30,814 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 07:46:30,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 07:46:30,814 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 07:46:30,814 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 07:46:30,814 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 07:46:30,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 07:46:31,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 07:46:31,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 07:46:31,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 07:46:31,054 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 07:46:31,054 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 07:46:31,055 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i [2021-06-05 07:46:31,107 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7a795fd/5cf528193cac4dd18e3ef296f9ae566f/FLAG5874c7220 [2021-06-05 07:46:31,590 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 07:46:31,590 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i [2021-06-05 07:46:31,612 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7a795fd/5cf528193cac4dd18e3ef296f9ae566f/FLAG5874c7220 [2021-06-05 07:46:32,079 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7a795fd/5cf528193cac4dd18e3ef296f9ae566f [2021-06-05 07:46:32,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 07:46:32,082 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 07:46:32,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 07:46:32,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 07:46:32,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 07:46:32,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:46:32" (1/1) ... [2021-06-05 07:46:32,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ccee6be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:46:32, skipping insertion in model container [2021-06-05 07:46:32,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:46:32" (1/1) ... [2021-06-05 07:46:32,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 07:46:32,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 07:46:32,256 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-05 07:46:32,413 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i[55568,55581] [2021-06-05 07:46:32,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 07:46:32,445 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 07:46:32,458 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-05 07:46:32,477 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i[55568,55581] [2021-06-05 07:46:32,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 07:46:32,589 INFO L208 MainTranslator]: Completed translation [2021-06-05 07:46:32,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:46:32 WrapperNode [2021-06-05 07:46:32,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 07:46:32,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 07:46:32,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 07:46:32,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 07:46:32,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:46:32" (1/1) ... [2021-06-05 07:46:32,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:46:32" (1/1) ... [2021-06-05 07:46:32,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 07:46:32,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 07:46:32,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 07:46:32,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 07:46:32,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:46:32" (1/1) ... [2021-06-05 07:46:32,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:46:32" (1/1) ... [2021-06-05 07:46:32,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:46:32" (1/1) ... [2021-06-05 07:46:32,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:46:32" (1/1) ... [2021-06-05 07:46:32,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:46:32" (1/1) ... [2021-06-05 07:46:32,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:46:32" (1/1) ... [2021-06-05 07:46:32,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:46:32" (1/1) ... [2021-06-05 07:46:32,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 07:46:32,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 07:46:32,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 07:46:32,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 07:46:32,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:46:32" (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 [2021-06-05 07:46:32,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 07:46:32,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 07:46:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 07:46:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 07:46:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 07:46:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2021-06-05 07:46:32,714 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2021-06-05 07:46:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-05 07:46:32,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-05 07:46:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-05 07:46:32,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-05 07:46:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-05 07:46:32,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-05 07:46:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 07:46:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-06-05 07:46:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 07:46:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 07:46:32,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 07:46:32,717 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 07:46:33,104 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 07:46:33,104 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-06-05 07:46:33,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:46:33 BoogieIcfgContainer [2021-06-05 07:46:33,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 07:46:33,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 07:46:33,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 07:46:33,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 07:46:33,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 07:46:32" (1/3) ... [2021-06-05 07:46:33,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cde7229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:46:33, skipping insertion in model container [2021-06-05 07:46:33,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:46:32" (2/3) ... [2021-06-05 07:46:33,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cde7229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:46:33, skipping insertion in model container [2021-06-05 07:46:33,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:46:33" (3/3) ... [2021-06-05 07:46:33,110 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems.i [2021-06-05 07:46:33,113 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 07:46:33,113 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 07:46:33,113 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 07:46:33,114 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 07:46:33,145 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,145 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,146 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,146 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,146 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,146 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,146 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,146 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,146 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,147 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,147 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,147 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,147 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,147 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,147 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,147 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,147 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,147 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,147 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,148 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,148 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,148 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,148 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,148 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,148 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,148 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,148 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,148 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,149 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,149 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,149 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,149 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,149 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,149 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,149 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,149 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,149 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,149 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,150 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,150 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,150 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,150 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,150 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,150 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,150 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,150 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,150 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,151 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,151 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,151 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,151 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,151 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,151 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,151 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,151 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,151 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,151 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,151 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,152 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,152 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,152 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,152 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,152 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,152 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,152 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,152 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,152 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,152 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,152 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,153 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,153 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,153 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,153 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,153 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,153 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,153 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,153 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,153 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,154 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,154 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,154 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,154 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,154 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,154 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,154 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,154 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,154 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,154 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,154 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,155 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,155 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,155 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,155 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,155 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,155 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,155 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,155 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,155 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,155 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,156 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,156 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,156 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,156 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,156 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,156 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,156 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,156 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,156 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,156 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,156 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,157 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,157 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,157 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,157 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,157 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,157 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,157 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,157 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,157 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,157 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,157 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,157 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,158 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,158 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,158 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,158 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,158 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,158 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,158 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,158 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,158 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,158 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,158 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,158 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,159 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,159 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,159 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,159 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,159 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,159 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,159 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,159 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,159 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,159 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,159 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,159 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,161 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,161 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,161 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,161 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,161 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,161 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,161 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,161 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,161 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,161 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,161 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,161 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,162 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,162 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,162 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,162 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,162 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,162 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,162 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,162 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,162 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,162 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,162 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,162 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,163 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,163 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,163 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,163 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,163 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,163 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,163 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,163 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,164 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,164 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,164 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,164 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,164 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,164 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,164 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,164 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,164 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,164 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,164 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,165 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,165 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,165 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,165 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,165 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,165 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,165 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,165 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,165 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,165 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,166 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,166 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,166 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,166 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,166 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,166 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,167 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,169 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,169 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,169 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,170 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,175 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,175 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,175 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,175 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,175 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,182 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,182 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,182 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,184 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,184 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,184 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,184 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,187 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,187 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,187 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,187 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,188 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,188 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,188 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,189 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,189 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,190 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,190 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,190 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,190 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,190 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,191 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,191 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,191 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,191 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,191 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,191 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,192 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,193 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,195 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,195 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,195 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,195 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,196 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,196 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,196 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,196 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,196 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,196 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,197 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,197 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,197 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,197 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,198 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,198 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,199 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,199 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,199 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,200 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,200 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,200 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,201 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,201 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,201 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,201 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:46:33,322 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2021-06-05 07:46:33,341 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 07:46:33,352 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 07:46:33,352 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 07:46:33,353 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 07:46:33,353 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 07:46:33,353 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 07:46:33,353 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 07:46:33,353 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 07:46:33,353 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 07:46:33,363 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 203 places, 285 transitions, 950 flow [2021-06-05 07:46:40,422 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 88735 states, 88729 states have (on average 4.309109761182928) internal successors, (382343), 88734 states have internal predecessors, (382343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:40,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 88735 states, 88729 states have (on average 4.309109761182928) internal successors, (382343), 88734 states have internal predecessors, (382343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:40,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-06-05 07:46:40,525 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:40,525 INFO L521 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] [2021-06-05 07:46:40,526 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:40,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:40,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1268549147, now seen corresponding path program 1 times [2021-06-05 07:46:40,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:40,534 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366110220] [2021-06-05 07:46:40,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:40,811 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:40,812 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366110220] [2021-06-05 07:46:40,812 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366110220] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:40,812 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:40,812 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 07:46:40,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972846548] [2021-06-05 07:46:40,815 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 07:46:40,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:40,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 07:46:40,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 07:46:41,000 INFO L87 Difference]: Start difference. First operand has 88735 states, 88729 states have (on average 4.309109761182928) internal successors, (382343), 88734 states have internal predecessors, (382343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:42,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:42,447 INFO L93 Difference]: Finished difference Result 125143 states and 525783 transitions. [2021-06-05 07:46:42,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 07:46:42,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-06-05 07:46:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:42,799 INFO L225 Difference]: With dead ends: 125143 [2021-06-05 07:46:42,800 INFO L226 Difference]: Without dead ends: 58395 [2021-06-05 07:46:42,802 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 124.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-05 07:46:43,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58395 states. [2021-06-05 07:46:44,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58395 to 58395. [2021-06-05 07:46:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58395 states, 58392 states have (on average 4.310265104808878) internal successors, (251685), 58394 states have internal predecessors, (251685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58395 states to 58395 states and 251685 transitions. [2021-06-05 07:46:45,040 INFO L78 Accepts]: Start accepts. Automaton has 58395 states and 251685 transitions. Word has length 43 [2021-06-05 07:46:45,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:45,042 INFO L482 AbstractCegarLoop]: Abstraction has 58395 states and 251685 transitions. [2021-06-05 07:46:45,042 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:45,042 INFO L276 IsEmpty]: Start isEmpty. Operand 58395 states and 251685 transitions. [2021-06-05 07:46:45,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-06-05 07:46:45,048 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:45,048 INFO L521 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] [2021-06-05 07:46:45,048 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 07:46:45,049 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:45,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:45,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1692566456, now seen corresponding path program 1 times [2021-06-05 07:46:45,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:45,051 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943313659] [2021-06-05 07:46:45,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:45,301 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:45,301 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943313659] [2021-06-05 07:46:45,301 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943313659] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:45,302 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:45,302 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 07:46:45,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834122365] [2021-06-05 07:46:45,303 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 07:46:45,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:45,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 07:46:45,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-06-05 07:46:45,304 INFO L87 Difference]: Start difference. First operand 58395 states and 251685 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:46,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:46,150 INFO L93 Difference]: Finished difference Result 66911 states and 291720 transitions. [2021-06-05 07:46:46,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 07:46:46,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-06-05 07:46:46,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:46,384 INFO L225 Difference]: With dead ends: 66911 [2021-06-05 07:46:46,385 INFO L226 Difference]: Without dead ends: 66911 [2021-06-05 07:46:46,386 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 184.7ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 07:46:46,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66911 states. [2021-06-05 07:46:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66911 to 58422. [2021-06-05 07:46:47,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58422 states, 58419 states have (on average 4.309009055273113) internal successors, (251728), 58421 states have internal predecessors, (251728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:48,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58422 states to 58422 states and 251728 transitions. [2021-06-05 07:46:48,283 INFO L78 Accepts]: Start accepts. Automaton has 58422 states and 251728 transitions. Word has length 45 [2021-06-05 07:46:48,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:48,284 INFO L482 AbstractCegarLoop]: Abstraction has 58422 states and 251728 transitions. [2021-06-05 07:46:48,284 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 58422 states and 251728 transitions. [2021-06-05 07:46:48,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-06-05 07:46:48,285 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:48,285 INFO L521 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] [2021-06-05 07:46:48,285 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 07:46:48,285 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:48,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:48,286 INFO L82 PathProgramCache]: Analyzing trace with hash -913072364, now seen corresponding path program 2 times [2021-06-05 07:46:48,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:48,286 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238277296] [2021-06-05 07:46:48,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:48,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:48,505 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:48,505 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238277296] [2021-06-05 07:46:48,506 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238277296] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:48,506 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:48,506 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 07:46:48,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122038995] [2021-06-05 07:46:48,506 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 07:46:48,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:48,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 07:46:48,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-06-05 07:46:48,507 INFO L87 Difference]: Start difference. First operand 58422 states and 251728 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:49,364 INFO L93 Difference]: Finished difference Result 66936 states and 291761 transitions. [2021-06-05 07:46:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 07:46:49,364 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-06-05 07:46:49,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:49,570 INFO L225 Difference]: With dead ends: 66936 [2021-06-05 07:46:49,570 INFO L226 Difference]: Without dead ends: 66936 [2021-06-05 07:46:49,570 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 207.7ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-06-05 07:46:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66936 states. [2021-06-05 07:46:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66936 to 58420. [2021-06-05 07:46:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58420 states, 58417 states have (on average 4.309122344522998) internal successors, (251726), 58419 states have internal predecessors, (251726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58420 states to 58420 states and 251726 transitions. [2021-06-05 07:46:51,263 INFO L78 Accepts]: Start accepts. Automaton has 58420 states and 251726 transitions. Word has length 45 [2021-06-05 07:46:51,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:51,263 INFO L482 AbstractCegarLoop]: Abstraction has 58420 states and 251726 transitions. [2021-06-05 07:46:51,263 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:51,263 INFO L276 IsEmpty]: Start isEmpty. Operand 58420 states and 251726 transitions. [2021-06-05 07:46:51,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-06-05 07:46:51,264 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:51,264 INFO L521 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] [2021-06-05 07:46:51,264 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 07:46:51,264 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:51,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:51,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1061232370, now seen corresponding path program 3 times [2021-06-05 07:46:51,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:51,265 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361558090] [2021-06-05 07:46:51,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:51,420 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:51,420 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361558090] [2021-06-05 07:46:51,420 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361558090] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:51,420 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:51,420 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 07:46:51,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940238236] [2021-06-05 07:46:51,421 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 07:46:51,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:51,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 07:46:51,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 07:46:51,422 INFO L87 Difference]: Start difference. First operand 58420 states and 251726 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:52,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:52,463 INFO L93 Difference]: Finished difference Result 66933 states and 291758 transitions. [2021-06-05 07:46:52,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 07:46:52,463 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-06-05 07:46:52,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:52,659 INFO L225 Difference]: With dead ends: 66933 [2021-06-05 07:46:52,660 INFO L226 Difference]: Without dead ends: 66933 [2021-06-05 07:46:52,660 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 261.5ms TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2021-06-05 07:46:52,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66933 states. [2021-06-05 07:46:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66933 to 58420. [2021-06-05 07:46:54,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58420 states, 58417 states have (on average 4.309122344522998) internal successors, (251726), 58419 states have internal predecessors, (251726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:54,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58420 states to 58420 states and 251726 transitions. [2021-06-05 07:46:54,543 INFO L78 Accepts]: Start accepts. Automaton has 58420 states and 251726 transitions. Word has length 45 [2021-06-05 07:46:54,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:54,543 INFO L482 AbstractCegarLoop]: Abstraction has 58420 states and 251726 transitions. [2021-06-05 07:46:54,543 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:54,544 INFO L276 IsEmpty]: Start isEmpty. Operand 58420 states and 251726 transitions. [2021-06-05 07:46:54,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-06-05 07:46:54,544 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:54,544 INFO L521 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] [2021-06-05 07:46:54,544 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 07:46:54,545 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:54,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:54,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1738933938, now seen corresponding path program 4 times [2021-06-05 07:46:54,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:54,545 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641356783] [2021-06-05 07:46:54,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:54,733 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:54,733 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641356783] [2021-06-05 07:46:54,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641356783] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:54,734 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:54,734 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 07:46:54,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087114362] [2021-06-05 07:46:54,734 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 07:46:54,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:54,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 07:46:54,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 07:46:54,735 INFO L87 Difference]: Start difference. First operand 58420 states and 251726 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:55,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:55,908 INFO L93 Difference]: Finished difference Result 66894 states and 291684 transitions. [2021-06-05 07:46:55,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 07:46:55,909 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-06-05 07:46:55,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:56,104 INFO L225 Difference]: With dead ends: 66894 [2021-06-05 07:46:56,104 INFO L226 Difference]: Without dead ends: 66894 [2021-06-05 07:46:56,104 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 321.6ms TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-06-05 07:46:56,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66894 states. [2021-06-05 07:46:57,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66894 to 58347. [2021-06-05 07:46:57,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58347 states, 58345 states have (on average 4.312228982774873) internal successors, (251597), 58346 states have internal predecessors, (251597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58347 states to 58347 states and 251597 transitions. [2021-06-05 07:46:57,527 INFO L78 Accepts]: Start accepts. Automaton has 58347 states and 251597 transitions. Word has length 45 [2021-06-05 07:46:57,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:57,528 INFO L482 AbstractCegarLoop]: Abstraction has 58347 states and 251597 transitions. [2021-06-05 07:46:57,528 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:57,528 INFO L276 IsEmpty]: Start isEmpty. Operand 58347 states and 251597 transitions. [2021-06-05 07:46:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-06-05 07:46:57,531 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:57,531 INFO L521 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] [2021-06-05 07:46:57,531 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 07:46:57,531 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:57,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:57,532 INFO L82 PathProgramCache]: Analyzing trace with hash -938071062, now seen corresponding path program 1 times [2021-06-05 07:46:57,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:57,532 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208303429] [2021-06-05 07:46:57,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:57,572 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:57,572 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208303429] [2021-06-05 07:46:57,572 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208303429] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:57,572 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:57,572 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 07:46:57,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051750983] [2021-06-05 07:46:57,572 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 07:46:57,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:57,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 07:46:57,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 07:46:57,573 INFO L87 Difference]: Start difference. First operand 58347 states and 251597 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:58,497 INFO L93 Difference]: Finished difference Result 106077 states and 449265 transitions. [2021-06-05 07:46:58,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 07:46:58,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-06-05 07:46:58,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:58,722 INFO L225 Difference]: With dead ends: 106077 [2021-06-05 07:46:58,722 INFO L226 Difference]: Without dead ends: 80559 [2021-06-05 07:46:58,723 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 20.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-05 07:46:59,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80559 states. [2021-06-05 07:47:00,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80559 to 60189. [2021-06-05 07:47:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60189 states, 60187 states have (on average 4.185073188562314) internal successors, (251887), 60188 states have internal predecessors, (251887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60189 states to 60189 states and 251887 transitions. [2021-06-05 07:47:00,663 INFO L78 Accepts]: Start accepts. Automaton has 60189 states and 251887 transitions. Word has length 58 [2021-06-05 07:47:00,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:00,663 INFO L482 AbstractCegarLoop]: Abstraction has 60189 states and 251887 transitions. [2021-06-05 07:47:00,663 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:00,663 INFO L276 IsEmpty]: Start isEmpty. Operand 60189 states and 251887 transitions. [2021-06-05 07:47:00,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 07:47:00,676 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:00,677 INFO L521 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] [2021-06-05 07:47:00,677 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 07:47:00,677 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:00,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:00,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2132975791, now seen corresponding path program 1 times [2021-06-05 07:47:00,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:00,677 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734560085] [2021-06-05 07:47:00,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:00,869 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:00,869 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734560085] [2021-06-05 07:47:00,869 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734560085] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:00,870 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:00,870 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 07:47:00,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775788355] [2021-06-05 07:47:00,870 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 07:47:00,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:00,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 07:47:00,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-06-05 07:47:00,871 INFO L87 Difference]: Start difference. First operand 60189 states and 251887 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:01,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:01,824 INFO L93 Difference]: Finished difference Result 69158 states and 289783 transitions. [2021-06-05 07:47:01,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 07:47:01,824 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 07:47:01,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:02,025 INFO L225 Difference]: With dead ends: 69158 [2021-06-05 07:47:02,025 INFO L226 Difference]: Without dead ends: 69086 [2021-06-05 07:47:02,026 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 205.9ms TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-06-05 07:47:02,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69086 states. [2021-06-05 07:47:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69086 to 64538. [2021-06-05 07:47:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64538 states, 64536 states have (on average 4.210068798809966) internal successors, (271701), 64537 states have internal predecessors, (271701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64538 states to 64538 states and 271701 transitions. [2021-06-05 07:47:03,629 INFO L78 Accepts]: Start accepts. Automaton has 64538 states and 271701 transitions. Word has length 63 [2021-06-05 07:47:03,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:03,630 INFO L482 AbstractCegarLoop]: Abstraction has 64538 states and 271701 transitions. [2021-06-05 07:47:03,630 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:03,630 INFO L276 IsEmpty]: Start isEmpty. Operand 64538 states and 271701 transitions. [2021-06-05 07:47:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 07:47:03,644 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:03,644 INFO L521 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] [2021-06-05 07:47:03,644 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 07:47:03,644 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:03,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:03,645 INFO L82 PathProgramCache]: Analyzing trace with hash 889509191, now seen corresponding path program 2 times [2021-06-05 07:47:03,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:03,645 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140420061] [2021-06-05 07:47:03,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:03,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:03,710 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:03,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140420061] [2021-06-05 07:47:03,710 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140420061] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:03,710 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:03,711 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 07:47:03,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928261009] [2021-06-05 07:47:03,711 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 07:47:03,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:03,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 07:47:03,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-06-05 07:47:03,712 INFO L87 Difference]: Start difference. First operand 64538 states and 271701 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:04,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:04,677 INFO L93 Difference]: Finished difference Result 88074 states and 363236 transitions. [2021-06-05 07:47:04,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 07:47:04,678 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 07:47:04,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:04,892 INFO L225 Difference]: With dead ends: 88074 [2021-06-05 07:47:04,892 INFO L226 Difference]: Without dead ends: 85032 [2021-06-05 07:47:04,892 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 89.0ms TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2021-06-05 07:47:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85032 states. [2021-06-05 07:47:06,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85032 to 64274. [2021-06-05 07:47:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64274 states, 64272 states have (on average 4.214385735623599) internal successors, (270867), 64273 states have internal predecessors, (270867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:07,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64274 states to 64274 states and 270867 transitions. [2021-06-05 07:47:07,053 INFO L78 Accepts]: Start accepts. Automaton has 64274 states and 270867 transitions. Word has length 63 [2021-06-05 07:47:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:07,068 INFO L482 AbstractCegarLoop]: Abstraction has 64274 states and 270867 transitions. [2021-06-05 07:47:07,069 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand 64274 states and 270867 transitions. [2021-06-05 07:47:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-06-05 07:47:07,088 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:07,088 INFO L521 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] [2021-06-05 07:47:07,088 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 07:47:07,088 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:07,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:07,088 INFO L82 PathProgramCache]: Analyzing trace with hash -943388840, now seen corresponding path program 1 times [2021-06-05 07:47:07,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:07,089 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40872613] [2021-06-05 07:47:07,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:07,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:07,128 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:07,128 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40872613] [2021-06-05 07:47:07,128 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40872613] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:07,128 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:07,129 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 07:47:07,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867808384] [2021-06-05 07:47:07,129 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 07:47:07,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:07,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 07:47:07,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 07:47:07,129 INFO L87 Difference]: Start difference. First operand 64274 states and 270867 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:07,734 INFO L93 Difference]: Finished difference Result 105424 states and 431849 transitions. [2021-06-05 07:47:07,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 07:47:07,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-06-05 07:47:07,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:07,915 INFO L225 Difference]: With dead ends: 105424 [2021-06-05 07:47:07,915 INFO L226 Difference]: Without dead ends: 74071 [2021-06-05 07:47:07,915 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 66.1ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 07:47:08,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74071 states. [2021-06-05 07:47:09,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74071 to 66493. [2021-06-05 07:47:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66493 states, 66492 states have (on average 4.090507128677134) internal successors, (271986), 66492 states have internal predecessors, (271986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:10,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66493 states to 66493 states and 271986 transitions. [2021-06-05 07:47:10,034 INFO L78 Accepts]: Start accepts. Automaton has 66493 states and 271986 transitions. Word has length 64 [2021-06-05 07:47:10,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:10,034 INFO L482 AbstractCegarLoop]: Abstraction has 66493 states and 271986 transitions. [2021-06-05 07:47:10,035 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand 66493 states and 271986 transitions. [2021-06-05 07:47:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 07:47:10,061 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:10,061 INFO L521 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] [2021-06-05 07:47:10,062 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 07:47:10,062 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:10,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:10,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1489193455, now seen corresponding path program 1 times [2021-06-05 07:47:10,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:10,062 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769806518] [2021-06-05 07:47:10,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:10,254 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:10,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769806518] [2021-06-05 07:47:10,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769806518] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:10,254 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:10,254 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 07:47:10,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375129119] [2021-06-05 07:47:10,254 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 07:47:10,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:10,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 07:47:10,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-06-05 07:47:10,255 INFO L87 Difference]: Start difference. First operand 66493 states and 271986 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:11,171 INFO L93 Difference]: Finished difference Result 69911 states and 283080 transitions. [2021-06-05 07:47:11,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 07:47:11,172 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-06-05 07:47:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:11,378 INFO L225 Difference]: With dead ends: 69911 [2021-06-05 07:47:11,378 INFO L226 Difference]: Without dead ends: 68849 [2021-06-05 07:47:11,379 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 208.5ms TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-06-05 07:47:11,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68849 states. [2021-06-05 07:47:12,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68849 to 66928. [2021-06-05 07:47:12,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66928 states, 66927 states have (on average 4.075948421414377) internal successors, (272791), 66927 states have internal predecessors, (272791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66928 states to 66928 states and 272791 transitions. [2021-06-05 07:47:12,816 INFO L78 Accepts]: Start accepts. Automaton has 66928 states and 272791 transitions. Word has length 66 [2021-06-05 07:47:12,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:12,816 INFO L482 AbstractCegarLoop]: Abstraction has 66928 states and 272791 transitions. [2021-06-05 07:47:12,816 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:12,816 INFO L276 IsEmpty]: Start isEmpty. Operand 66928 states and 272791 transitions. [2021-06-05 07:47:12,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 07:47:12,844 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:12,844 INFO L521 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] [2021-06-05 07:47:12,844 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 07:47:12,844 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:12,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:12,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1477002865, now seen corresponding path program 2 times [2021-06-05 07:47:12,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:12,845 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038271901] [2021-06-05 07:47:12,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:13,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:13,108 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:13,108 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038271901] [2021-06-05 07:47:13,108 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038271901] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:13,108 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:13,108 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 07:47:13,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876792513] [2021-06-05 07:47:13,109 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 07:47:13,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:13,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 07:47:13,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 07:47:13,109 INFO L87 Difference]: Start difference. First operand 66928 states and 272791 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:14,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:14,373 INFO L93 Difference]: Finished difference Result 75416 states and 306949 transitions. [2021-06-05 07:47:14,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 07:47:14,374 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-06-05 07:47:14,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:14,575 INFO L225 Difference]: With dead ends: 75416 [2021-06-05 07:47:14,575 INFO L226 Difference]: Without dead ends: 74912 [2021-06-05 07:47:14,575 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 446.1ms TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2021-06-05 07:47:14,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74912 states. [2021-06-05 07:47:15,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74912 to 70681. [2021-06-05 07:47:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70681 states, 70680 states have (on average 4.0942416525183924) internal successors, (289381), 70680 states have internal predecessors, (289381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70681 states to 70681 states and 289381 transitions. [2021-06-05 07:47:16,220 INFO L78 Accepts]: Start accepts. Automaton has 70681 states and 289381 transitions. Word has length 66 [2021-06-05 07:47:16,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:16,220 INFO L482 AbstractCegarLoop]: Abstraction has 70681 states and 289381 transitions. [2021-06-05 07:47:16,220 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 70681 states and 289381 transitions. [2021-06-05 07:47:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 07:47:16,251 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:16,251 INFO L521 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] [2021-06-05 07:47:16,251 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 07:47:16,251 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:16,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:16,252 INFO L82 PathProgramCache]: Analyzing trace with hash -606040241, now seen corresponding path program 3 times [2021-06-05 07:47:16,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:16,252 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875456123] [2021-06-05 07:47:16,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:16,659 WARN L205 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2021-06-05 07:47:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:16,905 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:16,905 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875456123] [2021-06-05 07:47:16,905 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875456123] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:16,905 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:16,905 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 07:47:16,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585489627] [2021-06-05 07:47:16,906 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 07:47:16,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:16,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 07:47:16,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 07:47:16,906 INFO L87 Difference]: Start difference. First operand 70681 states and 289381 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:17,804 INFO L93 Difference]: Finished difference Result 79143 states and 323485 transitions. [2021-06-05 07:47:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 07:47:17,804 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-06-05 07:47:17,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:18,002 INFO L225 Difference]: With dead ends: 79143 [2021-06-05 07:47:18,002 INFO L226 Difference]: Without dead ends: 78639 [2021-06-05 07:47:18,003 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 786.0ms TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2021-06-05 07:47:18,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78639 states. [2021-06-05 07:47:19,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78639 to 70681. [2021-06-05 07:47:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70681 states, 70680 states have (on average 4.0942416525183924) internal successors, (289381), 70680 states have internal predecessors, (289381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:20,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70681 states to 70681 states and 289381 transitions. [2021-06-05 07:47:20,015 INFO L78 Accepts]: Start accepts. Automaton has 70681 states and 289381 transitions. Word has length 66 [2021-06-05 07:47:20,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:20,015 INFO L482 AbstractCegarLoop]: Abstraction has 70681 states and 289381 transitions. [2021-06-05 07:47:20,016 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:20,016 INFO L276 IsEmpty]: Start isEmpty. Operand 70681 states and 289381 transitions. [2021-06-05 07:47:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 07:47:20,044 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:20,044 INFO L521 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] [2021-06-05 07:47:20,045 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 07:47:20,045 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:20,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:20,045 INFO L82 PathProgramCache]: Analyzing trace with hash 703438637, now seen corresponding path program 4 times [2021-06-05 07:47:20,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:20,045 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490737030] [2021-06-05 07:47:20,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:20,394 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:20,394 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490737030] [2021-06-05 07:47:20,394 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490737030] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:20,394 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:20,394 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-06-05 07:47:20,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611803023] [2021-06-05 07:47:20,395 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 07:47:20,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:20,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 07:47:20,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-06-05 07:47:20,395 INFO L87 Difference]: Start difference. First operand 70681 states and 289381 transitions. Second operand has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:21,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:21,830 INFO L93 Difference]: Finished difference Result 84271 states and 345635 transitions. [2021-06-05 07:47:21,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 07:47:21,830 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-06-05 07:47:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:22,049 INFO L225 Difference]: With dead ends: 84271 [2021-06-05 07:47:22,049 INFO L226 Difference]: Without dead ends: 83767 [2021-06-05 07:47:22,050 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 557.4ms TimeCoverageRelationStatistics Valid=154, Invalid=838, Unknown=0, NotChecked=0, Total=992 [2021-06-05 07:47:22,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83767 states. [2021-06-05 07:47:23,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83767 to 70681. [2021-06-05 07:47:23,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70681 states, 70680 states have (on average 4.0942416525183924) internal successors, (289381), 70680 states have internal predecessors, (289381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:23,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70681 states to 70681 states and 289381 transitions. [2021-06-05 07:47:23,694 INFO L78 Accepts]: Start accepts. Automaton has 70681 states and 289381 transitions. Word has length 66 [2021-06-05 07:47:23,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:23,695 INFO L482 AbstractCegarLoop]: Abstraction has 70681 states and 289381 transitions. [2021-06-05 07:47:23,695 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:23,695 INFO L276 IsEmpty]: Start isEmpty. Operand 70681 states and 289381 transitions. [2021-06-05 07:47:23,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 07:47:23,723 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:23,723 INFO L521 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] [2021-06-05 07:47:23,723 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 07:47:23,723 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:23,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:23,724 INFO L82 PathProgramCache]: Analyzing trace with hash -444976683, now seen corresponding path program 5 times [2021-06-05 07:47:23,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:23,724 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239262700] [2021-06-05 07:47:23,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:24,466 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:24,466 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239262700] [2021-06-05 07:47:24,466 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239262700] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:24,466 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:24,466 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 07:47:24,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931645538] [2021-06-05 07:47:24,467 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 07:47:24,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:24,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 07:47:24,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-06-05 07:47:24,467 INFO L87 Difference]: Start difference. First operand 70681 states and 289381 transitions. Second operand has 20 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:25,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:25,771 INFO L93 Difference]: Finished difference Result 79125 states and 323446 transitions. [2021-06-05 07:47:25,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 07:47:25,772 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-06-05 07:47:25,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:25,966 INFO L225 Difference]: With dead ends: 79125 [2021-06-05 07:47:25,966 INFO L226 Difference]: Without dead ends: 78621 [2021-06-05 07:47:25,967 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1055.7ms TimeCoverageRelationStatistics Valid=168, Invalid=1092, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 07:47:26,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78621 states. [2021-06-05 07:47:27,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78621 to 70681. [2021-06-05 07:47:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70681 states, 70680 states have (on average 4.0942416525183924) internal successors, (289381), 70680 states have internal predecessors, (289381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:28,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70681 states to 70681 states and 289381 transitions. [2021-06-05 07:47:28,025 INFO L78 Accepts]: Start accepts. Automaton has 70681 states and 289381 transitions. Word has length 66 [2021-06-05 07:47:28,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:28,026 INFO L482 AbstractCegarLoop]: Abstraction has 70681 states and 289381 transitions. [2021-06-05 07:47:28,026 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:28,026 INFO L276 IsEmpty]: Start isEmpty. Operand 70681 states and 289381 transitions. [2021-06-05 07:47:28,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 07:47:28,055 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:28,056 INFO L521 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] [2021-06-05 07:47:28,056 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 07:47:28,056 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:28,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:28,056 INFO L82 PathProgramCache]: Analyzing trace with hash 658657317, now seen corresponding path program 6 times [2021-06-05 07:47:28,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:28,056 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174280803] [2021-06-05 07:47:28,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:28,269 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:28,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174280803] [2021-06-05 07:47:28,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174280803] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:28,270 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:28,270 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 07:47:28,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704015827] [2021-06-05 07:47:28,270 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 07:47:28,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:28,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 07:47:28,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-06-05 07:47:28,271 INFO L87 Difference]: Start difference. First operand 70681 states and 289381 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:29,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:29,504 INFO L93 Difference]: Finished difference Result 78824 states and 322585 transitions. [2021-06-05 07:47:29,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 07:47:29,504 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-06-05 07:47:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:29,940 INFO L225 Difference]: With dead ends: 78824 [2021-06-05 07:47:29,940 INFO L226 Difference]: Without dead ends: 78320 [2021-06-05 07:47:29,941 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 325.4ms TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2021-06-05 07:47:30,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78320 states. [2021-06-05 07:47:31,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78320 to 70342. [2021-06-05 07:47:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70342 states, 70341 states have (on average 4.1005956696663395) internal successors, (288440), 70341 states have internal predecessors, (288440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:31,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70342 states to 70342 states and 288440 transitions. [2021-06-05 07:47:31,636 INFO L78 Accepts]: Start accepts. Automaton has 70342 states and 288440 transitions. Word has length 66 [2021-06-05 07:47:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:31,636 INFO L482 AbstractCegarLoop]: Abstraction has 70342 states and 288440 transitions. [2021-06-05 07:47:31,636 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 70342 states and 288440 transitions. [2021-06-05 07:47:31,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-05 07:47:31,683 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:31,683 INFO L521 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] [2021-06-05 07:47:31,683 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 07:47:31,683 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:31,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:31,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1093258141, now seen corresponding path program 1 times [2021-06-05 07:47:31,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:31,683 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868530182] [2021-06-05 07:47:31,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:31,772 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:31,772 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868530182] [2021-06-05 07:47:31,773 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868530182] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:31,773 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:31,773 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 07:47:31,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156250507] [2021-06-05 07:47:31,773 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 07:47:31,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:31,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 07:47:31,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-06-05 07:47:31,774 INFO L87 Difference]: Start difference. First operand 70342 states and 288440 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:32,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:32,750 INFO L93 Difference]: Finished difference Result 85397 states and 345997 transitions. [2021-06-05 07:47:32,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 07:47:32,750 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-06-05 07:47:32,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:33,006 INFO L225 Difference]: With dead ends: 85397 [2021-06-05 07:47:33,006 INFO L226 Difference]: Without dead ends: 81219 [2021-06-05 07:47:33,007 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 127.0ms TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2021-06-05 07:47:33,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81219 states. [2021-06-05 07:47:34,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81219 to 69448. [2021-06-05 07:47:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69448 states, 69447 states have (on average 4.10232263452705) internal successors, (284894), 69447 states have internal predecessors, (284894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69448 states to 69448 states and 284894 transitions. [2021-06-05 07:47:34,702 INFO L78 Accepts]: Start accepts. Automaton has 69448 states and 284894 transitions. Word has length 69 [2021-06-05 07:47:34,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:34,702 INFO L482 AbstractCegarLoop]: Abstraction has 69448 states and 284894 transitions. [2021-06-05 07:47:34,702 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:34,702 INFO L276 IsEmpty]: Start isEmpty. Operand 69448 states and 284894 transitions. [2021-06-05 07:47:34,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-05 07:47:34,748 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:34,748 INFO L521 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] [2021-06-05 07:47:34,748 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 07:47:34,748 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:34,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:34,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1336503561, now seen corresponding path program 1 times [2021-06-05 07:47:34,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:34,749 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290101035] [2021-06-05 07:47:34,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:34,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:34,812 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:34,812 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290101035] [2021-06-05 07:47:34,812 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290101035] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:34,812 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:34,812 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 07:47:34,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755661783] [2021-06-05 07:47:34,813 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 07:47:34,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:34,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 07:47:34,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-06-05 07:47:34,813 INFO L87 Difference]: Start difference. First operand 69448 states and 284894 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:35,425 WARN L205 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-06-05 07:47:35,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:35,900 INFO L93 Difference]: Finished difference Result 83375 states and 337948 transitions. [2021-06-05 07:47:35,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 07:47:35,900 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-06-05 07:47:35,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:36,091 INFO L225 Difference]: With dead ends: 83375 [2021-06-05 07:47:36,091 INFO L226 Difference]: Without dead ends: 76110 [2021-06-05 07:47:36,092 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 560.3ms TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2021-06-05 07:47:36,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76110 states. [2021-06-05 07:47:37,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76110 to 67963. [2021-06-05 07:47:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67963 states, 67962 states have (on average 4.104926282334246) internal successors, (278979), 67962 states have internal predecessors, (278979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:37,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67963 states to 67963 states and 278979 transitions. [2021-06-05 07:47:37,768 INFO L78 Accepts]: Start accepts. Automaton has 67963 states and 278979 transitions. Word has length 69 [2021-06-05 07:47:37,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:37,768 INFO L482 AbstractCegarLoop]: Abstraction has 67963 states and 278979 transitions. [2021-06-05 07:47:37,768 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:37,768 INFO L276 IsEmpty]: Start isEmpty. Operand 67963 states and 278979 transitions. [2021-06-05 07:47:37,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 07:47:37,822 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:37,822 INFO L521 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] [2021-06-05 07:47:37,822 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 07:47:37,822 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:37,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:37,822 INFO L82 PathProgramCache]: Analyzing trace with hash 314287992, now seen corresponding path program 1 times [2021-06-05 07:47:37,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:37,823 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305885576] [2021-06-05 07:47:37,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:38,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:38,813 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:38,813 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305885576] [2021-06-05 07:47:38,813 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305885576] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:38,813 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:38,813 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-06-05 07:47:38,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144560273] [2021-06-05 07:47:38,813 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 07:47:38,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:38,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 07:47:38,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2021-06-05 07:47:38,814 INFO L87 Difference]: Start difference. First operand 67963 states and 278979 transitions. Second operand has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:40,219 INFO L93 Difference]: Finished difference Result 79344 states and 327032 transitions. [2021-06-05 07:47:40,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 07:47:40,219 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-06-05 07:47:40,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:40,734 INFO L225 Difference]: With dead ends: 79344 [2021-06-05 07:47:40,734 INFO L226 Difference]: Without dead ends: 78840 [2021-06-05 07:47:40,734 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1005.3ms TimeCoverageRelationStatistics Valid=211, Invalid=1429, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 07:47:40,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78840 states. [2021-06-05 07:47:41,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78840 to 66498. [2021-06-05 07:47:42,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66498 states, 66497 states have (on average 4.112005052859527) internal successors, (273436), 66497 states have internal predecessors, (273436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66498 states to 66498 states and 273436 transitions. [2021-06-05 07:47:42,220 INFO L78 Accepts]: Start accepts. Automaton has 66498 states and 273436 transitions. Word has length 71 [2021-06-05 07:47:42,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:42,221 INFO L482 AbstractCegarLoop]: Abstraction has 66498 states and 273436 transitions. [2021-06-05 07:47:42,221 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 66498 states and 273436 transitions. [2021-06-05 07:47:42,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:47:42,283 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:42,283 INFO L521 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] [2021-06-05 07:47:42,283 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 07:47:42,283 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:42,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:42,283 INFO L82 PathProgramCache]: Analyzing trace with hash 158331709, now seen corresponding path program 1 times [2021-06-05 07:47:42,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:42,284 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290801191] [2021-06-05 07:47:42,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:42,484 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:42,484 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290801191] [2021-06-05 07:47:42,484 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290801191] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:42,484 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:42,484 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 07:47:42,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116301087] [2021-06-05 07:47:42,484 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 07:47:42,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:42,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 07:47:42,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-06-05 07:47:42,485 INFO L87 Difference]: Start difference. First operand 66498 states and 273436 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:43,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:43,435 INFO L93 Difference]: Finished difference Result 68492 states and 279231 transitions. [2021-06-05 07:47:43,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 07:47:43,435 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:47:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:43,615 INFO L225 Difference]: With dead ends: 68492 [2021-06-05 07:47:43,615 INFO L226 Difference]: Without dead ends: 66050 [2021-06-05 07:47:43,615 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 234.8ms TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 07:47:43,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66050 states. [2021-06-05 07:47:44,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66050 to 65106. [2021-06-05 07:47:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65106 states, 65105 states have (on average 4.109653636433453) internal successors, (267559), 65105 states have internal predecessors, (267559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:45,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65106 states to 65106 states and 267559 transitions. [2021-06-05 07:47:45,114 INFO L78 Accepts]: Start accepts. Automaton has 65106 states and 267559 transitions. Word has length 74 [2021-06-05 07:47:45,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:45,114 INFO L482 AbstractCegarLoop]: Abstraction has 65106 states and 267559 transitions. [2021-06-05 07:47:45,114 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:45,114 INFO L276 IsEmpty]: Start isEmpty. Operand 65106 states and 267559 transitions. [2021-06-05 07:47:45,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:47:45,177 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:45,177 INFO L521 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] [2021-06-05 07:47:45,177 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 07:47:45,177 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:45,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:45,177 INFO L82 PathProgramCache]: Analyzing trace with hash 73071320, now seen corresponding path program 1 times [2021-06-05 07:47:45,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:45,177 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138524579] [2021-06-05 07:47:45,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:45,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:45,429 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:45,429 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138524579] [2021-06-05 07:47:45,429 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138524579] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:45,429 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:45,429 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-06-05 07:47:45,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704440528] [2021-06-05 07:47:45,430 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 07:47:45,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:45,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 07:47:45,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-06-05 07:47:45,430 INFO L87 Difference]: Start difference. First operand 65106 states and 267559 transitions. Second operand has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:46,961 INFO L93 Difference]: Finished difference Result 75371 states and 307895 transitions. [2021-06-05 07:47:46,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 07:47:46,961 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:47:46,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:47,146 INFO L225 Difference]: With dead ends: 75371 [2021-06-05 07:47:47,147 INFO L226 Difference]: Without dead ends: 74651 [2021-06-05 07:47:47,147 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 534.8ms TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2021-06-05 07:47:47,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74651 states. [2021-06-05 07:47:48,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74651 to 70009. [2021-06-05 07:47:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70009 states, 70008 states have (on average 4.113115643926409) internal successors, (287951), 70008 states have internal predecessors, (287951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:48,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70009 states to 70009 states and 287951 transitions. [2021-06-05 07:47:48,714 INFO L78 Accepts]: Start accepts. Automaton has 70009 states and 287951 transitions. Word has length 74 [2021-06-05 07:47:48,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:48,714 INFO L482 AbstractCegarLoop]: Abstraction has 70009 states and 287951 transitions. [2021-06-05 07:47:48,714 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:48,714 INFO L276 IsEmpty]: Start isEmpty. Operand 70009 states and 287951 transitions. [2021-06-05 07:47:48,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:47:48,783 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:48,783 INFO L521 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] [2021-06-05 07:47:48,783 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 07:47:48,783 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:48,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:48,783 INFO L82 PathProgramCache]: Analyzing trace with hash -498450916, now seen corresponding path program 2 times [2021-06-05 07:47:48,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:48,784 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891910870] [2021-06-05 07:47:48,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:49,528 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:49,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891910870] [2021-06-05 07:47:49,529 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891910870] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:49,529 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:49,529 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 07:47:49,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727273788] [2021-06-05 07:47:49,529 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 07:47:49,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:49,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 07:47:49,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-06-05 07:47:49,530 INFO L87 Difference]: Start difference. First operand 70009 states and 287951 transitions. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:50,637 INFO L93 Difference]: Finished difference Result 79946 states and 326820 transitions. [2021-06-05 07:47:50,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 07:47:50,637 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:47:50,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:50,831 INFO L225 Difference]: With dead ends: 79946 [2021-06-05 07:47:50,831 INFO L226 Difference]: Without dead ends: 79226 [2021-06-05 07:47:50,831 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 997.4ms TimeCoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 07:47:51,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79226 states. [2021-06-05 07:47:52,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79226 to 69406. [2021-06-05 07:47:52,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69406 states, 69405 states have (on average 4.108868237158706) internal successors, (285176), 69405 states have internal predecessors, (285176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69406 states to 69406 states and 285176 transitions. [2021-06-05 07:47:52,790 INFO L78 Accepts]: Start accepts. Automaton has 69406 states and 285176 transitions. Word has length 74 [2021-06-05 07:47:52,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:52,790 INFO L482 AbstractCegarLoop]: Abstraction has 69406 states and 285176 transitions. [2021-06-05 07:47:52,790 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 69406 states and 285176 transitions. [2021-06-05 07:47:52,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:47:52,862 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:52,862 INFO L521 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] [2021-06-05 07:47:52,862 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 07:47:52,863 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:52,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:52,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1892190614, now seen corresponding path program 3 times [2021-06-05 07:47:52,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:52,863 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17413478] [2021-06-05 07:47:52,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:53,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:53,386 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:53,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17413478] [2021-06-05 07:47:53,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17413478] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:53,387 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:53,387 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-05 07:47:53,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277505622] [2021-06-05 07:47:53,387 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 07:47:53,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:53,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 07:47:53,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2021-06-05 07:47:53,387 INFO L87 Difference]: Start difference. First operand 69406 states and 285176 transitions. Second operand has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:54,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:54,988 INFO L93 Difference]: Finished difference Result 77296 states and 315655 transitions. [2021-06-05 07:47:54,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 07:47:54,988 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:47:54,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:55,183 INFO L225 Difference]: With dead ends: 77296 [2021-06-05 07:47:55,184 INFO L226 Difference]: Without dead ends: 76576 [2021-06-05 07:47:55,184 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 935.5ms TimeCoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 07:47:55,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76576 states. [2021-06-05 07:47:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76576 to 68974. [2021-06-05 07:47:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68974 states, 68973 states have (on average 4.109811085497223) internal successors, (283466), 68973 states have internal predecessors, (283466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:56,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68974 states to 68974 states and 283466 transitions. [2021-06-05 07:47:56,787 INFO L78 Accepts]: Start accepts. Automaton has 68974 states and 283466 transitions. Word has length 74 [2021-06-05 07:47:56,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:56,787 INFO L482 AbstractCegarLoop]: Abstraction has 68974 states and 283466 transitions. [2021-06-05 07:47:56,787 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:56,787 INFO L276 IsEmpty]: Start isEmpty. Operand 68974 states and 283466 transitions. [2021-06-05 07:47:56,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:47:56,857 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:56,857 INFO L521 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] [2021-06-05 07:47:56,857 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 07:47:56,857 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:56,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:56,857 INFO L82 PathProgramCache]: Analyzing trace with hash 350357274, now seen corresponding path program 1 times [2021-06-05 07:47:56,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:56,857 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080195559] [2021-06-05 07:47:56,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:57,334 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-06-05 07:47:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:57,597 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:57,597 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080195559] [2021-06-05 07:47:57,597 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080195559] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:57,597 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:57,597 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 07:47:57,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624930778] [2021-06-05 07:47:57,597 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 07:47:57,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:57,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 07:47:57,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-06-05 07:47:57,598 INFO L87 Difference]: Start difference. First operand 68974 states and 283466 transitions. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:47:58,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:58,666 INFO L93 Difference]: Finished difference Result 82442 states and 337398 transitions. [2021-06-05 07:47:58,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 07:47:58,667 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:47:58,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:58,874 INFO L225 Difference]: With dead ends: 82442 [2021-06-05 07:47:58,874 INFO L226 Difference]: Without dead ends: 81734 [2021-06-05 07:47:58,875 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 957.6ms TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2021-06-05 07:47:59,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81734 states. [2021-06-05 07:48:00,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81734 to 68965. [2021-06-05 07:48:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68965 states, 68964 states have (on average 4.110129922858303) internal successors, (283451), 68964 states have internal predecessors, (283451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:00,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68965 states to 68965 states and 283451 transitions. [2021-06-05 07:48:00,848 INFO L78 Accepts]: Start accepts. Automaton has 68965 states and 283451 transitions. Word has length 74 [2021-06-05 07:48:00,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:00,848 INFO L482 AbstractCegarLoop]: Abstraction has 68965 states and 283451 transitions. [2021-06-05 07:48:00,848 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 68965 states and 283451 transitions. [2021-06-05 07:48:00,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:48:00,914 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:00,914 INFO L521 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] [2021-06-05 07:48:00,914 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 07:48:00,914 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:00,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:00,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1259251836, now seen corresponding path program 2 times [2021-06-05 07:48:00,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:00,915 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530720993] [2021-06-05 07:48:00,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:48:01,243 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:48:01,243 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530720993] [2021-06-05 07:48:01,243 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530720993] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:48:01,243 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:48:01,243 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 07:48:01,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708353885] [2021-06-05 07:48:01,243 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 07:48:01,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:48:01,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 07:48:01,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-06-05 07:48:01,244 INFO L87 Difference]: Start difference. First operand 68965 states and 283451 transitions. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:02,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:02,555 INFO L93 Difference]: Finished difference Result 77675 states and 317121 transitions. [2021-06-05 07:48:02,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 07:48:02,556 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:48:02,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:02,761 INFO L225 Difference]: With dead ends: 77675 [2021-06-05 07:48:02,761 INFO L226 Difference]: Without dead ends: 76967 [2021-06-05 07:48:02,761 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 559.4ms TimeCoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 07:48:02,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76967 states. [2021-06-05 07:48:04,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76967 to 68971. [2021-06-05 07:48:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68971 states, 68970 states have (on average 4.110047846889952) internal successors, (283470), 68970 states have internal predecessors, (283470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:04,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68971 states to 68971 states and 283470 transitions. [2021-06-05 07:48:04,311 INFO L78 Accepts]: Start accepts. Automaton has 68971 states and 283470 transitions. Word has length 74 [2021-06-05 07:48:04,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:04,311 INFO L482 AbstractCegarLoop]: Abstraction has 68971 states and 283470 transitions. [2021-06-05 07:48:04,311 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 68971 states and 283470 transitions. [2021-06-05 07:48:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:48:04,378 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:04,378 INFO L521 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] [2021-06-05 07:48:04,378 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 07:48:04,378 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:04,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:04,379 INFO L82 PathProgramCache]: Analyzing trace with hash -884497698, now seen corresponding path program 3 times [2021-06-05 07:48:04,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:04,379 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095221391] [2021-06-05 07:48:04,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:48:04,740 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:48:04,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095221391] [2021-06-05 07:48:04,741 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095221391] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:48:04,741 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:48:04,741 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-05 07:48:04,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076139998] [2021-06-05 07:48:04,741 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 07:48:04,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:48:04,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 07:48:04,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-06-05 07:48:04,742 INFO L87 Difference]: Start difference. First operand 68971 states and 283470 transitions. Second operand has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:05,373 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2021-06-05 07:48:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:06,290 INFO L93 Difference]: Finished difference Result 74261 states and 303527 transitions. [2021-06-05 07:48:06,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 07:48:06,291 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:48:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:06,470 INFO L225 Difference]: With dead ends: 74261 [2021-06-05 07:48:06,470 INFO L226 Difference]: Without dead ends: 73553 [2021-06-05 07:48:06,470 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 993.8ms TimeCoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 07:48:06,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73553 states. [2021-06-05 07:48:07,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73553 to 65515. [2021-06-05 07:48:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65515 states, 65514 states have (on average 4.117471074884757) internal successors, (269752), 65514 states have internal predecessors, (269752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:08,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65515 states to 65515 states and 269752 transitions. [2021-06-05 07:48:08,376 INFO L78 Accepts]: Start accepts. Automaton has 65515 states and 269752 transitions. Word has length 74 [2021-06-05 07:48:08,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:08,377 INFO L482 AbstractCegarLoop]: Abstraction has 65515 states and 269752 transitions. [2021-06-05 07:48:08,377 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:08,377 INFO L276 IsEmpty]: Start isEmpty. Operand 65515 states and 269752 transitions. [2021-06-05 07:48:08,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:48:08,448 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:08,449 INFO L521 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] [2021-06-05 07:48:08,449 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 07:48:08,449 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:08,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:08,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1180050333, now seen corresponding path program 2 times [2021-06-05 07:48:08,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:08,449 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041623718] [2021-06-05 07:48:08,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:48:08,950 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:48:08,950 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041623718] [2021-06-05 07:48:08,950 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041623718] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:48:08,950 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:48:08,950 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 07:48:08,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671488629] [2021-06-05 07:48:08,950 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 07:48:08,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:48:08,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 07:48:08,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 07:48:08,951 INFO L87 Difference]: Start difference. First operand 65515 states and 269752 transitions. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:10,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:10,939 INFO L93 Difference]: Finished difference Result 75252 states and 306563 transitions. [2021-06-05 07:48:10,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 07:48:10,939 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:48:10,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:11,128 INFO L225 Difference]: With dead ends: 75252 [2021-06-05 07:48:11,128 INFO L226 Difference]: Without dead ends: 72810 [2021-06-05 07:48:11,129 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1127.9ms TimeCoverageRelationStatistics Valid=220, Invalid=1420, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 07:48:11,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72810 states. [2021-06-05 07:48:12,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72810 to 68026. [2021-06-05 07:48:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68026 states, 68025 states have (on average 4.113796398382948) internal successors, (279841), 68025 states have internal predecessors, (279841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68026 states to 68026 states and 279841 transitions. [2021-06-05 07:48:12,577 INFO L78 Accepts]: Start accepts. Automaton has 68026 states and 279841 transitions. Word has length 74 [2021-06-05 07:48:12,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:12,577 INFO L482 AbstractCegarLoop]: Abstraction has 68026 states and 279841 transitions. [2021-06-05 07:48:12,577 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 68026 states and 279841 transitions. [2021-06-05 07:48:12,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:48:12,644 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:12,644 INFO L521 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] [2021-06-05 07:48:12,644 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 07:48:12,644 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:12,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:12,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1096231199, now seen corresponding path program 3 times [2021-06-05 07:48:12,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:12,644 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123267959] [2021-06-05 07:48:12,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:48:13,072 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:48:13,072 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123267959] [2021-06-05 07:48:13,072 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123267959] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:48:13,072 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:48:13,072 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 07:48:13,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354505691] [2021-06-05 07:48:13,072 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 07:48:13,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:48:13,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 07:48:13,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 07:48:13,073 INFO L87 Difference]: Start difference. First operand 68026 states and 279841 transitions. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:13,817 WARN L205 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2021-06-05 07:48:14,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:14,932 INFO L93 Difference]: Finished difference Result 72928 states and 297311 transitions. [2021-06-05 07:48:14,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 07:48:14,932 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:48:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:15,106 INFO L225 Difference]: With dead ends: 72928 [2021-06-05 07:48:15,106 INFO L226 Difference]: Without dead ends: 70486 [2021-06-05 07:48:15,106 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1368.2ms TimeCoverageRelationStatistics Valid=193, Invalid=1289, Unknown=0, NotChecked=0, Total=1482 [2021-06-05 07:48:15,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70486 states. [2021-06-05 07:48:16,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70486 to 68024. [2021-06-05 07:48:16,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68024 states, 68023 states have (on average 4.113858547844112) internal successors, (279837), 68023 states have internal predecessors, (279837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68024 states to 68024 states and 279837 transitions. [2021-06-05 07:48:16,996 INFO L78 Accepts]: Start accepts. Automaton has 68024 states and 279837 transitions. Word has length 74 [2021-06-05 07:48:16,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:16,996 INFO L482 AbstractCegarLoop]: Abstraction has 68024 states and 279837 transitions. [2021-06-05 07:48:16,996 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:16,996 INFO L276 IsEmpty]: Start isEmpty. Operand 68024 states and 279837 transitions. [2021-06-05 07:48:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:48:17,076 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:17,076 INFO L521 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] [2021-06-05 07:48:17,076 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 07:48:17,076 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:17,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:17,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1554251865, now seen corresponding path program 4 times [2021-06-05 07:48:17,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:17,077 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670260884] [2021-06-05 07:48:17,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:48:17,429 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:48:17,429 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670260884] [2021-06-05 07:48:17,429 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670260884] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:48:17,429 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:48:17,429 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 07:48:17,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233547110] [2021-06-05 07:48:17,429 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 07:48:17,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:48:17,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 07:48:17,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 07:48:17,430 INFO L87 Difference]: Start difference. First operand 68024 states and 279837 transitions. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:18,575 INFO L93 Difference]: Finished difference Result 73954 states and 301228 transitions. [2021-06-05 07:48:18,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 07:48:18,575 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:48:18,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:19,078 INFO L225 Difference]: With dead ends: 73954 [2021-06-05 07:48:19,078 INFO L226 Difference]: Without dead ends: 71512 [2021-06-05 07:48:19,078 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 601.6ms TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 07:48:19,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71512 states. [2021-06-05 07:48:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71512 to 68010. [2021-06-05 07:48:20,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68010 states, 68009 states have (on average 4.114117249187608) internal successors, (279797), 68009 states have internal predecessors, (279797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68010 states to 68010 states and 279797 transitions. [2021-06-05 07:48:20,516 INFO L78 Accepts]: Start accepts. Automaton has 68010 states and 279797 transitions. Word has length 74 [2021-06-05 07:48:20,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:20,516 INFO L482 AbstractCegarLoop]: Abstraction has 68010 states and 279797 transitions. [2021-06-05 07:48:20,516 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 68010 states and 279797 transitions. [2021-06-05 07:48:20,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:48:20,582 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:20,582 INFO L521 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] [2021-06-05 07:48:20,582 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 07:48:20,582 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:20,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:20,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1517951545, now seen corresponding path program 5 times [2021-06-05 07:48:20,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:20,583 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981041142] [2021-06-05 07:48:20,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:48:21,008 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:48:21,008 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981041142] [2021-06-05 07:48:21,008 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981041142] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:48:21,008 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:48:21,008 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 07:48:21,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502593289] [2021-06-05 07:48:21,008 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 07:48:21,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:48:21,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 07:48:21,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2021-06-05 07:48:21,009 INFO L87 Difference]: Start difference. First operand 68010 states and 279797 transitions. Second operand has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:22,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:22,716 INFO L93 Difference]: Finished difference Result 72991 states and 297734 transitions. [2021-06-05 07:48:22,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 07:48:22,716 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:48:22,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:22,928 INFO L225 Difference]: With dead ends: 72991 [2021-06-05 07:48:22,928 INFO L226 Difference]: Without dead ends: 70594 [2021-06-05 07:48:22,930 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 796.2ms TimeCoverageRelationStatistics Valid=199, Invalid=1283, Unknown=0, NotChecked=0, Total=1482 [2021-06-05 07:48:23,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70594 states. [2021-06-05 07:48:24,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70594 to 67998. [2021-06-05 07:48:24,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67998 states, 67997 states have (on average 4.11431386678824) internal successors, (279761), 67997 states have internal predecessors, (279761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67998 states to 67998 states and 279761 transitions. [2021-06-05 07:48:24,687 INFO L78 Accepts]: Start accepts. Automaton has 67998 states and 279761 transitions. Word has length 74 [2021-06-05 07:48:24,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:24,687 INFO L482 AbstractCegarLoop]: Abstraction has 67998 states and 279761 transitions. [2021-06-05 07:48:24,687 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:24,687 INFO L276 IsEmpty]: Start isEmpty. Operand 67998 states and 279761 transitions. [2021-06-05 07:48:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:48:24,777 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:24,777 INFO L521 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] [2021-06-05 07:48:24,777 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 07:48:24,777 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:24,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:24,778 INFO L82 PathProgramCache]: Analyzing trace with hash -755893651, now seen corresponding path program 6 times [2021-06-05 07:48:24,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:24,778 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166451029] [2021-06-05 07:48:24,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:25,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:48:25,630 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:48:25,630 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166451029] [2021-06-05 07:48:25,630 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166451029] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:48:25,630 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:48:25,631 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-05 07:48:25,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990020158] [2021-06-05 07:48:25,631 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 07:48:25,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:48:25,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 07:48:25,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2021-06-05 07:48:25,631 INFO L87 Difference]: Start difference. First operand 67998 states and 279761 transitions. Second operand has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:27,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:27,223 INFO L93 Difference]: Finished difference Result 72116 states and 294023 transitions. [2021-06-05 07:48:27,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 07:48:27,223 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:48:27,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:27,395 INFO L225 Difference]: With dead ends: 72116 [2021-06-05 07:48:27,396 INFO L226 Difference]: Without dead ends: 69764 [2021-06-05 07:48:27,396 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1297.2ms TimeCoverageRelationStatistics Valid=204, Invalid=1518, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 07:48:27,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69764 states. [2021-06-05 07:48:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69764 to 66725. [2021-06-05 07:48:28,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66725 states, 66724 states have (on average 4.102661710928602) internal successors, (273746), 66724 states have internal predecessors, (273746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66725 states to 66725 states and 273746 transitions. [2021-06-05 07:48:29,128 INFO L78 Accepts]: Start accepts. Automaton has 66725 states and 273746 transitions. Word has length 74 [2021-06-05 07:48:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:29,128 INFO L482 AbstractCegarLoop]: Abstraction has 66725 states and 273746 transitions. [2021-06-05 07:48:29,128 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:29,128 INFO L276 IsEmpty]: Start isEmpty. Operand 66725 states and 273746 transitions. [2021-06-05 07:48:29,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:48:29,194 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:29,194 INFO L521 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] [2021-06-05 07:48:29,194 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 07:48:29,194 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:29,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:29,195 INFO L82 PathProgramCache]: Analyzing trace with hash -254694524, now seen corresponding path program 4 times [2021-06-05 07:48:29,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:29,195 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733493273] [2021-06-05 07:48:29,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:48:29,398 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:48:29,398 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733493273] [2021-06-05 07:48:29,398 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733493273] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:48:29,398 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:48:29,398 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 07:48:29,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186175674] [2021-06-05 07:48:29,398 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 07:48:29,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:48:29,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 07:48:29,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-06-05 07:48:29,399 INFO L87 Difference]: Start difference. First operand 66725 states and 273746 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:30,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:30,546 INFO L93 Difference]: Finished difference Result 73964 states and 300363 transitions. [2021-06-05 07:48:30,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 07:48:30,547 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:48:30,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:30,763 INFO L225 Difference]: With dead ends: 73964 [2021-06-05 07:48:30,763 INFO L226 Difference]: Without dead ends: 71468 [2021-06-05 07:48:30,764 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 385.3ms TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2021-06-05 07:48:30,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71468 states. [2021-06-05 07:48:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71468 to 64843. [2021-06-05 07:48:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64843 states, 64842 states have (on average 4.109990438296166) internal successors, (266500), 64842 states have internal predecessors, (266500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64843 states to 64843 states and 266500 transitions. [2021-06-05 07:48:32,226 INFO L78 Accepts]: Start accepts. Automaton has 64843 states and 266500 transitions. Word has length 74 [2021-06-05 07:48:32,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:32,227 INFO L482 AbstractCegarLoop]: Abstraction has 64843 states and 266500 transitions. [2021-06-05 07:48:32,227 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:32,227 INFO L276 IsEmpty]: Start isEmpty. Operand 64843 states and 266500 transitions. [2021-06-05 07:48:32,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:48:32,291 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:32,291 INFO L521 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] [2021-06-05 07:48:32,291 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 07:48:32,291 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:32,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:32,291 INFO L82 PathProgramCache]: Analyzing trace with hash -6480265, now seen corresponding path program 7 times [2021-06-05 07:48:32,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:32,291 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461774571] [2021-06-05 07:48:32,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:32,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:48:32,507 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:48:32,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461774571] [2021-06-05 07:48:32,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461774571] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:48:32,507 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:48:32,508 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 07:48:32,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912418221] [2021-06-05 07:48:32,508 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 07:48:32,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:48:32,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 07:48:32,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-06-05 07:48:32,508 INFO L87 Difference]: Start difference. First operand 64843 states and 266500 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:33,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:33,622 INFO L93 Difference]: Finished difference Result 69741 states and 283968 transitions. [2021-06-05 07:48:33,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 07:48:33,623 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:48:33,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:33,802 INFO L225 Difference]: With dead ends: 69741 [2021-06-05 07:48:33,803 INFO L226 Difference]: Without dead ends: 67299 [2021-06-05 07:48:33,803 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 358.5ms TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2021-06-05 07:48:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67299 states. [2021-06-05 07:48:35,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67299 to 64843. [2021-06-05 07:48:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64843 states, 64842 states have (on average 4.109990438296166) internal successors, (266500), 64842 states have internal predecessors, (266500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64843 states to 64843 states and 266500 transitions. [2021-06-05 07:48:35,267 INFO L78 Accepts]: Start accepts. Automaton has 64843 states and 266500 transitions. Word has length 74 [2021-06-05 07:48:35,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:35,268 INFO L482 AbstractCegarLoop]: Abstraction has 64843 states and 266500 transitions. [2021-06-05 07:48:35,268 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 64843 states and 266500 transitions. [2021-06-05 07:48:35,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:48:35,330 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:35,331 INFO L521 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] [2021-06-05 07:48:35,331 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-05 07:48:35,331 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:35,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:35,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1955871057, now seen corresponding path program 8 times [2021-06-05 07:48:35,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:35,331 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448772092] [2021-06-05 07:48:35,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:48:35,579 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:48:35,580 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448772092] [2021-06-05 07:48:35,580 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448772092] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:48:35,580 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:48:35,580 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 07:48:35,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187677247] [2021-06-05 07:48:35,580 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 07:48:35,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:48:35,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 07:48:35,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-06-05 07:48:35,581 INFO L87 Difference]: Start difference. First operand 64843 states and 266500 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:36,761 INFO L93 Difference]: Finished difference Result 68861 states and 278790 transitions. [2021-06-05 07:48:36,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 07:48:36,761 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:48:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:36,941 INFO L225 Difference]: With dead ends: 68861 [2021-06-05 07:48:36,941 INFO L226 Difference]: Without dead ends: 66419 [2021-06-05 07:48:36,941 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 384.5ms TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-06-05 07:48:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66419 states. [2021-06-05 07:48:38,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66419 to 62864. [2021-06-05 07:48:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62864 states, 62863 states have (on average 4.088732640822105) internal successors, (257030), 62863 states have internal predecessors, (257030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62864 states to 62864 states and 257030 transitions. [2021-06-05 07:48:38,404 INFO L78 Accepts]: Start accepts. Automaton has 62864 states and 257030 transitions. Word has length 74 [2021-06-05 07:48:38,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:38,404 INFO L482 AbstractCegarLoop]: Abstraction has 62864 states and 257030 transitions. [2021-06-05 07:48:38,404 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:38,404 INFO L276 IsEmpty]: Start isEmpty. Operand 62864 states and 257030 transitions. [2021-06-05 07:48:38,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:48:38,464 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:38,464 INFO L521 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] [2021-06-05 07:48:38,464 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-05 07:48:38,465 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:38,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:38,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1508784086, now seen corresponding path program 5 times [2021-06-05 07:48:38,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:38,465 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124038541] [2021-06-05 07:48:38,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:48:38,642 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:48:38,642 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124038541] [2021-06-05 07:48:38,642 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124038541] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:48:38,642 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:48:38,642 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 07:48:38,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644971679] [2021-06-05 07:48:38,642 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 07:48:38,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:48:38,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 07:48:38,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 07:48:38,643 INFO L87 Difference]: Start difference. First operand 62864 states and 257030 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:39,691 INFO L93 Difference]: Finished difference Result 63082 states and 256575 transitions. [2021-06-05 07:48:39,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 07:48:39,692 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:48:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:39,851 INFO L225 Difference]: With dead ends: 63082 [2021-06-05 07:48:39,852 INFO L226 Difference]: Without dead ends: 60586 [2021-06-05 07:48:39,852 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 287.8ms TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-06-05 07:48:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60586 states. [2021-06-05 07:48:41,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60586 to 58100. [2021-06-05 07:48:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58100 states, 58099 states have (on average 4.112549269350591) internal successors, (238935), 58099 states have internal predecessors, (238935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58100 states to 58100 states and 238935 transitions. [2021-06-05 07:48:41,230 INFO L78 Accepts]: Start accepts. Automaton has 58100 states and 238935 transitions. Word has length 74 [2021-06-05 07:48:41,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:41,230 INFO L482 AbstractCegarLoop]: Abstraction has 58100 states and 238935 transitions. [2021-06-05 07:48:41,230 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:41,230 INFO L276 IsEmpty]: Start isEmpty. Operand 58100 states and 238935 transitions. [2021-06-05 07:48:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-05 07:48:41,285 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:41,285 INFO L521 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] [2021-06-05 07:48:41,285 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-05 07:48:41,285 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:41,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:41,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1313616915, now seen corresponding path program 1 times [2021-06-05 07:48:41,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:41,285 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90315579] [2021-06-05 07:48:41,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:48:41,405 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:48:41,405 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90315579] [2021-06-05 07:48:41,405 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90315579] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:48:41,405 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:48:41,405 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 07:48:41,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413846181] [2021-06-05 07:48:41,406 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 07:48:41,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:48:41,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 07:48:41,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-06-05 07:48:41,406 INFO L87 Difference]: Start difference. First operand 58100 states and 238935 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:41,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:41,887 INFO L93 Difference]: Finished difference Result 68834 states and 279215 transitions. [2021-06-05 07:48:41,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 07:48:41,888 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-06-05 07:48:41,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:42,419 INFO L225 Difference]: With dead ends: 68834 [2021-06-05 07:48:42,424 INFO L226 Difference]: Without dead ends: 56513 [2021-06-05 07:48:42,425 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 195.8ms TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2021-06-05 07:48:42,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56513 states. [2021-06-05 07:48:43,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56513 to 49781. [2021-06-05 07:48:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49781 states, 49780 states have (on average 4.071032543190036) internal successors, (202656), 49780 states have internal predecessors, (202656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49781 states to 49781 states and 202656 transitions. [2021-06-05 07:48:43,727 INFO L78 Accepts]: Start accepts. Automaton has 49781 states and 202656 transitions. Word has length 75 [2021-06-05 07:48:43,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:43,728 INFO L482 AbstractCegarLoop]: Abstraction has 49781 states and 202656 transitions. [2021-06-05 07:48:43,728 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:43,728 INFO L276 IsEmpty]: Start isEmpty. Operand 49781 states and 202656 transitions. [2021-06-05 07:48:43,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-05 07:48:43,781 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:43,781 INFO L521 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] [2021-06-05 07:48:43,782 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-05 07:48:43,782 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:43,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:43,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1333925235, now seen corresponding path program 1 times [2021-06-05 07:48:43,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:43,782 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839751672] [2021-06-05 07:48:43,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:48:43,855 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:48:43,855 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839751672] [2021-06-05 07:48:43,855 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839751672] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:48:43,855 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:48:43,855 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 07:48:43,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300597895] [2021-06-05 07:48:43,855 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 07:48:43,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:48:43,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 07:48:43,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-06-05 07:48:43,856 INFO L87 Difference]: Start difference. First operand 49781 states and 202656 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:44,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:44,343 INFO L93 Difference]: Finished difference Result 63188 states and 255322 transitions. [2021-06-05 07:48:44,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 07:48:44,343 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-06-05 07:48:44,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:44,472 INFO L225 Difference]: With dead ends: 63188 [2021-06-05 07:48:44,472 INFO L226 Difference]: Without dead ends: 53153 [2021-06-05 07:48:44,473 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 141.8ms TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2021-06-05 07:48:44,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53153 states. [2021-06-05 07:48:45,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53153 to 45767. [2021-06-05 07:48:45,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45767 states, 45766 states have (on average 4.058362102871127) internal successors, (185735), 45766 states have internal predecessors, (185735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45767 states to 45767 states and 185735 transitions. [2021-06-05 07:48:45,619 INFO L78 Accepts]: Start accepts. Automaton has 45767 states and 185735 transitions. Word has length 75 [2021-06-05 07:48:45,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:45,619 INFO L482 AbstractCegarLoop]: Abstraction has 45767 states and 185735 transitions. [2021-06-05 07:48:45,619 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 45767 states and 185735 transitions. [2021-06-05 07:48:45,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-05 07:48:45,665 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:45,665 INFO L521 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] [2021-06-05 07:48:45,665 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-05 07:48:45,665 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:45,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:45,665 INFO L82 PathProgramCache]: Analyzing trace with hash -606793233, now seen corresponding path program 2 times [2021-06-05 07:48:45,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:45,666 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619106714] [2021-06-05 07:48:45,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:48:45,754 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:48:45,754 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619106714] [2021-06-05 07:48:45,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619106714] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:48:45,755 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:48:45,755 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 07:48:45,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004630830] [2021-06-05 07:48:45,755 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 07:48:45,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:48:45,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 07:48:45,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-06-05 07:48:45,755 INFO L87 Difference]: Start difference. First operand 45767 states and 185735 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:46,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:46,608 INFO L93 Difference]: Finished difference Result 51725 states and 208645 transitions. [2021-06-05 07:48:46,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 07:48:46,609 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-06-05 07:48:46,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:46,720 INFO L225 Difference]: With dead ends: 51725 [2021-06-05 07:48:46,721 INFO L226 Difference]: Without dead ends: 45335 [2021-06-05 07:48:46,721 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 215.5ms TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2021-06-05 07:48:46,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45335 states. [2021-06-05 07:48:47,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45335 to 42692. [2021-06-05 07:48:47,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42692 states, 42691 states have (on average 4.06488487034738) internal successors, (173534), 42691 states have internal predecessors, (173534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42692 states to 42692 states and 173534 transitions. [2021-06-05 07:48:47,882 INFO L78 Accepts]: Start accepts. Automaton has 42692 states and 173534 transitions. Word has length 75 [2021-06-05 07:48:47,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:47,883 INFO L482 AbstractCegarLoop]: Abstraction has 42692 states and 173534 transitions. [2021-06-05 07:48:47,883 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 42692 states and 173534 transitions. [2021-06-05 07:48:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 07:48:47,952 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:47,952 INFO L521 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] [2021-06-05 07:48:47,952 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-05 07:48:47,952 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:47,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:47,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1105775058, now seen corresponding path program 1 times [2021-06-05 07:48:47,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:47,953 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890709200] [2021-06-05 07:48:47,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:48:48,694 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:48:48,694 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890709200] [2021-06-05 07:48:48,694 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890709200] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:48:48,694 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:48:48,694 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 07:48:48,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403813453] [2021-06-05 07:48:48,694 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 07:48:48,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:48:48,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 07:48:48,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2021-06-05 07:48:48,695 INFO L87 Difference]: Start difference. First operand 42692 states and 173534 transitions. Second operand has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:51,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:51,168 INFO L93 Difference]: Finished difference Result 56509 states and 230317 transitions. [2021-06-05 07:48:51,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 07:48:51,169 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-06-05 07:48:51,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:51,302 INFO L225 Difference]: With dead ends: 56509 [2021-06-05 07:48:51,303 INFO L226 Difference]: Without dead ends: 55111 [2021-06-05 07:48:51,303 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1874.3ms TimeCoverageRelationStatistics Valid=255, Invalid=2295, Unknown=0, NotChecked=0, Total=2550 [2021-06-05 07:48:51,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55111 states. [2021-06-05 07:48:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55111 to 48038. [2021-06-05 07:48:52,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48038 states, 48037 states have (on average 4.131440348065033) internal successors, (198462), 48037 states have internal predecessors, (198462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48038 states to 48038 states and 198462 transitions. [2021-06-05 07:48:52,413 INFO L78 Accepts]: Start accepts. Automaton has 48038 states and 198462 transitions. Word has length 77 [2021-06-05 07:48:52,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:52,413 INFO L482 AbstractCegarLoop]: Abstraction has 48038 states and 198462 transitions. [2021-06-05 07:48:52,413 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand 48038 states and 198462 transitions. [2021-06-05 07:48:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 07:48:52,470 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:52,470 INFO L521 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] [2021-06-05 07:48:52,470 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-05 07:48:52,470 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:52,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:52,470 INFO L82 PathProgramCache]: Analyzing trace with hash -136695074, now seen corresponding path program 2 times [2021-06-05 07:48:52,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:52,471 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121879709] [2021-06-05 07:48:52,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:48:52,970 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:48:52,970 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121879709] [2021-06-05 07:48:52,970 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121879709] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:48:52,970 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:48:52,970 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-06-05 07:48:52,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201878495] [2021-06-05 07:48:52,971 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 07:48:52,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:48:52,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 07:48:52,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2021-06-05 07:48:52,971 INFO L87 Difference]: Start difference. First operand 48038 states and 198462 transitions. Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:54,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:54,674 INFO L93 Difference]: Finished difference Result 44303 states and 180392 transitions. [2021-06-05 07:48:54,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 07:48:54,675 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-06-05 07:48:54,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:54,772 INFO L225 Difference]: With dead ends: 44303 [2021-06-05 07:48:54,773 INFO L226 Difference]: Without dead ends: 43043 [2021-06-05 07:48:54,773 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 978.1ms TimeCoverageRelationStatistics Valid=237, Invalid=1569, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 07:48:54,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43043 states. [2021-06-05 07:48:55,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43043 to 33407. [2021-06-05 07:48:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33407 states, 33406 states have (on average 4.022061905046997) internal successors, (134361), 33406 states have internal predecessors, (134361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33407 states to 33407 states and 134361 transitions. [2021-06-05 07:48:55,746 INFO L78 Accepts]: Start accepts. Automaton has 33407 states and 134361 transitions. Word has length 77 [2021-06-05 07:48:55,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:55,746 INFO L482 AbstractCegarLoop]: Abstraction has 33407 states and 134361 transitions. [2021-06-05 07:48:55,746 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 33407 states and 134361 transitions. [2021-06-05 07:48:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-05 07:48:55,793 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:55,793 INFO L521 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] [2021-06-05 07:48:55,793 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-05 07:48:55,793 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:55,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:55,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1211061915, now seen corresponding path program 1 times [2021-06-05 07:48:55,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:55,794 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570893226] [2021-06-05 07:48:55,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:48:56,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:48:56,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570893226] [2021-06-05 07:48:56,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570893226] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:48:56,582 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:48:56,582 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 07:48:56,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354917989] [2021-06-05 07:48:56,582 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 07:48:56,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:48:56,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 07:48:56,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2021-06-05 07:48:56,583 INFO L87 Difference]: Start difference. First operand 33407 states and 134361 transitions. Second operand has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:58,435 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2021-06-05 07:48:58,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:58,959 INFO L93 Difference]: Finished difference Result 29773 states and 118565 transitions. [2021-06-05 07:48:58,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-06-05 07:48:58,959 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-06-05 07:48:58,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:59,022 INFO L225 Difference]: With dead ends: 29773 [2021-06-05 07:48:59,023 INFO L226 Difference]: Without dead ends: 27685 [2021-06-05 07:48:59,023 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 1926.5ms TimeCoverageRelationStatistics Valid=264, Invalid=2286, Unknown=0, NotChecked=0, Total=2550 [2021-06-05 07:48:59,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27685 states. [2021-06-05 07:48:59,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27685 to 25523. [2021-06-05 07:48:59,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25523 states, 25522 states have (on average 3.9933390800094037) internal successors, (101918), 25522 states have internal predecessors, (101918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25523 states to 25523 states and 101918 transitions. [2021-06-05 07:48:59,492 INFO L78 Accepts]: Start accepts. Automaton has 25523 states and 101918 transitions. Word has length 79 [2021-06-05 07:48:59,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:59,493 INFO L482 AbstractCegarLoop]: Abstraction has 25523 states and 101918 transitions. [2021-06-05 07:48:59,493 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:48:59,493 INFO L276 IsEmpty]: Start isEmpty. Operand 25523 states and 101918 transitions. [2021-06-05 07:48:59,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-05 07:48:59,522 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:59,523 INFO L521 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] [2021-06-05 07:48:59,523 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-05 07:48:59,523 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:59,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:59,523 INFO L82 PathProgramCache]: Analyzing trace with hash 110108670, now seen corresponding path program 1 times [2021-06-05 07:48:59,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:59,523 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783960545] [2021-06-05 07:48:59,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:00,250 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-05 07:49:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:00,380 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:00,380 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783960545] [2021-06-05 07:49:00,380 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783960545] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:00,380 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:00,381 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 07:49:00,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616325193] [2021-06-05 07:49:00,381 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 07:49:00,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:00,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 07:49:00,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2021-06-05 07:49:00,381 INFO L87 Difference]: Start difference. First operand 25523 states and 101918 transitions. Second operand has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:02,562 INFO L93 Difference]: Finished difference Result 34270 states and 136437 transitions. [2021-06-05 07:49:02,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 07:49:02,562 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-06-05 07:49:02,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:02,631 INFO L225 Difference]: With dead ends: 34270 [2021-06-05 07:49:02,631 INFO L226 Difference]: Without dead ends: 30232 [2021-06-05 07:49:02,631 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1842.1ms TimeCoverageRelationStatistics Valid=254, Invalid=2296, Unknown=0, NotChecked=0, Total=2550 [2021-06-05 07:49:02,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30232 states. [2021-06-05 07:49:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30232 to 26090. [2021-06-05 07:49:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26090 states, 26089 states have (on average 4.030625934301813) internal successors, (105155), 26089 states have internal predecessors, (105155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26090 states to 26090 states and 105155 transitions. [2021-06-05 07:49:03,250 INFO L78 Accepts]: Start accepts. Automaton has 26090 states and 105155 transitions. Word has length 79 [2021-06-05 07:49:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:03,251 INFO L482 AbstractCegarLoop]: Abstraction has 26090 states and 105155 transitions. [2021-06-05 07:49:03,251 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 26090 states and 105155 transitions. [2021-06-05 07:49:03,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-05 07:49:03,282 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:03,282 INFO L521 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] [2021-06-05 07:49:03,282 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-05 07:49:03,282 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:03,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:03,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1046434652, now seen corresponding path program 2 times [2021-06-05 07:49:03,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:03,283 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721119129] [2021-06-05 07:49:03,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:03,950 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:03,950 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721119129] [2021-06-05 07:49:03,950 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721119129] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:03,950 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:03,950 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-06-05 07:49:03,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668803137] [2021-06-05 07:49:03,951 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 07:49:03,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:03,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 07:49:03,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2021-06-05 07:49:03,951 INFO L87 Difference]: Start difference. First operand 26090 states and 105155 transitions. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:05,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:05,348 INFO L93 Difference]: Finished difference Result 25967 states and 103470 transitions. [2021-06-05 07:49:05,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 07:49:05,348 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-06-05 07:49:05,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:05,393 INFO L225 Difference]: With dead ends: 25967 [2021-06-05 07:49:05,393 INFO L226 Difference]: Without dead ends: 21515 [2021-06-05 07:49:05,394 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1145.7ms TimeCoverageRelationStatistics Valid=229, Invalid=1663, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 07:49:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21515 states. [2021-06-05 07:49:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21515 to 17789. [2021-06-05 07:49:05,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17789 states, 17788 states have (on average 3.902912075556555) internal successors, (69425), 17788 states have internal predecessors, (69425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17789 states to 17789 states and 69425 transitions. [2021-06-05 07:49:05,711 INFO L78 Accepts]: Start accepts. Automaton has 17789 states and 69425 transitions. Word has length 79 [2021-06-05 07:49:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:05,712 INFO L482 AbstractCegarLoop]: Abstraction has 17789 states and 69425 transitions. [2021-06-05 07:49:05,712 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 17789 states and 69425 transitions. [2021-06-05 07:49:05,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 07:49:05,732 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:05,732 INFO L521 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] [2021-06-05 07:49:05,732 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-05 07:49:05,733 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:05,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:05,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1982652635, now seen corresponding path program 1 times [2021-06-05 07:49:05,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:05,734 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537398587] [2021-06-05 07:49:05,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:05,952 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:05,952 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537398587] [2021-06-05 07:49:05,952 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537398587] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:05,952 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:05,953 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 07:49:05,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41808873] [2021-06-05 07:49:05,953 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 07:49:05,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:05,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 07:49:05,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-06-05 07:49:05,953 INFO L87 Difference]: Start difference. First operand 17789 states and 69425 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:06,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:06,295 INFO L93 Difference]: Finished difference Result 19726 states and 75766 transitions. [2021-06-05 07:49:06,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 07:49:06,295 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 07:49:06,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:06,430 INFO L225 Difference]: With dead ends: 19726 [2021-06-05 07:49:06,431 INFO L226 Difference]: Without dead ends: 17781 [2021-06-05 07:49:06,431 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 261.0ms TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 07:49:06,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17781 states. [2021-06-05 07:49:06,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17781 to 17781. [2021-06-05 07:49:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17781 states, 17780 states have (on average 3.9037682789651296) internal successors, (69409), 17780 states have internal predecessors, (69409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17781 states to 17781 states and 69409 transitions. [2021-06-05 07:49:06,721 INFO L78 Accepts]: Start accepts. Automaton has 17781 states and 69409 transitions. Word has length 80 [2021-06-05 07:49:06,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:06,721 INFO L482 AbstractCegarLoop]: Abstraction has 17781 states and 69409 transitions. [2021-06-05 07:49:06,721 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:06,721 INFO L276 IsEmpty]: Start isEmpty. Operand 17781 states and 69409 transitions. [2021-06-05 07:49:06,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 07:49:06,743 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:06,743 INFO L521 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] [2021-06-05 07:49:06,743 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-05 07:49:06,743 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:06,744 INFO L82 PathProgramCache]: Analyzing trace with hash -268089029, now seen corresponding path program 2 times [2021-06-05 07:49:06,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:06,744 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885239582] [2021-06-05 07:49:06,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:07,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:07,266 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:07,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885239582] [2021-06-05 07:49:07,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885239582] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:07,266 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:07,266 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-05 07:49:07,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891659992] [2021-06-05 07:49:07,267 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 07:49:07,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:07,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 07:49:07,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-05 07:49:07,267 INFO L87 Difference]: Start difference. First operand 17781 states and 69409 transitions. Second operand has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:08,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:08,260 INFO L93 Difference]: Finished difference Result 19688 states and 75704 transitions. [2021-06-05 07:49:08,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 07:49:08,260 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 07:49:08,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:08,384 INFO L225 Difference]: With dead ends: 19688 [2021-06-05 07:49:08,385 INFO L226 Difference]: Without dead ends: 17781 [2021-06-05 07:49:08,385 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1012.1ms TimeCoverageRelationStatistics Valid=171, Invalid=1235, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 07:49:08,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17781 states. [2021-06-05 07:49:08,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17781 to 17781. [2021-06-05 07:49:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17781 states, 17780 states have (on average 3.90326209223847) internal successors, (69400), 17780 states have internal predecessors, (69400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17781 states to 17781 states and 69400 transitions. [2021-06-05 07:49:08,654 INFO L78 Accepts]: Start accepts. Automaton has 17781 states and 69400 transitions. Word has length 80 [2021-06-05 07:49:08,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:08,654 INFO L482 AbstractCegarLoop]: Abstraction has 17781 states and 69400 transitions. [2021-06-05 07:49:08,654 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 17781 states and 69400 transitions. [2021-06-05 07:49:08,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 07:49:08,675 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:08,675 INFO L521 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] [2021-06-05 07:49:08,675 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-05 07:49:08,675 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:08,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:08,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1802336639, now seen corresponding path program 3 times [2021-06-05 07:49:08,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:08,676 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9185096] [2021-06-05 07:49:08,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:09,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:09,157 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:09,157 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9185096] [2021-06-05 07:49:09,157 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9185096] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:09,157 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:09,157 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-05 07:49:09,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620910704] [2021-06-05 07:49:09,158 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 07:49:09,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:09,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 07:49:09,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-05 07:49:09,158 INFO L87 Difference]: Start difference. First operand 17781 states and 69400 transitions. Second operand has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:10,609 INFO L93 Difference]: Finished difference Result 19717 states and 75740 transitions. [2021-06-05 07:49:10,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 07:49:10,609 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 07:49:10,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:10,646 INFO L225 Difference]: With dead ends: 19717 [2021-06-05 07:49:10,646 INFO L226 Difference]: Without dead ends: 17831 [2021-06-05 07:49:10,646 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1281.2ms TimeCoverageRelationStatistics Valid=226, Invalid=1666, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 07:49:10,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17831 states. [2021-06-05 07:49:10,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17831 to 17781. [2021-06-05 07:49:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17781 states, 17780 states have (on average 3.9031496062992126) internal successors, (69398), 17780 states have internal predecessors, (69398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17781 states to 17781 states and 69398 transitions. [2021-06-05 07:49:10,930 INFO L78 Accepts]: Start accepts. Automaton has 17781 states and 69398 transitions. Word has length 80 [2021-06-05 07:49:10,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:10,930 INFO L482 AbstractCegarLoop]: Abstraction has 17781 states and 69398 transitions. [2021-06-05 07:49:10,930 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:10,930 INFO L276 IsEmpty]: Start isEmpty. Operand 17781 states and 69398 transitions. [2021-06-05 07:49:10,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 07:49:10,951 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:10,951 INFO L521 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] [2021-06-05 07:49:10,951 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-05 07:49:10,951 INFO L430 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:10,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:10,952 INFO L82 PathProgramCache]: Analyzing trace with hash 210872567, now seen corresponding path program 4 times [2021-06-05 07:49:10,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:10,952 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643491617] [2021-06-05 07:49:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:11,302 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:11,302 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643491617] [2021-06-05 07:49:11,302 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643491617] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:11,302 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:11,302 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-05 07:49:11,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201298937] [2021-06-05 07:49:11,302 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 07:49:11,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:11,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 07:49:11,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-05 07:49:11,303 INFO L87 Difference]: Start difference. First operand 17781 states and 69398 transitions. Second operand has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:12,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:12,180 INFO L93 Difference]: Finished difference Result 19662 states and 75647 transitions. [2021-06-05 07:49:12,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 07:49:12,180 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 07:49:12,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:12,217 INFO L225 Difference]: With dead ends: 19662 [2021-06-05 07:49:12,217 INFO L226 Difference]: Without dead ends: 17781 [2021-06-05 07:49:12,218 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 635.4ms TimeCoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 07:49:12,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17781 states. [2021-06-05 07:49:12,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17781 to 17781. [2021-06-05 07:49:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17781 states, 17780 states have (on average 3.9021372328458943) internal successors, (69380), 17780 states have internal predecessors, (69380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17781 states to 17781 states and 69380 transitions. [2021-06-05 07:49:12,572 INFO L78 Accepts]: Start accepts. Automaton has 17781 states and 69380 transitions. Word has length 80 [2021-06-05 07:49:12,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:12,572 INFO L482 AbstractCegarLoop]: Abstraction has 17781 states and 69380 transitions. [2021-06-05 07:49:12,572 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:12,572 INFO L276 IsEmpty]: Start isEmpty. Operand 17781 states and 69380 transitions. [2021-06-05 07:49:12,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 07:49:12,593 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:12,593 INFO L521 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] [2021-06-05 07:49:12,593 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-05 07:49:12,593 INFO L430 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:12,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:12,593 INFO L82 PathProgramCache]: Analyzing trace with hash 379667429, now seen corresponding path program 5 times [2021-06-05 07:49:12,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:12,593 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48660614] [2021-06-05 07:49:12,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:13,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:13,037 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:13,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48660614] [2021-06-05 07:49:13,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48660614] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:13,037 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:13,037 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-05 07:49:13,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425740200] [2021-06-05 07:49:13,038 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 07:49:13,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:13,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 07:49:13,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-06-05 07:49:13,038 INFO L87 Difference]: Start difference. First operand 17781 states and 69380 transitions. Second operand has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:14,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:14,115 INFO L93 Difference]: Finished difference Result 19649 states and 75620 transitions. [2021-06-05 07:49:14,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 07:49:14,115 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 07:49:14,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:14,152 INFO L225 Difference]: With dead ends: 19649 [2021-06-05 07:49:14,152 INFO L226 Difference]: Without dead ends: 17813 [2021-06-05 07:49:14,152 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 840.1ms TimeCoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 07:49:14,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17813 states. [2021-06-05 07:49:14,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17813 to 17781. [2021-06-05 07:49:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17781 states, 17780 states have (on average 3.900337457817773) internal successors, (69348), 17780 states have internal predecessors, (69348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:14,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17781 states to 17781 states and 69348 transitions. [2021-06-05 07:49:14,518 INFO L78 Accepts]: Start accepts. Automaton has 17781 states and 69348 transitions. Word has length 80 [2021-06-05 07:49:14,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:14,518 INFO L482 AbstractCegarLoop]: Abstraction has 17781 states and 69348 transitions. [2021-06-05 07:49:14,518 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 17781 states and 69348 transitions. [2021-06-05 07:49:14,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 07:49:14,540 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:14,540 INFO L521 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] [2021-06-05 07:49:14,540 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-05 07:49:14,540 INFO L430 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:14,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1272369107, now seen corresponding path program 6 times [2021-06-05 07:49:14,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:14,540 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551756660] [2021-06-05 07:49:14,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:15,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:15,077 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:15,077 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551756660] [2021-06-05 07:49:15,077 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551756660] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:15,078 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:15,078 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-05 07:49:15,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244337204] [2021-06-05 07:49:15,078 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 07:49:15,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:15,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 07:49:15,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2021-06-05 07:49:15,078 INFO L87 Difference]: Start difference. First operand 17781 states and 69348 transitions. Second operand has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:16,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:16,161 INFO L93 Difference]: Finished difference Result 19405 states and 74898 transitions. [2021-06-05 07:49:16,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 07:49:16,161 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 07:49:16,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:16,198 INFO L225 Difference]: With dead ends: 19405 [2021-06-05 07:49:16,198 INFO L226 Difference]: Without dead ends: 17781 [2021-06-05 07:49:16,198 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 948.8ms TimeCoverageRelationStatistics Valid=231, Invalid=1661, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 07:49:16,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17781 states. [2021-06-05 07:49:16,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17781 to 17781. [2021-06-05 07:49:16,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17781 states, 17780 states have (on average 3.89673790776153) internal successors, (69284), 17780 states have internal predecessors, (69284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17781 states to 17781 states and 69284 transitions. [2021-06-05 07:49:16,574 INFO L78 Accepts]: Start accepts. Automaton has 17781 states and 69284 transitions. Word has length 80 [2021-06-05 07:49:16,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:16,575 INFO L482 AbstractCegarLoop]: Abstraction has 17781 states and 69284 transitions. [2021-06-05 07:49:16,575 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:16,575 INFO L276 IsEmpty]: Start isEmpty. Operand 17781 states and 69284 transitions. [2021-06-05 07:49:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 07:49:16,596 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:16,596 INFO L521 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] [2021-06-05 07:49:16,596 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-05 07:49:16,596 INFO L430 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:16,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:16,596 INFO L82 PathProgramCache]: Analyzing trace with hash 154953031, now seen corresponding path program 7 times [2021-06-05 07:49:16,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:16,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730525429] [2021-06-05 07:49:16,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:17,172 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:17,172 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730525429] [2021-06-05 07:49:17,172 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730525429] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:17,172 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:17,172 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 07:49:17,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709256128] [2021-06-05 07:49:17,172 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 07:49:17,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:17,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 07:49:17,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-06-05 07:49:17,173 INFO L87 Difference]: Start difference. First operand 17781 states and 69284 transitions. Second operand has 26 states, 26 states have (on average 3.076923076923077) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:18,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:18,533 INFO L93 Difference]: Finished difference Result 19341 states and 74562 transitions. [2021-06-05 07:49:18,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 07:49:18,533 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.076923076923077) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 07:49:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:18,559 INFO L225 Difference]: With dead ends: 19341 [2021-06-05 07:49:18,559 INFO L226 Difference]: Without dead ends: 12909 [2021-06-05 07:49:18,560 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1126.2ms TimeCoverageRelationStatistics Valid=240, Invalid=1922, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 07:49:18,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12909 states. [2021-06-05 07:49:18,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12909 to 12909. [2021-06-05 07:49:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12909 states, 12908 states have (on average 3.6977068484660673) internal successors, (47730), 12908 states have internal predecessors, (47730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12909 states to 12909 states and 47730 transitions. [2021-06-05 07:49:18,751 INFO L78 Accepts]: Start accepts. Automaton has 12909 states and 47730 transitions. Word has length 80 [2021-06-05 07:49:18,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:18,751 INFO L482 AbstractCegarLoop]: Abstraction has 12909 states and 47730 transitions. [2021-06-05 07:49:18,751 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 3.076923076923077) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:18,751 INFO L276 IsEmpty]: Start isEmpty. Operand 12909 states and 47730 transitions. [2021-06-05 07:49:18,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 07:49:18,763 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:18,763 INFO L521 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] [2021-06-05 07:49:18,763 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-05 07:49:18,763 INFO L430 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:18,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:18,763 INFO L82 PathProgramCache]: Analyzing trace with hash -11684839, now seen corresponding path program 8 times [2021-06-05 07:49:18,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:18,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824880994] [2021-06-05 07:49:18,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:19,305 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:19,305 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824880994] [2021-06-05 07:49:19,306 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824880994] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:19,306 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:19,306 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-05 07:49:19,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566217006] [2021-06-05 07:49:19,306 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 07:49:19,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:19,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 07:49:19,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2021-06-05 07:49:19,306 INFO L87 Difference]: Start difference. First operand 12909 states and 47730 transitions. Second operand has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:20,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:20,425 INFO L93 Difference]: Finished difference Result 14629 states and 53556 transitions. [2021-06-05 07:49:20,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 07:49:20,425 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 07:49:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:20,450 INFO L225 Difference]: With dead ends: 14629 [2021-06-05 07:49:20,450 INFO L226 Difference]: Without dead ends: 12909 [2021-06-05 07:49:20,451 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1016.1ms TimeCoverageRelationStatistics Valid=244, Invalid=1736, Unknown=0, NotChecked=0, Total=1980 [2021-06-05 07:49:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12909 states. [2021-06-05 07:49:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12909 to 12909. [2021-06-05 07:49:20,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12909 states, 12908 states have (on average 3.6958475364115277) internal successors, (47706), 12908 states have internal predecessors, (47706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12909 states to 12909 states and 47706 transitions. [2021-06-05 07:49:20,641 INFO L78 Accepts]: Start accepts. Automaton has 12909 states and 47706 transitions. Word has length 80 [2021-06-05 07:49:20,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:20,641 INFO L482 AbstractCegarLoop]: Abstraction has 12909 states and 47706 transitions. [2021-06-05 07:49:20,641 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 12909 states and 47706 transitions. [2021-06-05 07:49:20,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 07:49:20,652 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:20,653 INFO L521 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] [2021-06-05 07:49:20,653 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-05 07:49:20,653 INFO L430 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:20,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:20,653 INFO L82 PathProgramCache]: Analyzing trace with hash -21546859, now seen corresponding path program 9 times [2021-06-05 07:49:20,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:20,653 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440544735] [2021-06-05 07:49:20,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:20,895 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:20,895 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440544735] [2021-06-05 07:49:20,895 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440544735] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:20,895 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:20,896 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 07:49:20,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713725594] [2021-06-05 07:49:20,896 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 07:49:20,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:20,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 07:49:20,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-06-05 07:49:20,896 INFO L87 Difference]: Start difference. First operand 12909 states and 47706 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:21,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:21,418 INFO L93 Difference]: Finished difference Result 14817 states and 54002 transitions. [2021-06-05 07:49:21,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 07:49:21,418 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 07:49:21,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:21,442 INFO L225 Difference]: With dead ends: 14817 [2021-06-05 07:49:21,443 INFO L226 Difference]: Without dead ends: 12909 [2021-06-05 07:49:21,443 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 405.9ms TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2021-06-05 07:49:21,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12909 states. [2021-06-05 07:49:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12909 to 12909. [2021-06-05 07:49:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12909 states, 12908 states have (on average 3.695770065075922) internal successors, (47705), 12908 states have internal predecessors, (47705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12909 states to 12909 states and 47705 transitions. [2021-06-05 07:49:21,628 INFO L78 Accepts]: Start accepts. Automaton has 12909 states and 47705 transitions. Word has length 80 [2021-06-05 07:49:21,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:21,629 INFO L482 AbstractCegarLoop]: Abstraction has 12909 states and 47705 transitions. [2021-06-05 07:49:21,629 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:21,629 INFO L276 IsEmpty]: Start isEmpty. Operand 12909 states and 47705 transitions. [2021-06-05 07:49:21,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 07:49:21,640 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:21,641 INFO L521 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] [2021-06-05 07:49:21,641 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-06-05 07:49:21,641 INFO L430 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:21,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:21,641 INFO L82 PathProgramCache]: Analyzing trace with hash 209799151, now seen corresponding path program 10 times [2021-06-05 07:49:21,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:21,641 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770186207] [2021-06-05 07:49:21,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:21,927 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:21,927 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770186207] [2021-06-05 07:49:21,927 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770186207] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:21,927 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:21,927 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 07:49:21,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806315499] [2021-06-05 07:49:21,928 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 07:49:21,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:21,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 07:49:21,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-06-05 07:49:21,928 INFO L87 Difference]: Start difference. First operand 12909 states and 47705 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:22,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:22,458 INFO L93 Difference]: Finished difference Result 11693 states and 41783 transitions. [2021-06-05 07:49:22,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 07:49:22,459 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 07:49:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:22,476 INFO L225 Difference]: With dead ends: 11693 [2021-06-05 07:49:22,476 INFO L226 Difference]: Without dead ends: 9756 [2021-06-05 07:49:22,476 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 420.9ms TimeCoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2021-06-05 07:49:22,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9756 states. [2021-06-05 07:49:22,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9756 to 9756. [2021-06-05 07:49:22,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9756 states, 9755 states have (on average 3.6302409021014865) internal successors, (35413), 9755 states have internal predecessors, (35413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9756 states to 9756 states and 35413 transitions. [2021-06-05 07:49:22,618 INFO L78 Accepts]: Start accepts. Automaton has 9756 states and 35413 transitions. Word has length 80 [2021-06-05 07:49:22,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:22,618 INFO L482 AbstractCegarLoop]: Abstraction has 9756 states and 35413 transitions. [2021-06-05 07:49:22,619 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 9756 states and 35413 transitions. [2021-06-05 07:49:22,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 07:49:22,629 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:22,629 INFO L521 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] [2021-06-05 07:49:22,629 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-06-05 07:49:22,629 INFO L430 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:22,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:22,629 INFO L82 PathProgramCache]: Analyzing trace with hash -516051826, now seen corresponding path program 1 times [2021-06-05 07:49:22,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:22,630 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914428480] [2021-06-05 07:49:22,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:22,969 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:22,969 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914428480] [2021-06-05 07:49:22,969 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914428480] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:22,969 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:22,969 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-05 07:49:22,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081654395] [2021-06-05 07:49:22,969 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 07:49:22,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:22,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 07:49:22,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 07:49:22,970 INFO L87 Difference]: Start difference. First operand 9756 states and 35413 transitions. Second operand has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:23,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:23,671 INFO L93 Difference]: Finished difference Result 11478 states and 41516 transitions. [2021-06-05 07:49:23,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 07:49:23,671 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 07:49:23,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:23,691 INFO L225 Difference]: With dead ends: 11478 [2021-06-05 07:49:23,692 INFO L226 Difference]: Without dead ends: 10686 [2021-06-05 07:49:23,692 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 597.7ms TimeCoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 07:49:23,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10686 states. [2021-06-05 07:49:23,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10686 to 9798. [2021-06-05 07:49:23,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9798 states, 9797 states have (on average 3.6236603041747473) internal successors, (35501), 9797 states have internal predecessors, (35501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9798 states to 9798 states and 35501 transitions. [2021-06-05 07:49:23,859 INFO L78 Accepts]: Start accepts. Automaton has 9798 states and 35501 transitions. Word has length 82 [2021-06-05 07:49:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:23,859 INFO L482 AbstractCegarLoop]: Abstraction has 9798 states and 35501 transitions. [2021-06-05 07:49:23,859 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:23,859 INFO L276 IsEmpty]: Start isEmpty. Operand 9798 states and 35501 transitions. [2021-06-05 07:49:23,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 07:49:23,869 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:23,869 INFO L521 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] [2021-06-05 07:49:23,869 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-06-05 07:49:23,869 INFO L430 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:23,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:23,870 INFO L82 PathProgramCache]: Analyzing trace with hash 513616482, now seen corresponding path program 1 times [2021-06-05 07:49:23,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:23,870 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232738069] [2021-06-05 07:49:23,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:24,242 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:24,242 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232738069] [2021-06-05 07:49:24,242 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232738069] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:24,242 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:24,242 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 07:49:24,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074087433] [2021-06-05 07:49:24,242 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 07:49:24,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:24,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 07:49:24,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-05 07:49:24,243 INFO L87 Difference]: Start difference. First operand 9798 states and 35501 transitions. Second operand has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:24,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:24,989 INFO L93 Difference]: Finished difference Result 10512 states and 37844 transitions. [2021-06-05 07:49:24,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 07:49:24,989 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 07:49:24,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:25,006 INFO L225 Difference]: With dead ends: 10512 [2021-06-05 07:49:25,006 INFO L226 Difference]: Without dead ends: 9744 [2021-06-05 07:49:25,012 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 672.5ms TimeCoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 07:49:25,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9744 states. [2021-06-05 07:49:25,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9744 to 9744. [2021-06-05 07:49:25,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9744 states, 9743 states have (on average 3.631427691676075) internal successors, (35381), 9743 states have internal predecessors, (35381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9744 states to 9744 states and 35381 transitions. [2021-06-05 07:49:25,148 INFO L78 Accepts]: Start accepts. Automaton has 9744 states and 35381 transitions. Word has length 82 [2021-06-05 07:49:25,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:25,148 INFO L482 AbstractCegarLoop]: Abstraction has 9744 states and 35381 transitions. [2021-06-05 07:49:25,148 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 9744 states and 35381 transitions. [2021-06-05 07:49:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 07:49:25,158 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:25,159 INFO L521 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] [2021-06-05 07:49:25,159 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-06-05 07:49:25,159 INFO L430 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:25,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:25,159 INFO L82 PathProgramCache]: Analyzing trace with hash -757365558, now seen corresponding path program 2 times [2021-06-05 07:49:25,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:25,159 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705496366] [2021-06-05 07:49:25,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:25,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:25,505 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:25,505 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705496366] [2021-06-05 07:49:25,505 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705496366] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:25,505 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:25,505 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-05 07:49:25,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951450496] [2021-06-05 07:49:25,505 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 07:49:25,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:25,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 07:49:25,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 07:49:25,506 INFO L87 Difference]: Start difference. First operand 9744 states and 35381 transitions. Second operand has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:26,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:26,242 INFO L93 Difference]: Finished difference Result 11475 states and 41508 transitions. [2021-06-05 07:49:26,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 07:49:26,242 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 07:49:26,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:26,263 INFO L225 Difference]: With dead ends: 11475 [2021-06-05 07:49:26,263 INFO L226 Difference]: Without dead ends: 10683 [2021-06-05 07:49:26,263 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 607.7ms TimeCoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 07:49:26,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10683 states. [2021-06-05 07:49:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10683 to 9795. [2021-06-05 07:49:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9795 states, 9794 states have (on average 3.6239534408821727) internal successors, (35493), 9794 states have internal predecessors, (35493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9795 states to 9795 states and 35493 transitions. [2021-06-05 07:49:26,445 INFO L78 Accepts]: Start accepts. Automaton has 9795 states and 35493 transitions. Word has length 82 [2021-06-05 07:49:26,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:26,445 INFO L482 AbstractCegarLoop]: Abstraction has 9795 states and 35493 transitions. [2021-06-05 07:49:26,445 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:26,446 INFO L276 IsEmpty]: Start isEmpty. Operand 9795 states and 35493 transitions. [2021-06-05 07:49:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 07:49:26,456 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:26,457 INFO L521 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] [2021-06-05 07:49:26,457 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-06-05 07:49:26,457 INFO L430 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:26,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:26,457 INFO L82 PathProgramCache]: Analyzing trace with hash 272302750, now seen corresponding path program 2 times [2021-06-05 07:49:26,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:26,457 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029085512] [2021-06-05 07:49:26,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:26,829 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:26,829 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029085512] [2021-06-05 07:49:26,829 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029085512] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:26,829 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:26,829 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 07:49:26,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144059157] [2021-06-05 07:49:26,830 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 07:49:26,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:26,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 07:49:26,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-05 07:49:26,830 INFO L87 Difference]: Start difference. First operand 9795 states and 35493 transitions. Second operand has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:27,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:27,640 INFO L93 Difference]: Finished difference Result 10509 states and 37836 transitions. [2021-06-05 07:49:27,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 07:49:27,640 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 07:49:27,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:27,658 INFO L225 Difference]: With dead ends: 10509 [2021-06-05 07:49:27,658 INFO L226 Difference]: Without dead ends: 9753 [2021-06-05 07:49:27,658 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 706.1ms TimeCoverageRelationStatistics Valid=142, Invalid=1118, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 07:49:27,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9753 states. [2021-06-05 07:49:27,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9753 to 9753. [2021-06-05 07:49:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9753 states, 9752 states have (on average 3.6302296964725183) internal successors, (35402), 9752 states have internal predecessors, (35402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:27,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9753 states to 9753 states and 35402 transitions. [2021-06-05 07:49:27,791 INFO L78 Accepts]: Start accepts. Automaton has 9753 states and 35402 transitions. Word has length 82 [2021-06-05 07:49:27,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:27,791 INFO L482 AbstractCegarLoop]: Abstraction has 9753 states and 35402 transitions. [2021-06-05 07:49:27,791 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:27,791 INFO L276 IsEmpty]: Start isEmpty. Operand 9753 states and 35402 transitions. [2021-06-05 07:49:27,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 07:49:27,801 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:27,801 INFO L521 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] [2021-06-05 07:49:27,801 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-06-05 07:49:27,801 INFO L430 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:27,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:27,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1446855762, now seen corresponding path program 3 times [2021-06-05 07:49:27,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:27,802 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312991553] [2021-06-05 07:49:27,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:28,453 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:28,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312991553] [2021-06-05 07:49:28,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312991553] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:28,453 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:28,453 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-06-05 07:49:28,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701082246] [2021-06-05 07:49:28,454 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 07:49:28,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:28,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 07:49:28,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2021-06-05 07:49:28,454 INFO L87 Difference]: Start difference. First operand 9753 states and 35402 transitions. Second operand has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:29,747 INFO L93 Difference]: Finished difference Result 11532 states and 41669 transitions. [2021-06-05 07:49:29,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 07:49:29,748 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 07:49:29,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:29,768 INFO L225 Difference]: With dead ends: 11532 [2021-06-05 07:49:29,768 INFO L226 Difference]: Without dead ends: 10740 [2021-06-05 07:49:29,768 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1319.4ms TimeCoverageRelationStatistics Valid=178, Invalid=1462, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 07:49:29,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10740 states. [2021-06-05 07:49:29,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10740 to 9837. [2021-06-05 07:49:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9837 states, 9836 states have (on average 3.6216958113054085) internal successors, (35623), 9836 states have internal predecessors, (35623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:29,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9837 states to 9837 states and 35623 transitions. [2021-06-05 07:49:29,939 INFO L78 Accepts]: Start accepts. Automaton has 9837 states and 35623 transitions. Word has length 82 [2021-06-05 07:49:29,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:29,939 INFO L482 AbstractCegarLoop]: Abstraction has 9837 states and 35623 transitions. [2021-06-05 07:49:29,939 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:29,939 INFO L276 IsEmpty]: Start isEmpty. Operand 9837 states and 35623 transitions. [2021-06-05 07:49:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 07:49:29,950 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:29,950 INFO L521 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] [2021-06-05 07:49:29,950 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-06-05 07:49:29,950 INFO L430 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:29,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:29,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1818443226, now seen corresponding path program 3 times [2021-06-05 07:49:29,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:29,951 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785769880] [2021-06-05 07:49:29,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:30,715 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:30,715 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785769880] [2021-06-05 07:49:30,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785769880] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:30,715 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:30,715 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-05 07:49:30,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010569693] [2021-06-05 07:49:30,715 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 07:49:30,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:30,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 07:49:30,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2021-06-05 07:49:30,716 INFO L87 Difference]: Start difference. First operand 9837 states and 35623 transitions. Second operand has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:32,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:32,174 INFO L93 Difference]: Finished difference Result 10566 states and 37997 transitions. [2021-06-05 07:49:32,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 07:49:32,174 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 07:49:32,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:32,193 INFO L225 Difference]: With dead ends: 10566 [2021-06-05 07:49:32,193 INFO L226 Difference]: Without dead ends: 9813 [2021-06-05 07:49:32,193 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1518.4ms TimeCoverageRelationStatistics Valid=184, Invalid=1622, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 07:49:32,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9813 states. [2021-06-05 07:49:32,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9813 to 9798. [2021-06-05 07:49:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9798 states, 9797 states have (on average 3.626110033683781) internal successors, (35525), 9797 states have internal predecessors, (35525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9798 states to 9798 states and 35525 transitions. [2021-06-05 07:49:32,360 INFO L78 Accepts]: Start accepts. Automaton has 9798 states and 35525 transitions. Word has length 82 [2021-06-05 07:49:32,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:32,360 INFO L482 AbstractCegarLoop]: Abstraction has 9798 states and 35525 transitions. [2021-06-05 07:49:32,360 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:32,360 INFO L276 IsEmpty]: Start isEmpty. Operand 9798 states and 35525 transitions. [2021-06-05 07:49:32,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 07:49:32,371 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:32,371 INFO L521 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] [2021-06-05 07:49:32,371 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-06-05 07:49:32,371 INFO L430 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:32,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:32,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1910438108, now seen corresponding path program 4 times [2021-06-05 07:49:32,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:32,372 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170511603] [2021-06-05 07:49:32,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:32,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:32,847 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:32,847 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170511603] [2021-06-05 07:49:32,847 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170511603] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:32,847 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:32,847 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-06-05 07:49:32,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136407218] [2021-06-05 07:49:32,847 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 07:49:32,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:32,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 07:49:32,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2021-06-05 07:49:32,848 INFO L87 Difference]: Start difference. First operand 9798 states and 35525 transitions. Second operand has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:33,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:33,963 INFO L93 Difference]: Finished difference Result 11496 states and 41579 transitions. [2021-06-05 07:49:33,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 07:49:33,964 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 07:49:33,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:33,983 INFO L225 Difference]: With dead ends: 11496 [2021-06-05 07:49:33,983 INFO L226 Difference]: Without dead ends: 10704 [2021-06-05 07:49:33,983 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 971.6ms TimeCoverageRelationStatistics Valid=204, Invalid=1436, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 07:49:34,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10704 states. [2021-06-05 07:49:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10704 to 9816. [2021-06-05 07:49:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9816 states, 9815 states have (on average 3.623433520122262) internal successors, (35564), 9815 states have internal predecessors, (35564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:34,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9816 states to 9816 states and 35564 transitions. [2021-06-05 07:49:34,122 INFO L78 Accepts]: Start accepts. Automaton has 9816 states and 35564 transitions. Word has length 82 [2021-06-05 07:49:34,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:34,123 INFO L482 AbstractCegarLoop]: Abstraction has 9816 states and 35564 transitions. [2021-06-05 07:49:34,123 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:34,123 INFO L276 IsEmpty]: Start isEmpty. Operand 9816 states and 35564 transitions. [2021-06-05 07:49:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 07:49:34,133 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:34,133 INFO L521 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] [2021-06-05 07:49:34,133 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-06-05 07:49:34,133 INFO L430 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:34,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:34,133 INFO L82 PathProgramCache]: Analyzing trace with hash -880769800, now seen corresponding path program 4 times [2021-06-05 07:49:34,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:34,133 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575142851] [2021-06-05 07:49:34,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:34,734 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:34,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575142851] [2021-06-05 07:49:34,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575142851] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:34,734 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:34,734 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-05 07:49:34,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403108077] [2021-06-05 07:49:34,734 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 07:49:34,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:34,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 07:49:34,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2021-06-05 07:49:34,735 INFO L87 Difference]: Start difference. First operand 9816 states and 35564 transitions. Second operand has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:35,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:35,907 INFO L93 Difference]: Finished difference Result 11232 states and 40212 transitions. [2021-06-05 07:49:35,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 07:49:35,907 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 07:49:35,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:35,926 INFO L225 Difference]: With dead ends: 11232 [2021-06-05 07:49:35,926 INFO L226 Difference]: Without dead ends: 9792 [2021-06-05 07:49:35,926 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1117.7ms TimeCoverageRelationStatistics Valid=196, Invalid=1526, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 07:49:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9792 states. [2021-06-05 07:49:36,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9792 to 9780. [2021-06-05 07:49:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9780 states, 9779 states have (on average 3.6183658860824215) internal successors, (35384), 9779 states have internal predecessors, (35384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9780 states to 9780 states and 35384 transitions. [2021-06-05 07:49:36,089 INFO L78 Accepts]: Start accepts. Automaton has 9780 states and 35384 transitions. Word has length 82 [2021-06-05 07:49:36,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:36,089 INFO L482 AbstractCegarLoop]: Abstraction has 9780 states and 35384 transitions. [2021-06-05 07:49:36,089 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 9780 states and 35384 transitions. [2021-06-05 07:49:36,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 07:49:36,099 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:36,100 INFO L521 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] [2021-06-05 07:49:36,100 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-06-05 07:49:36,100 INFO L430 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:36,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:36,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1652709930, now seen corresponding path program 5 times [2021-06-05 07:49:36,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:36,100 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509449431] [2021-06-05 07:49:36,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:36,717 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:36,717 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509449431] [2021-06-05 07:49:36,717 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509449431] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:36,717 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:36,717 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-06-05 07:49:36,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559550235] [2021-06-05 07:49:36,717 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 07:49:36,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:36,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 07:49:36,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2021-06-05 07:49:36,718 INFO L87 Difference]: Start difference. First operand 9780 states and 35384 transitions. Second operand has 25 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:38,106 INFO L93 Difference]: Finished difference Result 9768 states and 34793 transitions. [2021-06-05 07:49:38,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 07:49:38,107 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 07:49:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:38,121 INFO L225 Difference]: With dead ends: 9768 [2021-06-05 07:49:38,121 INFO L226 Difference]: Without dead ends: 7776 [2021-06-05 07:49:38,121 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1279.8ms TimeCoverageRelationStatistics Valid=249, Invalid=1913, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 07:49:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7776 states. [2021-06-05 07:49:38,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7776 to 7776. [2021-06-05 07:49:38,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7776 states, 7775 states have (on average 3.6109324758842445) internal successors, (28075), 7775 states have internal predecessors, (28075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7776 states to 7776 states and 28075 transitions. [2021-06-05 07:49:38,245 INFO L78 Accepts]: Start accepts. Automaton has 7776 states and 28075 transitions. Word has length 82 [2021-06-05 07:49:38,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:38,245 INFO L482 AbstractCegarLoop]: Abstraction has 7776 states and 28075 transitions. [2021-06-05 07:49:38,245 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:49:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 7776 states and 28075 transitions. [2021-06-05 07:49:38,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 07:49:38,252 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:38,253 INFO L521 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] [2021-06-05 07:49:38,253 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-06-05 07:49:38,253 INFO L430 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:38,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:38,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1530938248, now seen corresponding path program 6 times [2021-06-05 07:49:38,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:38,253 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481525129] [2021-06-05 07:49:38,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:38,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:38,960 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:38,960 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481525129] [2021-06-05 07:49:38,960 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481525129] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:38,960 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:38,960 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-05 07:49:38,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478858661] [2021-06-05 07:49:38,960 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 07:49:38,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:38,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 07:49:38,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2021-06-05 07:49:38,961 INFO L87 Difference]: Start difference. First operand 7776 states and 28075 transitions. Second operand has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)