/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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/qrcu-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-04 21:45:32,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-04 21:45:32,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-04 21:45:32,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-04 21:45:32,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-04 21:45:32,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-04 21:45:32,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-04 21:45:32,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-04 21:45:32,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-04 21:45:32,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-04 21:45:32,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-04 21:45:32,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-04 21:45:32,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-04 21:45:32,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-04 21:45:32,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-04 21:45:32,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-04 21:45:32,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-04 21:45:32,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-04 21:45:32,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-04 21:45:32,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-04 21:45:32,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-04 21:45:32,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-04 21:45:32,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-04 21:45:32,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-04 21:45:32,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-04 21:45:32,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-04 21:45:32,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-04 21:45:32,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-04 21:45:32,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-04 21:45:32,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-04 21:45:32,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-04 21:45:32,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-04 21:45:32,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-04 21:45:32,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-04 21:45:32,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-04 21:45:32,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-04 21:45:32,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-04 21:45:32,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-04 21:45:32,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-04 21:45:32,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-04 21:45:32,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-04 21:45:32,653 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.epf [2021-06-04 21:45:32,693 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-04 21:45:32,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-04 21:45:32,693 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-04 21:45:32,694 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-04 21:45:32,696 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-04 21:45:32,696 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-04 21:45:32,696 INFO L138 SettingsManager]: * Use SBE=true [2021-06-04 21:45:32,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-04 21:45:32,696 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-04 21:45:32,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-04 21:45:32,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-04 21:45:32,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-04 21:45:32,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-04 21:45:32,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-04 21:45:32,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-04 21:45:32,698 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-04 21:45:32,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-04 21:45:32,698 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-04 21:45:32,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-04 21:45:32,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-04 21:45:32,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-04 21:45:32,699 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-04 21:45:32,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-04 21:45:32,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-04 21:45:32,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-04 21:45:32,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-04 21:45:32,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-04 21:45:32,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-04 21:45:32,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-04 21:45:32,700 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-04 21:45:32,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-04 21:45:32,700 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-04 21:45:33,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-04 21:45:33,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-04 21:45:33,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-04 21:45:33,029 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-04 21:45:33,030 INFO L275 PluginConnector]: CDTParser initialized [2021-06-04 21:45:33,031 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2021-06-04 21:45:33,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd7395ad9/fd9007c618034b87827608dbca8bfeea/FLAG66095cedf [2021-06-04 21:45:33,606 INFO L306 CDTParser]: Found 1 translation units. [2021-06-04 21:45:33,606 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2021-06-04 21:45:33,620 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd7395ad9/fd9007c618034b87827608dbca8bfeea/FLAG66095cedf [2021-06-04 21:45:34,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd7395ad9/fd9007c618034b87827608dbca8bfeea [2021-06-04 21:45:34,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-04 21:45:34,078 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-04 21:45:34,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-04 21:45:34,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-04 21:45:34,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-04 21:45:34,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 09:45:34" (1/1) ... [2021-06-04 21:45:34,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@786c3487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:45:34, skipping insertion in model container [2021-06-04 21:45:34,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 09:45:34" (1/1) ... [2021-06-04 21:45:34,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-04 21:45:34,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-04 21:45:34,452 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-atomic/qrcu-1.i[30694,30707] [2021-06-04 21:45:34,457 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-atomic/qrcu-1.i[30916,30929] [2021-06-04 21:45:34,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-04 21:45:34,488 INFO L203 MainTranslator]: Completed pre-run [2021-06-04 21:45:34,526 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-atomic/qrcu-1.i[30694,30707] [2021-06-04 21:45:34,528 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-atomic/qrcu-1.i[30916,30929] [2021-06-04 21:45:34,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-04 21:45:34,628 INFO L208 MainTranslator]: Completed translation [2021-06-04 21:45:34,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:45:34 WrapperNode [2021-06-04 21:45:34,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-04 21:45:34,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-04 21:45:34,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-04 21:45:34,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-04 21:45:34,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:45:34" (1/1) ... [2021-06-04 21:45:34,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:45:34" (1/1) ... [2021-06-04 21:45:34,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-04 21:45:34,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-04 21:45:34,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-04 21:45:34,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-04 21:45:34,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:45:34" (1/1) ... [2021-06-04 21:45:34,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:45:34" (1/1) ... [2021-06-04 21:45:34,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:45:34" (1/1) ... [2021-06-04 21:45:34,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:45:34" (1/1) ... [2021-06-04 21:45:34,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:45:34" (1/1) ... [2021-06-04 21:45:34,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:45:34" (1/1) ... [2021-06-04 21:45:34,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:45:34" (1/1) ... [2021-06-04 21:45:34,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-04 21:45:34,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-04 21:45:34,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-04 21:45:34,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-04 21:45:34,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:45:34" (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-04 21:45:34,850 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2021-06-04 21:45:34,850 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2021-06-04 21:45:34,851 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2021-06-04 21:45:34,852 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2021-06-04 21:45:34,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-04 21:45:34,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-04 21:45:34,853 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2021-06-04 21:45:34,853 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2021-06-04 21:45:34,853 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-04 21:45:34,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-04 21:45:34,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-04 21:45:34,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-04 21:45:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-04 21:45:34,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-04 21:45:34,855 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-04 21:45:35,834 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-04 21:45:35,835 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-06-04 21:45:35,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 09:45:35 BoogieIcfgContainer [2021-06-04 21:45:35,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-04 21:45:35,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-04 21:45:35,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-04 21:45:35,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-04 21:45:35,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 09:45:34" (1/3) ... [2021-06-04 21:45:35,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee8c14f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 09:45:35, skipping insertion in model container [2021-06-04 21:45:35,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:45:34" (2/3) ... [2021-06-04 21:45:35,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee8c14f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 09:45:35, skipping insertion in model container [2021-06-04 21:45:35,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 09:45:35" (3/3) ... [2021-06-04 21:45:35,843 INFO L111 eAbstractionObserver]: Analyzing ICFG qrcu-1.i [2021-06-04 21:45:35,848 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-04 21:45:35,849 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-04 21:45:35,849 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-04 21:45:35,849 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-04 21:45:35,888 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,888 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,888 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,888 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,889 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,889 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,889 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,889 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,889 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,889 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,890 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,890 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,890 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,890 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,890 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,890 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,891 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,891 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,891 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,891 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,891 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,891 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,892 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,892 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,896 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,897 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,897 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,897 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,897 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,898 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,898 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,898 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,899 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,899 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,899 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,899 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,899 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,899 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,899 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,900 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,900 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,900 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,900 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,900 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,900 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,900 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,901 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,901 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,901 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,901 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,901 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,901 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,901 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,902 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,902 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,902 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,902 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,902 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,903 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,903 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,903 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,903 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,903 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,903 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,903 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,903 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,904 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,904 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,904 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,904 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,905 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,905 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,905 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,905 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,905 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,905 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,905 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,905 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,906 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,906 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,906 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,906 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,906 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,907 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,907 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,907 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,907 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,907 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,907 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,908 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,908 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,908 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,909 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,910 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,910 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,913 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,914 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,914 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,915 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,920 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,920 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,920 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,921 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,921 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,921 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,921 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,921 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,921 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,921 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,921 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,921 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,922 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,922 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,922 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,922 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,922 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,922 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,922 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,922 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,923 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,923 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,923 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,923 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,923 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,923 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,923 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,923 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,924 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,924 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,924 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,924 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,924 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,924 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,924 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,924 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,924 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,925 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,925 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,925 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,925 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,926 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,926 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,926 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,926 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,926 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,926 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,926 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,926 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,927 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,927 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,927 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,927 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,927 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,927 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,927 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,927 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,928 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,928 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,928 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,928 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,932 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,932 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,932 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,932 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,932 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,932 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,933 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,933 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,933 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,933 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,933 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,933 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,933 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,933 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,933 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,934 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,934 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,934 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,934 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,934 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,934 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,934 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,934 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,934 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,934 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,935 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,935 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,936 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,936 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,936 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,936 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,936 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,936 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,936 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,936 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,937 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,937 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,937 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,937 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,937 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,937 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,938 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,938 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,938 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,938 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,938 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,938 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,938 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,939 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,939 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,948 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,948 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,948 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,948 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,948 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,949 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,949 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,949 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,949 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,949 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,949 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,950 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,952 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,952 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,952 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,952 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,952 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,952 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,953 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,953 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,953 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,953 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,953 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,953 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,953 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,953 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,954 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,954 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,954 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,954 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,960 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,961 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,961 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,961 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,961 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,961 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,962 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,962 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,962 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,962 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,962 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,962 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,962 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,963 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,963 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,963 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,963 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,963 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,963 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,963 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,963 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,963 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,965 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,965 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,965 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,965 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,965 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,965 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,965 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,965 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,966 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,966 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,966 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,966 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,966 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,966 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,966 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,966 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,966 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,967 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,967 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,967 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,967 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,967 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,967 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,967 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,967 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,967 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,967 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,968 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,968 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,968 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,968 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,968 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,968 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,968 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,970 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,970 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,970 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,970 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,970 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,970 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,970 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,971 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,971 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,971 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,971 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,971 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,971 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,971 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,971 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,971 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,971 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,972 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,972 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,972 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,972 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,972 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,972 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,972 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,972 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,972 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,972 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,973 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,973 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,973 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,973 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,973 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,973 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,974 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,974 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,974 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,974 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,974 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,974 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,974 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,974 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,975 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,975 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,975 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,975 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,975 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,975 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,975 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,975 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,976 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,976 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,976 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,976 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,977 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,977 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,977 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,981 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,982 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,982 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,983 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,983 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,983 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,983 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,983 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,983 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,983 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,983 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,983 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,984 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,984 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,984 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,984 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,985 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,985 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,985 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,985 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,985 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,985 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,985 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,986 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,986 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,986 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,986 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,986 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,986 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,986 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,986 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,986 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,987 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,987 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,987 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,989 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,989 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,989 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,989 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,989 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,989 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,989 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,989 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,990 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,990 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,990 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,990 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,990 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,990 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,990 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,990 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,991 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,991 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,991 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,992 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,992 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,992 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,992 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,992 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,992 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,993 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,993 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,993 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,993 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,993 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,993 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,993 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,993 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,993 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,994 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,994 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,994 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:35,994 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:45:36,011 INFO L149 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2021-06-04 21:45:36,028 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-04 21:45:36,041 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-04 21:45:36,041 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-04 21:45:36,041 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-04 21:45:36,041 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-04 21:45:36,041 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-04 21:45:36,041 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-04 21:45:36,041 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-04 21:45:36,041 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-04 21:45:36,052 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 170 places, 184 transitions, 410 flow [2021-06-04 21:45:47,103 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 107259 states, 107256 states have (on average 4.101253076750951) internal successors, (439884), 107258 states have internal predecessors, (439884), 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-04 21:45:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 107259 states, 107256 states have (on average 4.101253076750951) internal successors, (439884), 107258 states have internal predecessors, (439884), 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-04 21:45:47,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-04 21:45:47,596 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:45:47,597 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] [2021-06-04 21:45:47,597 INFO L430 AbstractCegarLoop]: === Iteration 1 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:45:47,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:45:47,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1400416887, now seen corresponding path program 1 times [2021-06-04 21:45:47,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:45:47,613 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24715216] [2021-06-04 21:45:47,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:45:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:45:47,877 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-04 21:45:47,877 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:45:47,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24715216] [2021-06-04 21:45:47,878 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24715216] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:45:47,878 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:45:47,879 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-04 21:45:47,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796321042] [2021-06-04 21:45:47,883 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-04 21:45:47,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:45:47,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-04 21:45:47,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:45:48,035 INFO L87 Difference]: Start difference. First operand has 107259 states, 107256 states have (on average 4.101253076750951) internal successors, (439884), 107258 states have internal predecessors, (439884), 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 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-04 21:45:49,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:45:49,817 INFO L93 Difference]: Finished difference Result 136158 states and 522598 transitions. [2021-06-04 21:45:49,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-04 21:45:49,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2021-06-04 21:45:49,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:45:50,875 INFO L225 Difference]: With dead ends: 136158 [2021-06-04 21:45:50,876 INFO L226 Difference]: Without dead ends: 105928 [2021-06-04 21:45:50,877 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:45:53,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105928 states. [2021-06-04 21:45:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105928 to 93867. [2021-06-04 21:45:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93867 states, 93865 states have (on average 3.899472646886486) internal successors, (366024), 93866 states have internal predecessors, (366024), 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-04 21:45:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93867 states to 93867 states and 366024 transitions. [2021-06-04 21:45:56,839 INFO L78 Accepts]: Start accepts. Automaton has 93867 states and 366024 transitions. Word has length 55 [2021-06-04 21:45:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:45:56,840 INFO L482 AbstractCegarLoop]: Abstraction has 93867 states and 366024 transitions. [2021-06-04 21:45:56,840 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-04 21:45:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 93867 states and 366024 transitions. [2021-06-04 21:45:56,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-04 21:45:56,891 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:45:56,891 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] [2021-06-04 21:45:56,892 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-04 21:45:56,892 INFO L430 AbstractCegarLoop]: === Iteration 2 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:45:56,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:45:56,893 INFO L82 PathProgramCache]: Analyzing trace with hash 566486812, now seen corresponding path program 1 times [2021-06-04 21:45:56,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:45:56,893 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9232868] [2021-06-04 21:45:56,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:45:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:45:57,054 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-04 21:45:57,054 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:45:57,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9232868] [2021-06-04 21:45:57,055 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9232868] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:45:57,055 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:45:57,055 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-04 21:45:57,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902246993] [2021-06-04 21:45:57,056 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-04 21:45:57,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:45:57,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-04 21:45:57,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:45:57,059 INFO L87 Difference]: Start difference. First operand 93867 states and 366024 transitions. Second operand has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 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-04 21:45:57,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:45:57,907 INFO L93 Difference]: Finished difference Result 92622 states and 361163 transitions. [2021-06-04 21:45:57,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-04 21:45:57,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2021-06-04 21:45:57,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:45:58,234 INFO L225 Difference]: With dead ends: 92622 [2021-06-04 21:45:58,234 INFO L226 Difference]: Without dead ends: 92622 [2021-06-04 21:45:58,234 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:46:00,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92622 states. [2021-06-04 21:46:01,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92622 to 92622. [2021-06-04 21:46:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92622 states, 92620 states have (on average 3.8994061757719716) internal successors, (361163), 92621 states have internal predecessors, (361163), 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-04 21:46:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92622 states to 92622 states and 361163 transitions. [2021-06-04 21:46:02,867 INFO L78 Accepts]: Start accepts. Automaton has 92622 states and 361163 transitions. Word has length 60 [2021-06-04 21:46:02,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:02,868 INFO L482 AbstractCegarLoop]: Abstraction has 92622 states and 361163 transitions. [2021-06-04 21:46:02,868 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 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-04 21:46:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand 92622 states and 361163 transitions. [2021-06-04 21:46:02,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-04 21:46:02,923 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:02,923 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-04 21:46:02,924 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-04 21:46:02,924 INFO L430 AbstractCegarLoop]: === Iteration 3 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:02,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:02,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1282967431, now seen corresponding path program 1 times [2021-06-04 21:46:02,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:02,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907251728] [2021-06-04 21:46:02,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:03,043 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-04 21:46:03,044 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:03,044 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907251728] [2021-06-04 21:46:03,044 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907251728] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:03,044 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:03,044 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-04 21:46:03,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825576578] [2021-06-04 21:46:03,045 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-04 21:46:03,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:03,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-04 21:46:03,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-04 21:46:03,046 INFO L87 Difference]: Start difference. First operand 92622 states and 361163 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 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-04 21:46:04,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:04,365 INFO L93 Difference]: Finished difference Result 113020 states and 435314 transitions. [2021-06-04 21:46:04,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-04 21:46:04,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 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-04 21:46:04,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:04,928 INFO L225 Difference]: With dead ends: 113020 [2021-06-04 21:46:04,928 INFO L226 Difference]: Without dead ends: 107851 [2021-06-04 21:46:04,928 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 46.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-04 21:46:07,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107851 states. [2021-06-04 21:46:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107851 to 107718. [2021-06-04 21:46:09,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107718 states, 107716 states have (on average 3.8566415388614503) internal successors, (415422), 107717 states have internal predecessors, (415422), 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-04 21:46:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107718 states to 107718 states and 415422 transitions. [2021-06-04 21:46:10,026 INFO L78 Accepts]: Start accepts. Automaton has 107718 states and 415422 transitions. Word has length 63 [2021-06-04 21:46:10,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:10,027 INFO L482 AbstractCegarLoop]: Abstraction has 107718 states and 415422 transitions. [2021-06-04 21:46:10,027 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 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-04 21:46:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 107718 states and 415422 transitions. [2021-06-04 21:46:10,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-04 21:46:10,117 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:10,117 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-04 21:46:10,117 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-04 21:46:10,117 INFO L430 AbstractCegarLoop]: === Iteration 4 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:10,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:10,117 INFO L82 PathProgramCache]: Analyzing trace with hash -398924547, now seen corresponding path program 1 times [2021-06-04 21:46:10,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:10,118 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961509700] [2021-06-04 21:46:10,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:10,211 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-04 21:46:10,211 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:10,211 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961509700] [2021-06-04 21:46:10,211 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961509700] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:10,212 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:10,212 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-04 21:46:10,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684942281] [2021-06-04 21:46:10,212 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-04 21:46:10,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:10,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-04 21:46:10,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-04 21:46:10,214 INFO L87 Difference]: Start difference. First operand 107718 states and 415422 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-04 21:46:11,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:11,540 INFO L93 Difference]: Finished difference Result 115814 states and 439888 transitions. [2021-06-04 21:46:11,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-04 21:46:11,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-04 21:46:11,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:11,936 INFO L225 Difference]: With dead ends: 115814 [2021-06-04 21:46:11,937 INFO L226 Difference]: Without dead ends: 115782 [2021-06-04 21:46:11,937 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 35.3ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-06-04 21:46:13,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115782 states. [2021-06-04 21:46:15,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115782 to 112214. [2021-06-04 21:46:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112214 states, 112212 states have (on average 3.7985242220083415) internal successors, (426240), 112213 states have internal predecessors, (426240), 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-04 21:46:16,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112214 states to 112214 states and 426240 transitions. [2021-06-04 21:46:16,406 INFO L78 Accepts]: Start accepts. Automaton has 112214 states and 426240 transitions. Word has length 69 [2021-06-04 21:46:16,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:16,407 INFO L482 AbstractCegarLoop]: Abstraction has 112214 states and 426240 transitions. [2021-06-04 21:46:16,407 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-04 21:46:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 112214 states and 426240 transitions. [2021-06-04 21:46:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-04 21:46:17,088 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:17,089 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-04 21:46:17,089 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-04 21:46:17,089 INFO L430 AbstractCegarLoop]: === Iteration 5 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:17,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:17,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1639623555, now seen corresponding path program 1 times [2021-06-04 21:46:17,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:17,090 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778058728] [2021-06-04 21:46:17,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:17,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-04 21:46:17,270 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:17,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778058728] [2021-06-04 21:46:17,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778058728] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:17,270 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:17,270 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-04 21:46:17,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847007609] [2021-06-04 21:46:17,270 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-04 21:46:17,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:17,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-04 21:46:17,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-04 21:46:17,271 INFO L87 Difference]: Start difference. First operand 112214 states and 426240 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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-04 21:46:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:18,160 INFO L93 Difference]: Finished difference Result 119990 states and 451910 transitions. [2021-06-04 21:46:18,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-04 21:46:18,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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-04 21:46:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:18,481 INFO L225 Difference]: With dead ends: 119990 [2021-06-04 21:46:18,482 INFO L226 Difference]: Without dead ends: 119990 [2021-06-04 21:46:18,482 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 63.9ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-04 21:46:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119990 states. [2021-06-04 21:46:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119990 to 111423. [2021-06-04 21:46:22,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111423 states, 111421 states have (on average 3.792040997657533) internal successors, (422513), 111422 states have internal predecessors, (422513), 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-04 21:46:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111423 states to 111423 states and 422513 transitions. [2021-06-04 21:46:23,825 INFO L78 Accepts]: Start accepts. Automaton has 111423 states and 422513 transitions. Word has length 69 [2021-06-04 21:46:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:23,825 INFO L482 AbstractCegarLoop]: Abstraction has 111423 states and 422513 transitions. [2021-06-04 21:46:23,825 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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-04 21:46:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 111423 states and 422513 transitions. [2021-06-04 21:46:23,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-04 21:46:23,923 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:23,923 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-04 21:46:23,923 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-04 21:46:23,923 INFO L430 AbstractCegarLoop]: === Iteration 6 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:23,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:23,924 INFO L82 PathProgramCache]: Analyzing trace with hash -266720635, now seen corresponding path program 2 times [2021-06-04 21:46:23,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:23,924 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548454642] [2021-06-04 21:46:23,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:24,036 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-04 21:46:24,036 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:24,036 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548454642] [2021-06-04 21:46:24,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548454642] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:24,037 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:24,037 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-04 21:46:24,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340788445] [2021-06-04 21:46:24,038 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-04 21:46:24,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:24,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-04 21:46:24,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-04 21:46:24,039 INFO L87 Difference]: Start difference. First operand 111423 states and 422513 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 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-04 21:46:25,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:25,504 INFO L93 Difference]: Finished difference Result 136612 states and 511856 transitions. [2021-06-04 21:46:25,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-04 21:46:25,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 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-04 21:46:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:25,667 INFO L225 Difference]: With dead ends: 136612 [2021-06-04 21:46:25,667 INFO L226 Difference]: Without dead ends: 59635 [2021-06-04 21:46:25,667 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 47.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-04 21:46:25,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59635 states. [2021-06-04 21:46:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59635 to 59103. [2021-06-04 21:46:27,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59103 states, 59101 states have (on average 3.5635437640649057) internal successors, (210609), 59102 states have internal predecessors, (210609), 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-04 21:46:27,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59103 states to 59103 states and 210609 transitions. [2021-06-04 21:46:27,217 INFO L78 Accepts]: Start accepts. Automaton has 59103 states and 210609 transitions. Word has length 69 [2021-06-04 21:46:27,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:27,217 INFO L482 AbstractCegarLoop]: Abstraction has 59103 states and 210609 transitions. [2021-06-04 21:46:27,218 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 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-04 21:46:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand 59103 states and 210609 transitions. [2021-06-04 21:46:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-04 21:46:27,251 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:27,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, 1, 1, 1, 1, 1] [2021-06-04 21:46:27,251 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-04 21:46:27,251 INFO L430 AbstractCegarLoop]: === Iteration 7 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:27,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:27,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1882083365, now seen corresponding path program 1 times [2021-06-04 21:46:27,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:27,252 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207462820] [2021-06-04 21:46:27,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:27,299 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-04 21:46:27,300 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:27,300 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207462820] [2021-06-04 21:46:27,300 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207462820] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:27,300 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:27,300 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-04 21:46:27,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910965244] [2021-06-04 21:46:27,301 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-04 21:46:27,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:27,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-04 21:46:27,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:46:27,301 INFO L87 Difference]: Start difference. First operand 59103 states and 210609 transitions. Second operand has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 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-04 21:46:27,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:27,586 INFO L93 Difference]: Finished difference Result 59103 states and 210104 transitions. [2021-06-04 21:46:27,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-04 21:46:27,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 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-04 21:46:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:27,671 INFO L225 Difference]: With dead ends: 59103 [2021-06-04 21:46:27,671 INFO L226 Difference]: Without dead ends: 42798 [2021-06-04 21:46:27,671 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:46:27,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42798 states. [2021-06-04 21:46:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42798 to 38148. [2021-06-04 21:46:28,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38148 states, 38146 states have (on average 3.492161694542023) internal successors, (133212), 38147 states have internal predecessors, (133212), 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-04 21:46:28,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38148 states to 38148 states and 133212 transitions. [2021-06-04 21:46:28,888 INFO L78 Accepts]: Start accepts. Automaton has 38148 states and 133212 transitions. Word has length 71 [2021-06-04 21:46:28,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:28,888 INFO L482 AbstractCegarLoop]: Abstraction has 38148 states and 133212 transitions. [2021-06-04 21:46:28,888 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 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-04 21:46:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 38148 states and 133212 transitions. [2021-06-04 21:46:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-04 21:46:28,920 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:28,921 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-04 21:46:28,921 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-04 21:46:28,921 INFO L430 AbstractCegarLoop]: === Iteration 8 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:28,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:28,921 INFO L82 PathProgramCache]: Analyzing trace with hash 735931245, now seen corresponding path program 1 times [2021-06-04 21:46:28,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:28,921 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580616300] [2021-06-04 21:46:28,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:28,965 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-04 21:46:28,965 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:28,965 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580616300] [2021-06-04 21:46:28,965 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580616300] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:28,965 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:28,965 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-04 21:46:28,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889204069] [2021-06-04 21:46:28,966 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-04 21:46:28,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:28,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-04 21:46:28,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-04 21:46:28,966 INFO L87 Difference]: Start difference. First operand 38148 states and 133212 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 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-04 21:46:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:29,272 INFO L93 Difference]: Finished difference Result 56525 states and 198218 transitions. [2021-06-04 21:46:29,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-04 21:46:29,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 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-04 21:46:29,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:29,321 INFO L225 Difference]: With dead ends: 56525 [2021-06-04 21:46:29,321 INFO L226 Difference]: Without dead ends: 20903 [2021-06-04 21:46:29,321 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-04 21:46:29,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20903 states. [2021-06-04 21:46:30,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20903 to 19239. [2021-06-04 21:46:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19239 states, 19237 states have (on average 3.2243593075843426) internal successors, (62027), 19238 states have internal predecessors, (62027), 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-04 21:46:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19239 states to 19239 states and 62027 transitions. [2021-06-04 21:46:30,113 INFO L78 Accepts]: Start accepts. Automaton has 19239 states and 62027 transitions. Word has length 74 [2021-06-04 21:46:30,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:30,114 INFO L482 AbstractCegarLoop]: Abstraction has 19239 states and 62027 transitions. [2021-06-04 21:46:30,114 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 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-04 21:46:30,114 INFO L276 IsEmpty]: Start isEmpty. Operand 19239 states and 62027 transitions. [2021-06-04 21:46:30,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-04 21:46:30,138 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:30,138 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-04 21:46:30,138 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-04 21:46:30,138 INFO L430 AbstractCegarLoop]: === Iteration 9 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:30,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:30,139 INFO L82 PathProgramCache]: Analyzing trace with hash 527621088, now seen corresponding path program 1 times [2021-06-04 21:46:30,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:30,139 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282638598] [2021-06-04 21:46:30,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:30,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-04 21:46:30,171 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:30,171 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282638598] [2021-06-04 21:46:30,171 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282638598] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:30,171 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:30,172 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-04 21:46:30,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459220726] [2021-06-04 21:46:30,172 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-04 21:46:30,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:30,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-04 21:46:30,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:46:30,173 INFO L87 Difference]: Start difference. First operand 19239 states and 62027 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-04 21:46:30,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:30,253 INFO L93 Difference]: Finished difference Result 18328 states and 59183 transitions. [2021-06-04 21:46:30,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-04 21:46:30,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-04 21:46:30,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:30,289 INFO L225 Difference]: With dead ends: 18328 [2021-06-04 21:46:30,289 INFO L226 Difference]: Without dead ends: 18328 [2021-06-04 21:46:30,290 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:46:30,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18328 states. [2021-06-04 21:46:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18328 to 18049. [2021-06-04 21:46:30,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18049 states, 18047 states have (on average 3.2459688590901536) internal successors, (58580), 18048 states have internal predecessors, (58580), 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-04 21:46:30,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18049 states to 18049 states and 58580 transitions. [2021-06-04 21:46:30,623 INFO L78 Accepts]: Start accepts. Automaton has 18049 states and 58580 transitions. Word has length 77 [2021-06-04 21:46:30,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:30,624 INFO L482 AbstractCegarLoop]: Abstraction has 18049 states and 58580 transitions. [2021-06-04 21:46:30,624 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-04 21:46:30,624 INFO L276 IsEmpty]: Start isEmpty. Operand 18049 states and 58580 transitions. [2021-06-04 21:46:30,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-04 21:46:30,646 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:30,646 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-04 21:46:30,646 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-04 21:46:30,647 INFO L430 AbstractCegarLoop]: === Iteration 10 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:30,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:30,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1833917536, now seen corresponding path program 1 times [2021-06-04 21:46:30,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:30,647 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542720846] [2021-06-04 21:46:30,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:30,672 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-04 21:46:30,672 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:30,672 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542720846] [2021-06-04 21:46:30,672 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542720846] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:30,672 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:30,672 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-04 21:46:30,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571519144] [2021-06-04 21:46:30,673 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-04 21:46:30,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:30,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-04 21:46:30,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:46:30,673 INFO L87 Difference]: Start difference. First operand 18049 states and 58580 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-04 21:46:30,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:30,740 INFO L93 Difference]: Finished difference Result 18158 states and 58368 transitions. [2021-06-04 21:46:30,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-04 21:46:30,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-04 21:46:30,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:30,768 INFO L225 Difference]: With dead ends: 18158 [2021-06-04 21:46:30,768 INFO L226 Difference]: Without dead ends: 18158 [2021-06-04 21:46:30,769 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:46:30,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18158 states. [2021-06-04 21:46:31,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18158 to 17879. [2021-06-04 21:46:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17879 states, 17877 states have (on average 3.2312468534989094) internal successors, (57765), 17878 states have internal predecessors, (57765), 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-04 21:46:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17879 states to 17879 states and 57765 transitions. [2021-06-04 21:46:31,315 INFO L78 Accepts]: Start accepts. Automaton has 17879 states and 57765 transitions. Word has length 77 [2021-06-04 21:46:31,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:31,315 INFO L482 AbstractCegarLoop]: Abstraction has 17879 states and 57765 transitions. [2021-06-04 21:46:31,316 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-04 21:46:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 17879 states and 57765 transitions. [2021-06-04 21:46:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-04 21:46:31,339 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:31,339 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-04 21:46:31,339 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-04 21:46:31,339 INFO L430 AbstractCegarLoop]: === Iteration 11 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:31,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:31,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1834930430, now seen corresponding path program 1 times [2021-06-04 21:46:31,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:31,340 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783907403] [2021-06-04 21:46:31,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:31,377 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-04 21:46:31,378 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:31,378 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783907403] [2021-06-04 21:46:31,378 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783907403] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:31,378 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:31,378 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-04 21:46:31,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67377003] [2021-06-04 21:46:31,378 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-04 21:46:31,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:31,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-04 21:46:31,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-04 21:46:31,379 INFO L87 Difference]: Start difference. First operand 17879 states and 57765 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-04 21:46:31,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:31,528 INFO L93 Difference]: Finished difference Result 18060 states and 57752 transitions. [2021-06-04 21:46:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-04 21:46:31,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-04 21:46:31,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:31,565 INFO L225 Difference]: With dead ends: 18060 [2021-06-04 21:46:31,565 INFO L226 Difference]: Without dead ends: 17820 [2021-06-04 21:46:31,565 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 25.2ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-04 21:46:31,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17820 states. [2021-06-04 21:46:31,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17820 to 16473. [2021-06-04 21:46:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16473 states, 16471 states have (on average 3.2634934126646833) internal successors, (53753), 16472 states have internal predecessors, (53753), 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-04 21:46:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16473 states to 16473 states and 53753 transitions. [2021-06-04 21:46:31,848 INFO L78 Accepts]: Start accepts. Automaton has 16473 states and 53753 transitions. Word has length 77 [2021-06-04 21:46:31,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:31,848 INFO L482 AbstractCegarLoop]: Abstraction has 16473 states and 53753 transitions. [2021-06-04 21:46:31,848 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-04 21:46:31,848 INFO L276 IsEmpty]: Start isEmpty. Operand 16473 states and 53753 transitions. [2021-06-04 21:46:31,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-04 21:46:31,869 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:31,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] [2021-06-04 21:46:31,869 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-04 21:46:31,869 INFO L430 AbstractCegarLoop]: === Iteration 12 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:31,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:31,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1643343059, now seen corresponding path program 1 times [2021-06-04 21:46:31,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:31,870 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787156915] [2021-06-04 21:46:31,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:31,963 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-04 21:46:31,963 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:31,963 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787156915] [2021-06-04 21:46:31,964 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787156915] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:31,964 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:31,964 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-04 21:46:31,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984467410] [2021-06-04 21:46:31,964 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-04 21:46:31,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:31,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-04 21:46:31,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-04 21:46:31,965 INFO L87 Difference]: Start difference. First operand 16473 states and 53753 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 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-04 21:46:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:32,173 INFO L93 Difference]: Finished difference Result 17507 states and 56416 transitions. [2021-06-04 21:46:32,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-04 21:46:32,173 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 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-04 21:46:32,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:32,210 INFO L225 Difference]: With dead ends: 17507 [2021-06-04 21:46:32,210 INFO L226 Difference]: Without dead ends: 17507 [2021-06-04 21:46:32,210 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 63.9ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-04 21:46:32,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17507 states. [2021-06-04 21:46:32,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17507 to 16516. [2021-06-04 21:46:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16516 states, 16514 states have (on average 3.2620201041540513) internal successors, (53869), 16515 states have internal predecessors, (53869), 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-04 21:46:32,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16516 states to 16516 states and 53869 transitions. [2021-06-04 21:46:32,717 INFO L78 Accepts]: Start accepts. Automaton has 16516 states and 53869 transitions. Word has length 80 [2021-06-04 21:46:32,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:32,717 INFO L482 AbstractCegarLoop]: Abstraction has 16516 states and 53869 transitions. [2021-06-04 21:46:32,717 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 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-04 21:46:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 16516 states and 53869 transitions. [2021-06-04 21:46:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-04 21:46:32,738 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:32,738 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-04 21:46:32,738 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-04 21:46:32,738 INFO L430 AbstractCegarLoop]: === Iteration 13 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:32,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:32,739 INFO L82 PathProgramCache]: Analyzing trace with hash -574527521, now seen corresponding path program 2 times [2021-06-04 21:46:32,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:32,739 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71249531] [2021-06-04 21:46:32,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:32,858 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-04 21:46:32,858 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:32,858 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71249531] [2021-06-04 21:46:32,858 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71249531] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:32,858 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:32,858 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-04 21:46:32,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017590235] [2021-06-04 21:46:32,859 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-04 21:46:32,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:32,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-04 21:46:32,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-04 21:46:32,860 INFO L87 Difference]: Start difference. First operand 16516 states and 53869 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 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-04 21:46:33,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:33,207 INFO L93 Difference]: Finished difference Result 20249 states and 65024 transitions. [2021-06-04 21:46:33,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-04 21:46:33,208 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 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-04 21:46:33,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:33,250 INFO L225 Difference]: With dead ends: 20249 [2021-06-04 21:46:33,250 INFO L226 Difference]: Without dead ends: 20249 [2021-06-04 21:46:33,251 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 107.1ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-06-04 21:46:33,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20249 states. [2021-06-04 21:46:33,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20249 to 17068. [2021-06-04 21:46:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17068 states, 17066 states have (on average 3.270713699753897) internal successors, (55818), 17067 states have internal predecessors, (55818), 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-04 21:46:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17068 states to 17068 states and 55818 transitions. [2021-06-04 21:46:33,565 INFO L78 Accepts]: Start accepts. Automaton has 17068 states and 55818 transitions. Word has length 80 [2021-06-04 21:46:33,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:33,565 INFO L482 AbstractCegarLoop]: Abstraction has 17068 states and 55818 transitions. [2021-06-04 21:46:33,565 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 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-04 21:46:33,565 INFO L276 IsEmpty]: Start isEmpty. Operand 17068 states and 55818 transitions. [2021-06-04 21:46:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-04 21:46:33,588 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:33,589 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-04 21:46:33,589 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-04 21:46:33,589 INFO L430 AbstractCegarLoop]: === Iteration 14 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:33,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:33,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1100980875, now seen corresponding path program 3 times [2021-06-04 21:46:33,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:33,592 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420818873] [2021-06-04 21:46:33,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:33,704 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-04 21:46:33,705 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:33,705 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420818873] [2021-06-04 21:46:33,705 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420818873] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:33,705 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:33,705 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-04 21:46:33,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312587050] [2021-06-04 21:46:33,705 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-04 21:46:33,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:33,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-04 21:46:33,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-04 21:46:33,706 INFO L87 Difference]: Start difference. First operand 17068 states and 55818 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 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-04 21:46:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:34,122 INFO L93 Difference]: Finished difference Result 20167 states and 64836 transitions. [2021-06-04 21:46:34,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-04 21:46:34,122 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 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-04 21:46:34,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:34,160 INFO L225 Difference]: With dead ends: 20167 [2021-06-04 21:46:34,160 INFO L226 Difference]: Without dead ends: 20167 [2021-06-04 21:46:34,160 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 109.6ms TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-06-04 21:46:34,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20167 states. [2021-06-04 21:46:34,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20167 to 17575. [2021-06-04 21:46:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17575 states, 17573 states have (on average 3.253798440789848) internal successors, (57179), 17574 states have internal predecessors, (57179), 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-04 21:46:34,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17575 states to 17575 states and 57179 transitions. [2021-06-04 21:46:34,453 INFO L78 Accepts]: Start accepts. Automaton has 17575 states and 57179 transitions. Word has length 80 [2021-06-04 21:46:34,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:34,453 INFO L482 AbstractCegarLoop]: Abstraction has 17575 states and 57179 transitions. [2021-06-04 21:46:34,453 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 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-04 21:46:34,453 INFO L276 IsEmpty]: Start isEmpty. Operand 17575 states and 57179 transitions. [2021-06-04 21:46:34,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-04 21:46:34,476 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:34,476 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-04 21:46:34,476 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-04 21:46:34,476 INFO L430 AbstractCegarLoop]: === Iteration 15 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:34,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:34,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1964715603, now seen corresponding path program 1 times [2021-06-04 21:46:34,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:34,477 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591503351] [2021-06-04 21:46:34,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:34,585 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-04 21:46:34,585 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:34,585 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591503351] [2021-06-04 21:46:34,585 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591503351] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:34,585 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:34,585 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-04 21:46:34,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588223725] [2021-06-04 21:46:34,586 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-04 21:46:34,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:34,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-04 21:46:34,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-04 21:46:34,586 INFO L87 Difference]: Start difference. First operand 17575 states and 57179 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 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-04 21:46:34,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:34,872 INFO L93 Difference]: Finished difference Result 18109 states and 58406 transitions. [2021-06-04 21:46:34,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-04 21:46:34,873 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 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-04 21:46:34,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:34,911 INFO L225 Difference]: With dead ends: 18109 [2021-06-04 21:46:34,911 INFO L226 Difference]: Without dead ends: 18109 [2021-06-04 21:46:34,911 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 103.7ms TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2021-06-04 21:46:34,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18109 states. [2021-06-04 21:46:35,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18109 to 17618. [2021-06-04 21:46:35,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17618 states, 17616 states have (on average 3.2524409627611264) internal successors, (57295), 17617 states have internal predecessors, (57295), 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-04 21:46:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17618 states to 17618 states and 57295 transitions. [2021-06-04 21:46:35,201 INFO L78 Accepts]: Start accepts. Automaton has 17618 states and 57295 transitions. Word has length 80 [2021-06-04 21:46:35,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:35,202 INFO L482 AbstractCegarLoop]: Abstraction has 17618 states and 57295 transitions. [2021-06-04 21:46:35,202 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 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-04 21:46:35,202 INFO L276 IsEmpty]: Start isEmpty. Operand 17618 states and 57295 transitions. [2021-06-04 21:46:35,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-04 21:46:35,226 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:35,226 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-04 21:46:35,226 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-04 21:46:35,226 INFO L430 AbstractCegarLoop]: === Iteration 16 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:35,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:35,226 INFO L82 PathProgramCache]: Analyzing trace with hash -556986819, now seen corresponding path program 2 times [2021-06-04 21:46:35,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:35,226 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671322938] [2021-06-04 21:46:35,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:35,327 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-04 21:46:35,327 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:35,327 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671322938] [2021-06-04 21:46:35,327 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671322938] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:35,327 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:35,327 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-04 21:46:35,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860951219] [2021-06-04 21:46:35,328 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-04 21:46:35,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:35,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-04 21:46:35,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-06-04 21:46:35,328 INFO L87 Difference]: Start difference. First operand 17618 states and 57295 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 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-04 21:46:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:35,811 INFO L93 Difference]: Finished difference Result 19771 states and 63757 transitions. [2021-06-04 21:46:35,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-04 21:46:35,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 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-04 21:46:35,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:35,843 INFO L225 Difference]: With dead ends: 19771 [2021-06-04 21:46:35,844 INFO L226 Difference]: Without dead ends: 19771 [2021-06-04 21:46:35,844 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 173.2ms TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2021-06-04 21:46:35,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19771 states. [2021-06-04 21:46:36,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19771 to 17740. [2021-06-04 21:46:36,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17740 states, 17738 states have (on average 3.2573570864810013) internal successors, (57779), 17739 states have internal predecessors, (57779), 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-04 21:46:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17740 states to 17740 states and 57779 transitions. [2021-06-04 21:46:36,146 INFO L78 Accepts]: Start accepts. Automaton has 17740 states and 57779 transitions. Word has length 80 [2021-06-04 21:46:36,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:36,146 INFO L482 AbstractCegarLoop]: Abstraction has 17740 states and 57779 transitions. [2021-06-04 21:46:36,146 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 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-04 21:46:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 17740 states and 57779 transitions. [2021-06-04 21:46:36,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-04 21:46:36,168 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:36,169 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-04 21:46:36,169 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-04 21:46:36,169 INFO L430 AbstractCegarLoop]: === Iteration 17 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:36,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:36,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1993329701, now seen corresponding path program 4 times [2021-06-04 21:46:36,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:36,169 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815423953] [2021-06-04 21:46:36,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:36,264 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-04 21:46:36,264 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:36,265 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815423953] [2021-06-04 21:46:36,265 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815423953] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:36,265 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:36,265 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-04 21:46:36,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673166152] [2021-06-04 21:46:36,265 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-04 21:46:36,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:36,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-04 21:46:36,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-04 21:46:36,266 INFO L87 Difference]: Start difference. First operand 17740 states and 57779 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 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-04 21:46:36,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:36,557 INFO L93 Difference]: Finished difference Result 22688 states and 72875 transitions. [2021-06-04 21:46:36,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-04 21:46:36,557 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 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-04 21:46:36,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:36,593 INFO L225 Difference]: With dead ends: 22688 [2021-06-04 21:46:36,593 INFO L226 Difference]: Without dead ends: 22688 [2021-06-04 21:46:36,593 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 91.1ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-06-04 21:46:36,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22688 states. [2021-06-04 21:46:36,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22688 to 17736. [2021-06-04 21:46:36,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17736 states, 17734 states have (on average 3.2572459681966843) internal successors, (57764), 17735 states have internal predecessors, (57764), 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-04 21:46:37,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17736 states to 17736 states and 57764 transitions. [2021-06-04 21:46:37,069 INFO L78 Accepts]: Start accepts. Automaton has 17736 states and 57764 transitions. Word has length 80 [2021-06-04 21:46:37,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:37,069 INFO L482 AbstractCegarLoop]: Abstraction has 17736 states and 57764 transitions. [2021-06-04 21:46:37,069 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 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-04 21:46:37,070 INFO L276 IsEmpty]: Start isEmpty. Operand 17736 states and 57764 transitions. [2021-06-04 21:46:37,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-04 21:46:37,092 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:37,092 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-04 21:46:37,093 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-04 21:46:37,093 INFO L430 AbstractCegarLoop]: === Iteration 18 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:37,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:37,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1775184241, now seen corresponding path program 5 times [2021-06-04 21:46:37,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:37,093 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5546241] [2021-06-04 21:46:37,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:37,189 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-04 21:46:37,189 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:37,189 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5546241] [2021-06-04 21:46:37,189 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5546241] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:37,190 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:37,190 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-04 21:46:37,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136999354] [2021-06-04 21:46:37,191 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-04 21:46:37,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:37,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-04 21:46:37,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-04 21:46:37,191 INFO L87 Difference]: Start difference. First operand 17736 states and 57764 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 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-04 21:46:37,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:37,508 INFO L93 Difference]: Finished difference Result 19984 states and 64446 transitions. [2021-06-04 21:46:37,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-04 21:46:37,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 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-04 21:46:37,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:37,541 INFO L225 Difference]: With dead ends: 19984 [2021-06-04 21:46:37,541 INFO L226 Difference]: Without dead ends: 19984 [2021-06-04 21:46:37,541 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 105.8ms TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-06-04 21:46:37,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19984 states. [2021-06-04 21:46:37,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19984 to 18025. [2021-06-04 21:46:37,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18025 states, 18023 states have (on average 3.245519613826777) internal successors, (58494), 18024 states have internal predecessors, (58494), 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-04 21:46:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18025 states to 18025 states and 58494 transitions. [2021-06-04 21:46:37,852 INFO L78 Accepts]: Start accepts. Automaton has 18025 states and 58494 transitions. Word has length 80 [2021-06-04 21:46:37,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:37,852 INFO L482 AbstractCegarLoop]: Abstraction has 18025 states and 58494 transitions. [2021-06-04 21:46:37,852 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 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-04 21:46:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 18025 states and 58494 transitions. [2021-06-04 21:46:37,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-04 21:46:37,876 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:37,876 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-04 21:46:37,876 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-04 21:46:37,876 INFO L430 AbstractCegarLoop]: === Iteration 19 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:37,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:37,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1082545819, now seen corresponding path program 3 times [2021-06-04 21:46:37,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:37,877 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946529044] [2021-06-04 21:46:37,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:37,967 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-04 21:46:37,967 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:37,967 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946529044] [2021-06-04 21:46:37,967 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946529044] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:37,967 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:37,967 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-04 21:46:37,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554967508] [2021-06-04 21:46:37,968 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-04 21:46:37,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:37,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-04 21:46:37,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-06-04 21:46:37,968 INFO L87 Difference]: Start difference. First operand 18025 states and 58494 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 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-04 21:46:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:38,325 INFO L93 Difference]: Finished difference Result 22045 states and 71149 transitions. [2021-06-04 21:46:38,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-04 21:46:38,326 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 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-04 21:46:38,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:38,362 INFO L225 Difference]: With dead ends: 22045 [2021-06-04 21:46:38,362 INFO L226 Difference]: Without dead ends: 22045 [2021-06-04 21:46:38,362 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 131.3ms TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2021-06-04 21:46:38,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22045 states. [2021-06-04 21:46:38,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22045 to 16824. [2021-06-04 21:46:38,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16824 states, 16822 states have (on average 3.2490785875639046) internal successors, (54656), 16823 states have internal predecessors, (54656), 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-04 21:46:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16824 states to 16824 states and 54656 transitions. [2021-06-04 21:46:38,818 INFO L78 Accepts]: Start accepts. Automaton has 16824 states and 54656 transitions. Word has length 80 [2021-06-04 21:46:38,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:38,819 INFO L482 AbstractCegarLoop]: Abstraction has 16824 states and 54656 transitions. [2021-06-04 21:46:38,819 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 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-04 21:46:38,819 INFO L276 IsEmpty]: Start isEmpty. Operand 16824 states and 54656 transitions. [2021-06-04 21:46:38,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-04 21:46:38,841 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:38,841 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-04 21:46:38,841 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-04 21:46:38,841 INFO L430 AbstractCegarLoop]: === Iteration 20 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:38,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:38,842 INFO L82 PathProgramCache]: Analyzing trace with hash -338879573, now seen corresponding path program 6 times [2021-06-04 21:46:38,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:38,842 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94204378] [2021-06-04 21:46:38,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:38,926 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-04 21:46:38,926 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:38,927 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94204378] [2021-06-04 21:46:38,927 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94204378] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:38,927 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:38,927 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-04 21:46:38,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221156781] [2021-06-04 21:46:38,927 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-04 21:46:38,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:38,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-04 21:46:38,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-04 21:46:38,928 INFO L87 Difference]: Start difference. First operand 16824 states and 54656 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 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-04 21:46:39,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:39,199 INFO L93 Difference]: Finished difference Result 18541 states and 59862 transitions. [2021-06-04 21:46:39,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-04 21:46:39,200 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 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-04 21:46:39,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:39,230 INFO L225 Difference]: With dead ends: 18541 [2021-06-04 21:46:39,230 INFO L226 Difference]: Without dead ends: 18265 [2021-06-04 21:46:39,230 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 95.2ms TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-06-04 21:46:39,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18265 states. [2021-06-04 21:46:39,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18265 to 16503. [2021-06-04 21:46:39,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16503 states, 16501 states have (on average 3.242773165262711) internal successors, (53509), 16502 states have internal predecessors, (53509), 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-04 21:46:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16503 states to 16503 states and 53509 transitions. [2021-06-04 21:46:39,505 INFO L78 Accepts]: Start accepts. Automaton has 16503 states and 53509 transitions. Word has length 80 [2021-06-04 21:46:39,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:39,505 INFO L482 AbstractCegarLoop]: Abstraction has 16503 states and 53509 transitions. [2021-06-04 21:46:39,506 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 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-04 21:46:39,506 INFO L276 IsEmpty]: Start isEmpty. Operand 16503 states and 53509 transitions. [2021-06-04 21:46:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-04 21:46:39,528 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:39,528 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-04 21:46:39,528 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-04 21:46:39,528 INFO L430 AbstractCegarLoop]: === Iteration 21 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:39,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:39,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1579578581, now seen corresponding path program 4 times [2021-06-04 21:46:39,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:39,529 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702935742] [2021-06-04 21:46:39,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:39,611 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-04 21:46:39,611 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:39,611 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702935742] [2021-06-04 21:46:39,611 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702935742] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:39,611 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:39,611 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-04 21:46:39,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161925530] [2021-06-04 21:46:39,612 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-04 21:46:39,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:39,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-04 21:46:39,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-04 21:46:39,612 INFO L87 Difference]: Start difference. First operand 16503 states and 53509 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 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-04 21:46:40,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:40,023 INFO L93 Difference]: Finished difference Result 17880 states and 57935 transitions. [2021-06-04 21:46:40,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-04 21:46:40,024 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 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-04 21:46:40,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:40,051 INFO L225 Difference]: With dead ends: 17880 [2021-06-04 21:46:40,052 INFO L226 Difference]: Without dead ends: 17880 [2021-06-04 21:46:40,052 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 118.4ms TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2021-06-04 21:46:40,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17880 states. [2021-06-04 21:46:40,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17880 to 16062. [2021-06-04 21:46:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16062 states, 16060 states have (on average 3.2597135740971357) internal successors, (52351), 16061 states have internal predecessors, (52351), 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-04 21:46:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16062 states to 16062 states and 52351 transitions. [2021-06-04 21:46:40,314 INFO L78 Accepts]: Start accepts. Automaton has 16062 states and 52351 transitions. Word has length 80 [2021-06-04 21:46:40,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:40,315 INFO L482 AbstractCegarLoop]: Abstraction has 16062 states and 52351 transitions. [2021-06-04 21:46:40,315 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 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-04 21:46:40,315 INFO L276 IsEmpty]: Start isEmpty. Operand 16062 states and 52351 transitions. [2021-06-04 21:46:40,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-04 21:46:40,335 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:40,335 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, 1] [2021-06-04 21:46:40,335 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-04 21:46:40,336 INFO L430 AbstractCegarLoop]: === Iteration 22 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:40,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:40,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1349824490, now seen corresponding path program 1 times [2021-06-04 21:46:40,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:40,336 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506260291] [2021-06-04 21:46:40,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:40,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-04 21:46:40,421 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:40,421 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506260291] [2021-06-04 21:46:40,421 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506260291] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:40,421 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:40,421 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-04 21:46:40,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180059229] [2021-06-04 21:46:40,421 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-04 21:46:40,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:40,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-04 21:46:40,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-04 21:46:40,422 INFO L87 Difference]: Start difference. First operand 16062 states and 52351 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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-04 21:46:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:40,723 INFO L93 Difference]: Finished difference Result 18280 states and 58875 transitions. [2021-06-04 21:46:40,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-04 21:46:40,724 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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 83 [2021-06-04 21:46:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:40,759 INFO L225 Difference]: With dead ends: 18280 [2021-06-04 21:46:40,759 INFO L226 Difference]: Without dead ends: 18004 [2021-06-04 21:46:40,760 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 111.5ms TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-06-04 21:46:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18004 states. [2021-06-04 21:46:40,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18004 to 16212. [2021-06-04 21:46:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16212 states, 16210 states have (on average 3.2336212214682294) internal successors, (52417), 16211 states have internal predecessors, (52417), 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-04 21:46:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16212 states to 16212 states and 52417 transitions. [2021-06-04 21:46:41,039 INFO L78 Accepts]: Start accepts. Automaton has 16212 states and 52417 transitions. Word has length 83 [2021-06-04 21:46:41,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:41,039 INFO L482 AbstractCegarLoop]: Abstraction has 16212 states and 52417 transitions. [2021-06-04 21:46:41,039 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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-04 21:46:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 16212 states and 52417 transitions. [2021-06-04 21:46:41,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-04 21:46:41,060 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:41,060 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, 1] [2021-06-04 21:46:41,060 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-04 21:46:41,060 INFO L430 AbstractCegarLoop]: === Iteration 23 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:41,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:41,061 INFO L82 PathProgramCache]: Analyzing trace with hash -2120740758, now seen corresponding path program 1 times [2021-06-04 21:46:41,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:41,061 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133294526] [2021-06-04 21:46:41,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:41,145 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-04 21:46:41,145 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:41,146 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133294526] [2021-06-04 21:46:41,146 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133294526] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:41,146 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:41,146 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-04 21:46:41,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201550526] [2021-06-04 21:46:41,146 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-04 21:46:41,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:41,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-04 21:46:41,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-04 21:46:41,147 INFO L87 Difference]: Start difference. First operand 16212 states and 52417 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 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-04 21:46:41,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:41,500 INFO L93 Difference]: Finished difference Result 17616 states and 56917 transitions. [2021-06-04 21:46:41,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-04 21:46:41,500 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 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 83 [2021-06-04 21:46:41,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:41,528 INFO L225 Difference]: With dead ends: 17616 [2021-06-04 21:46:41,528 INFO L226 Difference]: Without dead ends: 17616 [2021-06-04 21:46:41,528 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 121.4ms TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2021-06-04 21:46:41,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17616 states. [2021-06-04 21:46:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17616 to 16107. [2021-06-04 21:46:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16107 states, 16105 states have (on average 3.2376280658180687) internal successors, (52142), 16106 states have internal predecessors, (52142), 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-04 21:46:41,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16107 states to 16107 states and 52142 transitions. [2021-06-04 21:46:41,788 INFO L78 Accepts]: Start accepts. Automaton has 16107 states and 52142 transitions. Word has length 83 [2021-06-04 21:46:41,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:41,788 INFO L482 AbstractCegarLoop]: Abstraction has 16107 states and 52142 transitions. [2021-06-04 21:46:41,788 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 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-04 21:46:41,788 INFO L276 IsEmpty]: Start isEmpty. Operand 16107 states and 52142 transitions. [2021-06-04 21:46:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-04 21:46:41,808 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:41,808 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, 1] [2021-06-04 21:46:41,809 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-04 21:46:41,809 INFO L430 AbstractCegarLoop]: === Iteration 24 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:41,809 INFO L82 PathProgramCache]: Analyzing trace with hash 431227184, now seen corresponding path program 2 times [2021-06-04 21:46:41,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:41,809 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655388837] [2021-06-04 21:46:41,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:41,896 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-04 21:46:41,897 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:41,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655388837] [2021-06-04 21:46:41,897 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655388837] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:41,897 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:41,897 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-04 21:46:41,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675676753] [2021-06-04 21:46:41,897 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-04 21:46:41,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:41,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-04 21:46:41,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-04 21:46:41,898 INFO L87 Difference]: Start difference. First operand 16107 states and 52142 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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-04 21:46:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:42,207 INFO L93 Difference]: Finished difference Result 17749 states and 57301 transitions. [2021-06-04 21:46:42,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-04 21:46:42,208 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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 83 [2021-06-04 21:46:42,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:42,246 INFO L225 Difference]: With dead ends: 17749 [2021-06-04 21:46:42,246 INFO L226 Difference]: Without dead ends: 17749 [2021-06-04 21:46:42,247 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 100.7ms TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-06-04 21:46:42,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17749 states. [2021-06-04 21:46:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17749 to 16062. [2021-06-04 21:46:42,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16062 states, 16060 states have (on average 3.240161892901619) internal successors, (52037), 16061 states have internal predecessors, (52037), 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-04 21:46:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16062 states to 16062 states and 52037 transitions. [2021-06-04 21:46:42,554 INFO L78 Accepts]: Start accepts. Automaton has 16062 states and 52037 transitions. Word has length 83 [2021-06-04 21:46:42,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:42,554 INFO L482 AbstractCegarLoop]: Abstraction has 16062 states and 52037 transitions. [2021-06-04 21:46:42,554 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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-04 21:46:42,554 INFO L276 IsEmpty]: Start isEmpty. Operand 16062 states and 52037 transitions. [2021-06-04 21:46:42,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-04 21:46:42,575 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:42,575 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, 1] [2021-06-04 21:46:42,575 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-04 21:46:42,575 INFO L430 AbstractCegarLoop]: === Iteration 25 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:42,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:42,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1255629232, now seen corresponding path program 2 times [2021-06-04 21:46:42,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:42,576 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348053937] [2021-06-04 21:46:42,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:42,664 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-04 21:46:42,664 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:42,664 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348053937] [2021-06-04 21:46:42,664 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348053937] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:42,664 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:42,664 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-04 21:46:42,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912279346] [2021-06-04 21:46:42,665 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-04 21:46:42,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:42,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-04 21:46:42,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-06-04 21:46:42,665 INFO L87 Difference]: Start difference. First operand 16062 states and 52037 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 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-04 21:46:43,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:43,076 INFO L93 Difference]: Finished difference Result 17289 states and 56133 transitions. [2021-06-04 21:46:43,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-04 21:46:43,077 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 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 83 [2021-06-04 21:46:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:43,104 INFO L225 Difference]: With dead ends: 17289 [2021-06-04 21:46:43,104 INFO L226 Difference]: Without dead ends: 17289 [2021-06-04 21:46:43,105 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 146.8ms TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2021-06-04 21:46:43,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17289 states. [2021-06-04 21:46:43,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17289 to 15621. [2021-06-04 21:46:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15621 states, 15619 states have (on average 3.257506882642935) internal successors, (50879), 15620 states have internal predecessors, (50879), 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-04 21:46:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15621 states to 15621 states and 50879 transitions. [2021-06-04 21:46:43,366 INFO L78 Accepts]: Start accepts. Automaton has 15621 states and 50879 transitions. Word has length 83 [2021-06-04 21:46:43,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:43,366 INFO L482 AbstractCegarLoop]: Abstraction has 15621 states and 50879 transitions. [2021-06-04 21:46:43,366 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 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-04 21:46:43,366 INFO L276 IsEmpty]: Start isEmpty. Operand 15621 states and 50879 transitions. [2021-06-04 21:46:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-04 21:46:43,387 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:43,387 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, 1, 1, 1, 1, 1, 1] [2021-06-04 21:46:43,387 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-04 21:46:43,387 INFO L430 AbstractCegarLoop]: === Iteration 26 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:43,387 INFO L82 PathProgramCache]: Analyzing trace with hash -885242066, now seen corresponding path program 1 times [2021-06-04 21:46:43,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:43,387 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892363783] [2021-06-04 21:46:43,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:43,418 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-04 21:46:43,418 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:43,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892363783] [2021-06-04 21:46:43,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892363783] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:43,419 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:43,419 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-04 21:46:43,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142909377] [2021-06-04 21:46:43,419 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-04 21:46:43,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:43,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-04 21:46:43,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-04 21:46:43,420 INFO L87 Difference]: Start difference. First operand 15621 states and 50879 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-04 21:46:43,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:43,505 INFO L93 Difference]: Finished difference Result 16128 states and 52183 transitions. [2021-06-04 21:46:43,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-04 21:46:43,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 88 [2021-06-04 21:46:43,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:43,539 INFO L225 Difference]: With dead ends: 16128 [2021-06-04 21:46:43,539 INFO L226 Difference]: Without dead ends: 16088 [2021-06-04 21:46:43,539 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-04 21:46:43,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16088 states. [2021-06-04 21:46:43,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16088 to 15661. [2021-06-04 21:46:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15661 states, 15659 states have (on average 3.256210485982502) internal successors, (50989), 15660 states have internal predecessors, (50989), 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-04 21:46:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15661 states to 15661 states and 50989 transitions. [2021-06-04 21:46:43,815 INFO L78 Accepts]: Start accepts. Automaton has 15661 states and 50989 transitions. Word has length 88 [2021-06-04 21:46:43,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:43,815 INFO L482 AbstractCegarLoop]: Abstraction has 15661 states and 50989 transitions. [2021-06-04 21:46:43,815 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-04 21:46:43,815 INFO L276 IsEmpty]: Start isEmpty. Operand 15661 states and 50989 transitions. [2021-06-04 21:46:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-04 21:46:43,835 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:43,835 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, 1, 1, 1, 1, 1, 1] [2021-06-04 21:46:43,835 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-04 21:46:43,836 INFO L430 AbstractCegarLoop]: === Iteration 27 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:43,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:43,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1889836918, now seen corresponding path program 2 times [2021-06-04 21:46:43,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:43,836 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403507457] [2021-06-04 21:46:43,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:43,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-04 21:46:43,895 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:43,895 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403507457] [2021-06-04 21:46:43,895 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403507457] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:43,895 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:43,895 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-04 21:46:43,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340910760] [2021-06-04 21:46:43,896 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-04 21:46:43,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:43,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-04 21:46:43,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-04 21:46:43,896 INFO L87 Difference]: Start difference. First operand 15661 states and 50989 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-04 21:46:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:44,069 INFO L93 Difference]: Finished difference Result 16216 states and 52472 transitions. [2021-06-04 21:46:44,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-04 21:46:44,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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 88 [2021-06-04 21:46:44,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:44,097 INFO L225 Difference]: With dead ends: 16216 [2021-06-04 21:46:44,097 INFO L226 Difference]: Without dead ends: 15915 [2021-06-04 21:46:44,097 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 46.8ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-06-04 21:46:44,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15915 states. [2021-06-04 21:46:44,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15915 to 15801. [2021-06-04 21:46:44,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15801 states, 15799 states have (on average 3.251724792708399) internal successors, (51374), 15800 states have internal predecessors, (51374), 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-04 21:46:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15801 states to 15801 states and 51374 transitions. [2021-06-04 21:46:44,416 INFO L78 Accepts]: Start accepts. Automaton has 15801 states and 51374 transitions. Word has length 88 [2021-06-04 21:46:44,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:44,417 INFO L482 AbstractCegarLoop]: Abstraction has 15801 states and 51374 transitions. [2021-06-04 21:46:44,417 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-04 21:46:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 15801 states and 51374 transitions. [2021-06-04 21:46:44,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-04 21:46:44,437 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:44,437 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, 1, 1, 1, 1, 1, 1] [2021-06-04 21:46:44,437 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-04 21:46:44,437 INFO L430 AbstractCegarLoop]: === Iteration 28 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:44,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:44,438 INFO L82 PathProgramCache]: Analyzing trace with hash 278202074, now seen corresponding path program 3 times [2021-06-04 21:46:44,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:44,438 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65810388] [2021-06-04 21:46:44,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:44,499 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-04 21:46:44,499 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:44,499 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65810388] [2021-06-04 21:46:44,499 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65810388] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:44,499 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:44,500 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-04 21:46:44,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656057040] [2021-06-04 21:46:44,500 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-04 21:46:44,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:44,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-04 21:46:44,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-04 21:46:44,501 INFO L87 Difference]: Start difference. First operand 15801 states and 51374 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-04 21:46:44,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:44,677 INFO L93 Difference]: Finished difference Result 16416 states and 53022 transitions. [2021-06-04 21:46:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-04 21:46:44,677 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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 88 [2021-06-04 21:46:44,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:44,704 INFO L225 Difference]: With dead ends: 16416 [2021-06-04 21:46:44,704 INFO L226 Difference]: Without dead ends: 16087 [2021-06-04 21:46:44,704 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 61.1ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-06-04 21:46:44,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16087 states. [2021-06-04 21:46:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16087 to 15821. [2021-06-04 21:46:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15821 states, 15819 states have (on average 3.2510904608382325) internal successors, (51429), 15820 states have internal predecessors, (51429), 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-04 21:46:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15821 states to 15821 states and 51429 transitions. [2021-06-04 21:46:44,960 INFO L78 Accepts]: Start accepts. Automaton has 15821 states and 51429 transitions. Word has length 88 [2021-06-04 21:46:44,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:44,961 INFO L482 AbstractCegarLoop]: Abstraction has 15821 states and 51429 transitions. [2021-06-04 21:46:44,961 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-04 21:46:44,961 INFO L276 IsEmpty]: Start isEmpty. Operand 15821 states and 51429 transitions. [2021-06-04 21:46:44,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-04 21:46:44,982 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:44,982 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, 1, 1, 1, 1, 1, 1] [2021-06-04 21:46:44,982 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-04 21:46:44,982 INFO L430 AbstractCegarLoop]: === Iteration 29 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:44,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:44,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1324373216, now seen corresponding path program 4 times [2021-06-04 21:46:44,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:44,982 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881337289] [2021-06-04 21:46:44,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:45,041 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-04 21:46:45,041 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:45,041 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881337289] [2021-06-04 21:46:45,042 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881337289] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:45,042 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:45,042 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-04 21:46:45,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744433113] [2021-06-04 21:46:45,042 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-04 21:46:45,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:45,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-04 21:46:45,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-04 21:46:45,043 INFO L87 Difference]: Start difference. First operand 15821 states and 51429 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-04 21:46:45,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:45,218 INFO L93 Difference]: Finished difference Result 17695 states and 57349 transitions. [2021-06-04 21:46:45,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-04 21:46:45,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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 88 [2021-06-04 21:46:45,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:45,241 INFO L225 Difference]: With dead ends: 17695 [2021-06-04 21:46:45,241 INFO L226 Difference]: Without dead ends: 13977 [2021-06-04 21:46:45,241 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 51.2ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-06-04 21:46:45,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13977 states. [2021-06-04 21:46:45,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13977 to 12090. [2021-06-04 21:46:45,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12090 states, 12088 states have (on average 3.2413964262078094) internal successors, (39182), 12089 states have internal predecessors, (39182), 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-04 21:46:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12090 states to 12090 states and 39182 transitions. [2021-06-04 21:46:45,441 INFO L78 Accepts]: Start accepts. Automaton has 12090 states and 39182 transitions. Word has length 88 [2021-06-04 21:46:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:45,441 INFO L482 AbstractCegarLoop]: Abstraction has 12090 states and 39182 transitions. [2021-06-04 21:46:45,441 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-04 21:46:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 12090 states and 39182 transitions. [2021-06-04 21:46:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-06-04 21:46:45,456 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:45,456 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:46:45,456 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-04 21:46:45,456 INFO L430 AbstractCegarLoop]: === Iteration 30 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:45,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:45,457 INFO L82 PathProgramCache]: Analyzing trace with hash 538809417, now seen corresponding path program 1 times [2021-06-04 21:46:45,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:45,457 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948483843] [2021-06-04 21:46:45,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:45,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-04 21:46:45,507 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:45,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948483843] [2021-06-04 21:46:45,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948483843] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:45,507 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:45,507 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-04 21:46:45,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388633507] [2021-06-04 21:46:45,508 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-04 21:46:45,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:45,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-04 21:46:45,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-04 21:46:45,508 INFO L87 Difference]: Start difference. First operand 12090 states and 39182 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-04 21:46:45,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:45,655 INFO L93 Difference]: Finished difference Result 13167 states and 42694 transitions. [2021-06-04 21:46:45,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-04 21:46:45,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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 91 [2021-06-04 21:46:45,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:45,678 INFO L225 Difference]: With dead ends: 13167 [2021-06-04 21:46:45,679 INFO L226 Difference]: Without dead ends: 11307 [2021-06-04 21:46:45,679 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 51.6ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-06-04 21:46:45,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11307 states. [2021-06-04 21:46:45,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11307 to 10335. [2021-06-04 21:46:45,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10335 states, 10333 states have (on average 3.2374915319849027) internal successors, (33453), 10334 states have internal predecessors, (33453), 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-04 21:46:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10335 states to 10335 states and 33453 transitions. [2021-06-04 21:46:45,859 INFO L78 Accepts]: Start accepts. Automaton has 10335 states and 33453 transitions. Word has length 91 [2021-06-04 21:46:45,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:45,859 INFO L482 AbstractCegarLoop]: Abstraction has 10335 states and 33453 transitions. [2021-06-04 21:46:45,859 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-04 21:46:45,859 INFO L276 IsEmpty]: Start isEmpty. Operand 10335 states and 33453 transitions. [2021-06-04 21:46:45,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-06-04 21:46:45,871 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:45,871 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:46:45,871 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-04 21:46:45,871 INFO L430 AbstractCegarLoop]: === Iteration 31 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:45,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:45,872 INFO L82 PathProgramCache]: Analyzing trace with hash -899785151, now seen corresponding path program 2 times [2021-06-04 21:46:45,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:45,872 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877050772] [2021-06-04 21:46:45,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:45,931 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-04 21:46:45,931 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:45,932 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877050772] [2021-06-04 21:46:45,932 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877050772] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:45,932 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:45,932 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-04 21:46:45,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614532747] [2021-06-04 21:46:45,932 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-04 21:46:45,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:45,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-04 21:46:45,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-04 21:46:45,933 INFO L87 Difference]: Start difference. First operand 10335 states and 33453 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-04 21:46:46,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:46,100 INFO L93 Difference]: Finished difference Result 12224 states and 39266 transitions. [2021-06-04 21:46:46,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-04 21:46:46,100 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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 91 [2021-06-04 21:46:46,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:46,119 INFO L225 Difference]: With dead ends: 12224 [2021-06-04 21:46:46,119 INFO L226 Difference]: Without dead ends: 9745 [2021-06-04 21:46:46,120 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 57.8ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-06-04 21:46:46,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9745 states. [2021-06-04 21:46:46,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9745 to 9345. [2021-06-04 21:46:46,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9345 states, 9343 states have (on average 3.2163116771914804) internal successors, (30050), 9344 states have internal predecessors, (30050), 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-04 21:46:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9345 states to 9345 states and 30050 transitions. [2021-06-04 21:46:46,257 INFO L78 Accepts]: Start accepts. Automaton has 9345 states and 30050 transitions. Word has length 91 [2021-06-04 21:46:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:46,257 INFO L482 AbstractCegarLoop]: Abstraction has 9345 states and 30050 transitions. [2021-06-04 21:46:46,258 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-04 21:46:46,258 INFO L276 IsEmpty]: Start isEmpty. Operand 9345 states and 30050 transitions. [2021-06-04 21:46:46,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-06-04 21:46:46,268 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:46,269 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:46:46,269 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-04 21:46:46,269 INFO L430 AbstractCegarLoop]: === Iteration 32 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:46,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:46,269 INFO L82 PathProgramCache]: Analyzing trace with hash -998964956, now seen corresponding path program 1 times [2021-06-04 21:46:46,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:46,270 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394646020] [2021-06-04 21:46:46,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:46,340 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-04 21:46:46,341 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:46,341 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394646020] [2021-06-04 21:46:46,341 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394646020] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:46,341 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:46,341 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-04 21:46:46,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24356101] [2021-06-04 21:46:46,341 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-04 21:46:46,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:46,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-04 21:46:46,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-04 21:46:46,343 INFO L87 Difference]: Start difference. First operand 9345 states and 30050 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-04 21:46:46,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:46,474 INFO L93 Difference]: Finished difference Result 9273 states and 29916 transitions. [2021-06-04 21:46:46,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-04 21:46:46,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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 91 [2021-06-04 21:46:46,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:46,488 INFO L225 Difference]: With dead ends: 9273 [2021-06-04 21:46:46,488 INFO L226 Difference]: Without dead ends: 6834 [2021-06-04 21:46:46,489 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 56.4ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-06-04 21:46:46,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6834 states. [2021-06-04 21:46:46,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6834 to 6834. [2021-06-04 21:46:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6834 states, 6833 states have (on average 3.2654763647007172) internal successors, (22313), 6833 states have internal predecessors, (22313), 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-04 21:46:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6834 states to 6834 states and 22313 transitions. [2021-06-04 21:46:46,610 INFO L78 Accepts]: Start accepts. Automaton has 6834 states and 22313 transitions. Word has length 91 [2021-06-04 21:46:46,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:46,611 INFO L482 AbstractCegarLoop]: Abstraction has 6834 states and 22313 transitions. [2021-06-04 21:46:46,611 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-04 21:46:46,611 INFO L276 IsEmpty]: Start isEmpty. Operand 6834 states and 22313 transitions. [2021-06-04 21:46:46,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-06-04 21:46:46,619 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:46,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:46:46,619 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-04 21:46:46,619 INFO L430 AbstractCegarLoop]: === Iteration 33 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:46,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:46,620 INFO L82 PathProgramCache]: Analyzing trace with hash -876030795, now seen corresponding path program 3 times [2021-06-04 21:46:46,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:46,620 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487205291] [2021-06-04 21:46:46,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:46,680 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-04 21:46:46,681 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:46,681 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487205291] [2021-06-04 21:46:46,681 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487205291] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:46,681 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:46,681 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-04 21:46:46,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373443890] [2021-06-04 21:46:46,681 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-04 21:46:46,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:46,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-04 21:46:46,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-04 21:46:46,682 INFO L87 Difference]: Start difference. First operand 6834 states and 22313 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-04 21:46:46,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:46,795 INFO L93 Difference]: Finished difference Result 7523 states and 24177 transitions. [2021-06-04 21:46:46,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-04 21:46:46,795 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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 91 [2021-06-04 21:46:46,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:46,810 INFO L225 Difference]: With dead ends: 7523 [2021-06-04 21:46:46,810 INFO L226 Difference]: Without dead ends: 7222 [2021-06-04 21:46:46,812 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 51.1ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-06-04 21:46:46,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7222 states. [2021-06-04 21:46:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7222 to 6810. [2021-06-04 21:46:46,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6810 states, 6809 states have (on average 3.267293288294904) internal successors, (22247), 6809 states have internal predecessors, (22247), 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-04 21:46:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6810 states to 6810 states and 22247 transitions. [2021-06-04 21:46:46,927 INFO L78 Accepts]: Start accepts. Automaton has 6810 states and 22247 transitions. Word has length 91 [2021-06-04 21:46:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:46,927 INFO L482 AbstractCegarLoop]: Abstraction has 6810 states and 22247 transitions. [2021-06-04 21:46:46,927 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-04 21:46:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 6810 states and 22247 transitions. [2021-06-04 21:46:46,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-06-04 21:46:46,936 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:46,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:46:46,936 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-04 21:46:46,936 INFO L430 AbstractCegarLoop]: === Iteration 34 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:46,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:46,937 INFO L82 PathProgramCache]: Analyzing trace with hash 513136423, now seen corresponding path program 4 times [2021-06-04 21:46:46,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:46,937 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350468335] [2021-06-04 21:46:46,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:46,964 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-04 21:46:46,964 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:46,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350468335] [2021-06-04 21:46:46,964 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350468335] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:46,964 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:46,964 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-04 21:46:46,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875226018] [2021-06-04 21:46:46,964 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-04 21:46:46,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:46,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-04 21:46:46,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-04 21:46:46,965 INFO L87 Difference]: Start difference. First operand 6810 states and 22247 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-04 21:46:47,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:47,014 INFO L93 Difference]: Finished difference Result 7362 states and 23656 transitions. [2021-06-04 21:46:47,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-04 21:46:47,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 91 [2021-06-04 21:46:47,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:47,028 INFO L225 Difference]: With dead ends: 7362 [2021-06-04 21:46:47,029 INFO L226 Difference]: Without dead ends: 7322 [2021-06-04 21:46:47,029 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-04 21:46:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7322 states. [2021-06-04 21:46:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7322 to 6850. [2021-06-04 21:46:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6850 states, 6849 states have (on average 3.2642721565192) internal successors, (22357), 6849 states have internal predecessors, (22357), 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-04 21:46:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6850 states to 6850 states and 22357 transitions. [2021-06-04 21:46:47,122 INFO L78 Accepts]: Start accepts. Automaton has 6850 states and 22357 transitions. Word has length 91 [2021-06-04 21:46:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:47,122 INFO L482 AbstractCegarLoop]: Abstraction has 6850 states and 22357 transitions. [2021-06-04 21:46:47,122 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-04 21:46:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 6850 states and 22357 transitions. [2021-06-04 21:46:47,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-06-04 21:46:47,130 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:47,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:46:47,130 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-04 21:46:47,130 INFO L430 AbstractCegarLoop]: === Iteration 35 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:47,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:47,130 INFO L82 PathProgramCache]: Analyzing trace with hash 733479027, now seen corresponding path program 5 times [2021-06-04 21:46:47,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:47,130 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999219144] [2021-06-04 21:46:47,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:47,186 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-04 21:46:47,187 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:47,187 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999219144] [2021-06-04 21:46:47,187 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999219144] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:47,187 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:47,187 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-04 21:46:47,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507173263] [2021-06-04 21:46:47,187 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-04 21:46:47,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:47,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-04 21:46:47,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-04 21:46:47,188 INFO L87 Difference]: Start difference. First operand 6850 states and 22357 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-04 21:46:47,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:47,323 INFO L93 Difference]: Finished difference Result 7349 states and 23675 transitions. [2021-06-04 21:46:47,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-04 21:46:47,323 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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 91 [2021-06-04 21:46:47,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:47,337 INFO L225 Difference]: With dead ends: 7349 [2021-06-04 21:46:47,338 INFO L226 Difference]: Without dead ends: 7020 [2021-06-04 21:46:47,338 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 63.4ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-06-04 21:46:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7020 states. [2021-06-04 21:46:47,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7020 to 5620. [2021-06-04 21:46:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5620 states, 5619 states have (on average 3.2642819006940735) internal successors, (18342), 5619 states have internal predecessors, (18342), 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-04 21:46:47,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5620 states to 5620 states and 18342 transitions. [2021-06-04 21:46:47,454 INFO L78 Accepts]: Start accepts. Automaton has 5620 states and 18342 transitions. Word has length 91 [2021-06-04 21:46:47,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:47,454 INFO L482 AbstractCegarLoop]: Abstraction has 5620 states and 18342 transitions. [2021-06-04 21:46:47,454 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-04 21:46:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand 5620 states and 18342 transitions. [2021-06-04 21:46:47,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-06-04 21:46:47,463 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:46:47,463 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:46:47,463 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-04 21:46:47,463 INFO L430 AbstractCegarLoop]: === Iteration 36 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:46:47,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:46:47,464 INFO L82 PathProgramCache]: Analyzing trace with hash -719902876, now seen corresponding path program 1 times [2021-06-04 21:46:47,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:46:47,464 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978207490] [2021-06-04 21:46:47,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:46:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:46:47,531 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-04 21:46:47,532 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:46:47,532 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978207490] [2021-06-04 21:46:47,532 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978207490] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:46:47,532 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:46:47,532 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-04 21:46:47,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190761333] [2021-06-04 21:46:47,532 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-04 21:46:47,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:46:47,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-04 21:46:47,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-04 21:46:47,533 INFO L87 Difference]: Start difference. First operand 5620 states and 18342 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 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-04 21:46:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:46:47,614 INFO L93 Difference]: Finished difference Result 5503 states and 18103 transitions. [2021-06-04 21:46:47,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-04 21:46:47,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 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 94 [2021-06-04 21:46:47,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:46:47,615 INFO L225 Difference]: With dead ends: 5503 [2021-06-04 21:46:47,615 INFO L226 Difference]: Without dead ends: 0 [2021-06-04 21:46:47,615 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 47.9ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-06-04 21:46:47,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-04 21:46:47,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-04 21:46:47,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-04 21:46:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-04 21:46:47,616 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2021-06-04 21:46:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:46:47,616 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-04 21:46:47,616 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 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-04 21:46:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-04 21:46:47,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-04 21:46:47,616 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-04 21:46:47,618 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-04 21:46:47,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 09:46:47 BasicIcfg [2021-06-04 21:46:47,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-04 21:46:47,621 INFO L168 Benchmark]: Toolchain (without parser) took 73542.68 ms. Allocated memory was 341.8 MB in the beginning and 15.2 GB in the end (delta: 14.9 GB). Free memory was 304.1 MB in the beginning and 8.2 GB in the end (delta: -7.9 GB). Peak memory consumption was 6.9 GB. Max. memory is 16.0 GB. [2021-06-04 21:46:47,621 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 341.8 MB. Free memory is still 322.5 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-04 21:46:47,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 548.95 ms. Allocated memory is still 341.8 MB. Free memory was 303.9 MB in the beginning and 301.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. [2021-06-04 21:46:47,621 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.40 ms. Allocated memory is still 341.8 MB. Free memory was 301.1 MB in the beginning and 298.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-04 21:46:47,621 INFO L168 Benchmark]: Boogie Preprocessor took 55.34 ms. Allocated memory is still 341.8 MB. Free memory was 298.0 MB in the beginning and 295.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-04 21:46:47,621 INFO L168 Benchmark]: RCFGBuilder took 1073.89 ms. Allocated memory is still 341.8 MB. Free memory was 295.9 MB in the beginning and 195.2 MB in the end (delta: 100.7 MB). Peak memory consumption was 100.7 MB. Max. memory is 16.0 GB. [2021-06-04 21:46:47,621 INFO L168 Benchmark]: TraceAbstraction took 71782.42 ms. Allocated memory was 341.8 MB in the beginning and 15.2 GB in the end (delta: 14.9 GB). Free memory was 194.2 MB in the beginning and 8.2 GB in the end (delta: -8.1 GB). Peak memory consumption was 6.8 GB. Max. memory is 16.0 GB. [2021-06-04 21:46:47,622 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 341.8 MB. Free memory is still 322.5 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 548.95 ms. Allocated memory is still 341.8 MB. Free memory was 303.9 MB in the beginning and 301.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 76.40 ms. Allocated memory is still 341.8 MB. Free memory was 301.1 MB in the beginning and 298.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 55.34 ms. Allocated memory is still 341.8 MB. Free memory was 298.0 MB in the beginning and 295.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1073.89 ms. Allocated memory is still 341.8 MB. Free memory was 295.9 MB in the beginning and 195.2 MB in the end (delta: 100.7 MB). Peak memory consumption was 100.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 71782.42 ms. Allocated memory was 341.8 MB in the beginning and 15.2 GB in the end (delta: 14.9 GB). Free memory was 194.2 MB in the beginning and 8.2 GB in the end (delta: -8.1 GB). Peak memory consumption was 6.8 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 712]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 719]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 264 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 71577.3ms, OverallIterations: 36, TraceHistogramMax: 1, EmptinessCheckTime: 2061.9ms, AutomataDifference: 18662.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 11061.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 9013 SDtfs, 14940 SDslu, 29844 SDs, 0 SdLazy, 6379 SolverSat, 673 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3003.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 80 SyntacticMatches, 9 SemanticMatches, 367 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 2333.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=112214occurred in iteration=4, InterpolantAutomatonStates: 352, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 36617.2ms AutomataMinimizationTime, 36 MinimizatonAttempts, 71084 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 91.5ms SsaConstructionTime, 384.3ms SatisfiabilityAnalysisTime, 2382.0ms InterpolantComputationTime, 2885 NumberOfCodeBlocks, 2885 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2849 ConstructedInterpolants, 0 QuantifiedInterpolants, 15257 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...