/usr/bin/java -Xmx8000000000 -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/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-03 16:01:33,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 16:01:33,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 16:01:33,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 16:01:33,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 16:01:33,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 16:01:33,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 16:01:33,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 16:01:33,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 16:01:33,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 16:01:33,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 16:01:33,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 16:01:33,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 16:01:33,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 16:01:33,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 16:01:33,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 16:01:33,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 16:01:33,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 16:01:33,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 16:01:33,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 16:01:33,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 16:01:33,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 16:01:33,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 16:01:33,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 16:01:33,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 16:01:33,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 16:01:33,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 16:01:33,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 16:01:33,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 16:01:33,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 16:01:33,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 16:01:33,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 16:01:33,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 16:01:33,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 16:01:33,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 16:01:33,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 16:01:33,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 16:01:33,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 16:01:33,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 16:01:33,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 16:01:33,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 16:01:33,927 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 [2022-03-03 16:01:33,960 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 16:01:33,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 16:01:33,961 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 16:01:33,961 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 16:01:33,962 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 16:01:33,962 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 16:01:33,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 16:01:33,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 16:01:33,963 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 16:01:33,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 16:01:33,964 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 16:01:33,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 16:01:33,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 16:01:33,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 16:01:33,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 16:01:33,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 16:01:33,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 16:01:33,964 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 16:01:33,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 16:01:33,965 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 16:01:33,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 16:01:33,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 16:01:33,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 16:01:33,965 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 16:01:33,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 16:01:33,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 16:01:33,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 16:01:33,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 16:01:33,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 16:01:33,967 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 16:01:33,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 16:01:33,967 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 16:01:33,967 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 16:01:33,967 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 [2022-03-03 16:01:34,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 16:01:34,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 16:01:34,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 16:01:34,233 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 16:01:34,234 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 16:01:34,235 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2022-03-03 16:01:34,287 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e37c3ea89/17d769772c3d47f7ae67fdc569b8acbb/FLAGaf7543da9 [2022-03-03 16:01:34,756 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 16:01:34,756 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2022-03-03 16:01:34,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e37c3ea89/17d769772c3d47f7ae67fdc569b8acbb/FLAGaf7543da9 [2022-03-03 16:01:35,088 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e37c3ea89/17d769772c3d47f7ae67fdc569b8acbb [2022-03-03 16:01:35,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 16:01:35,092 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 16:01:35,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 16:01:35,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 16:01:35,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 16:01:35,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:01:35" (1/1) ... [2022-03-03 16:01:35,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@484fbe4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:35, skipping insertion in model container [2022-03-03 16:01:35,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:01:35" (1/1) ... [2022-03-03 16:01:35,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 16:01:35,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 16:01:35,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2022-03-03 16:01:35,681 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2022-03-03 16:01:35,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 16:01:35,694 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 16:01:35,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2022-03-03 16:01:35,755 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2022-03-03 16:01:35,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 16:01:35,799 INFO L208 MainTranslator]: Completed translation [2022-03-03 16:01:35,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:35 WrapperNode [2022-03-03 16:01:35,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 16:01:35,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 16:01:35,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 16:01:35,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 16:01:35,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:35" (1/1) ... [2022-03-03 16:01:35,824 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:35" (1/1) ... [2022-03-03 16:01:35,847 INFO L137 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2022-03-03 16:01:35,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 16:01:35,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 16:01:35,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 16:01:35,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 16:01:35,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:35" (1/1) ... [2022-03-03 16:01:35,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:35" (1/1) ... [2022-03-03 16:01:35,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:35" (1/1) ... [2022-03-03 16:01:35,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:35" (1/1) ... [2022-03-03 16:01:35,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:35" (1/1) ... [2022-03-03 16:01:35,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:35" (1/1) ... [2022-03-03 16:01:35,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:35" (1/1) ... [2022-03-03 16:01:35,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 16:01:35,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 16:01:35,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 16:01:35,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 16:01:35,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:35" (1/1) ... [2022-03-03 16:01:35,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 16:01:35,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 16:01:35,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-03 16:01:35,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-03 16:01:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-03-03 16:01:35,950 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-03-03 16:01:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-03-03 16:01:35,950 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-03-03 16:01:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 16:01:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 16:01:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-03 16:01:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 16:01:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-03 16:01:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 16:01:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-03 16:01:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 16:01:35,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 16:01:35,955 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 16:01:36,114 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 16:01:36,116 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 16:01:36,471 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 16:01:36,479 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 16:01:36,479 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-03 16:01:36,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 04:01:36 BoogieIcfgContainer [2022-03-03 16:01:36,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 16:01:36,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 16:01:36,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 16:01:36,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 16:01:36,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:01:35" (1/3) ... [2022-03-03 16:01:36,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a32ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:01:36, skipping insertion in model container [2022-03-03 16:01:36,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:35" (2/3) ... [2022-03-03 16:01:36,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a32ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:01:36, skipping insertion in model container [2022-03-03 16:01:36,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 04:01:36" (3/3) ... [2022-03-03 16:01:36,488 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-03-03 16:01:36,492 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 16:01:36,492 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 16:01:36,492 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-03 16:01:36,492 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 16:01:36,539 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,540 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,540 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,540 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,540 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,540 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,540 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,540 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,541 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,541 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,541 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,541 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,541 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,541 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,542 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,542 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,542 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,542 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,542 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,543 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,543 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,543 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,543 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,543 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,544 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,544 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,544 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,544 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,545 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,545 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,545 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,545 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,545 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,545 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,545 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,545 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,546 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,546 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,546 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,546 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,546 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,546 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,546 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,546 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,546 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,547 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,547 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,547 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,547 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,547 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,547 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,547 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,547 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,547 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,548 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,548 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,548 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,548 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,548 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,548 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,548 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,548 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,548 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,548 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,549 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,549 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,549 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,549 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,549 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,549 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,549 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,549 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,550 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,550 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,550 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,550 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,550 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,550 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,550 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,550 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,551 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,551 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,551 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,553 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,554 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,554 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,555 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,555 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,557 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,559 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,564 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,564 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,564 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,565 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,565 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,565 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,565 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,565 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,566 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,566 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,566 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,566 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,566 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,567 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,567 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,567 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,567 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,567 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,568 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,568 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,568 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,568 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,568 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,568 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,568 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,568 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,569 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,569 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,569 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,569 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,569 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,569 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,569 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,569 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,570 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,570 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,570 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,570 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,570 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,570 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,570 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,571 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,571 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,571 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,571 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,571 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,571 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,571 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,571 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,572 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,572 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,572 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,572 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,572 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,573 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,573 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,573 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,574 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,574 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,574 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,574 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,574 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,574 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,575 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,575 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,575 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,575 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,575 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,576 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,576 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,577 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,577 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,578 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,578 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,578 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,578 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,578 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,578 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,579 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,579 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,579 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,579 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,580 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,580 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,580 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,580 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,580 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,581 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,581 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,581 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,581 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,581 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,581 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,581 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,581 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,582 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,582 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,582 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,583 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,583 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,583 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,583 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,583 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,584 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,584 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,584 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,584 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,584 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,585 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,585 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,585 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,585 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,585 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,585 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,585 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,585 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,585 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,585 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,586 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,586 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,586 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,586 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,586 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,586 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,586 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,587 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,590 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,592 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,592 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,597 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,597 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,598 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,598 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,598 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,598 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,598 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,598 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,598 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,598 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,598 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,599 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,599 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,599 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,599 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,599 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,599 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,599 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,599 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,599 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,599 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,600 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,600 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,600 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,600 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,600 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,601 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,601 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,601 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,601 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,601 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,601 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,601 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,602 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,602 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,602 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,602 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,602 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,602 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,603 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,604 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,605 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,605 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,605 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,605 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,605 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,605 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,605 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,606 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,606 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,606 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,606 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,615 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,615 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,615 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,615 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,615 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,615 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,616 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,616 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,616 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,616 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,616 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,616 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,616 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,616 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,616 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,617 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,617 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,617 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,617 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,617 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,617 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,617 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,617 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,617 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,617 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,617 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,617 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,618 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,618 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,618 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,618 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,618 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,618 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,618 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,618 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,618 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,618 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,618 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,618 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,619 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,619 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,619 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,619 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,619 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,619 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,619 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,619 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,619 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,619 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,620 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,620 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,620 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,620 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,620 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,620 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,620 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,620 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,620 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,620 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,621 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,621 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,621 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,621 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,621 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,621 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,621 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,621 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,621 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,622 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,622 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,622 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,622 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,622 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,622 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,622 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,622 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,623 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,623 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,623 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,623 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,623 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,623 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,623 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,623 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,623 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,624 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,624 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,624 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,624 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,624 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,624 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,624 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,624 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,624 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,624 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,625 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,625 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,625 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,625 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,625 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,625 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,625 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,625 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,625 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,625 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,626 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,626 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,626 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,626 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,626 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,626 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,627 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,627 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,627 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,628 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,628 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,628 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,628 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,628 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,628 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,628 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,628 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,628 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,628 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,630 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,630 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,630 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,631 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,631 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,631 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,631 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,631 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,631 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,632 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,632 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,632 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,632 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,632 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,632 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,632 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,632 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,633 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,633 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,636 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,636 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,636 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,637 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,637 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,637 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,637 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,637 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,637 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,637 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,641 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,641 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,641 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,641 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,641 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,642 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,642 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,642 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,642 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,642 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,642 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,642 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,642 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,643 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,643 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,643 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,643 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,643 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,643 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,643 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,643 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,644 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,644 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,646 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,646 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,646 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,646 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,646 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,646 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,646 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,647 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,647 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,647 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,647 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,647 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,647 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,647 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,647 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,647 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,647 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,648 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,648 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,648 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,648 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,648 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,648 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,648 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,648 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,648 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,648 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,648 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,649 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,649 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,649 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:01:36,654 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-03 16:01:36,684 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 16:01:36,688 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-03 16:01:36,689 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-03 16:01:36,699 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 225 places, 231 transitions, 478 flow [2022-03-03 16:01:37,208 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14580 states, 14578 states have (on average 2.8304294141857596) internal successors, (41262), 14579 states have internal predecessors, (41262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:37,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 14580 states, 14578 states have (on average 2.8304294141857596) internal successors, (41262), 14579 states have internal predecessors, (41262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:37,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-03 16:01:37,267 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:01:37,267 INFO L514 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] [2022-03-03 16:01:37,268 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-03 16:01:37,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:01:37,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1145000913, now seen corresponding path program 1 times [2022-03-03 16:01:37,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:01:37,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12326893] [2022-03-03 16:01:37,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:01:37,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:01:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:01:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:01:37,557 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:01:37,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12326893] [2022-03-03 16:01:37,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12326893] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:01:37,558 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:01:37,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 16:01:37,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021579302] [2022-03-03 16:01:37,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:01:37,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-03 16:01:37,568 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:01:37,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-03 16:01:37,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 16:01:37,627 INFO L87 Difference]: Start difference. First operand has 14580 states, 14578 states have (on average 2.8304294141857596) internal successors, (41262), 14579 states have internal predecessors, (41262), 0 states have call successors, (0), 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 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:01:37,845 INFO L93 Difference]: Finished difference Result 14373 states and 40204 transitions. [2022-03-03 16:01:37,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 16:01:37,848 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-03-03 16:01:37,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:01:37,945 INFO L225 Difference]: With dead ends: 14373 [2022-03-03 16:01:37,945 INFO L226 Difference]: Without dead ends: 14373 [2022-03-03 16:01:37,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 16:01:37,950 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:01:37,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 16:01:38,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14373 states. [2022-03-03 16:01:38,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14373 to 14373. [2022-03-03 16:01:38,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14373 states, 14372 states have (on average 2.7973838018369053) internal successors, (40204), 14372 states have internal predecessors, (40204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:38,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14373 states to 14373 states and 40204 transitions. [2022-03-03 16:01:38,571 INFO L78 Accepts]: Start accepts. Automaton has 14373 states and 40204 transitions. Word has length 58 [2022-03-03 16:01:38,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:01:38,573 INFO L470 AbstractCegarLoop]: Abstraction has 14373 states and 40204 transitions. [2022-03-03 16:01:38,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 14373 states and 40204 transitions. [2022-03-03 16:01:38,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-03-03 16:01:38,608 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:01:38,609 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:01:38,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 16:01:38,610 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-03 16:01:38,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:01:38,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1194749697, now seen corresponding path program 1 times [2022-03-03 16:01:38,613 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:01:38,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326888106] [2022-03-03 16:01:38,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:01:38,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:01:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:01:38,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:01:38,991 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:01:38,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326888106] [2022-03-03 16:01:38,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326888106] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:01:38,995 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:01:38,995 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-03 16:01:38,995 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746062857] [2022-03-03 16:01:38,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:01:38,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-03 16:01:38,999 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:01:38,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-03 16:01:39,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-03 16:01:39,000 INFO L87 Difference]: Start difference. First operand 14373 states and 40204 transitions. Second operand has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:01:39,623 INFO L93 Difference]: Finished difference Result 14370 states and 40200 transitions. [2022-03-03 16:01:39,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-03 16:01:39,624 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-03-03 16:01:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:01:39,683 INFO L225 Difference]: With dead ends: 14370 [2022-03-03 16:01:39,684 INFO L226 Difference]: Without dead ends: 14370 [2022-03-03 16:01:39,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2022-03-03 16:01:39,685 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 563 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 16:01:39,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [563 Valid, 1055 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 16:01:39,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14370 states. [2022-03-03 16:01:40,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14370 to 14370. [2022-03-03 16:01:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14370 states, 14369 states have (on average 2.79768947038764) internal successors, (40200), 14369 states have internal predecessors, (40200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14370 states to 14370 states and 40200 transitions. [2022-03-03 16:01:40,265 INFO L78 Accepts]: Start accepts. Automaton has 14370 states and 40200 transitions. Word has length 120 [2022-03-03 16:01:40,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:01:40,265 INFO L470 AbstractCegarLoop]: Abstraction has 14370 states and 40200 transitions. [2022-03-03 16:01:40,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:40,265 INFO L276 IsEmpty]: Start isEmpty. Operand 14370 states and 40200 transitions. [2022-03-03 16:01:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-03 16:01:40,289 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:01:40,290 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:01:40,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 16:01:40,290 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-03 16:01:40,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:01:40,291 INFO L85 PathProgramCache]: Analyzing trace with hash -933293975, now seen corresponding path program 1 times [2022-03-03 16:01:40,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:01:40,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506877114] [2022-03-03 16:01:40,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:01:40,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:01:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:01:40,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:01:40,370 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:01:40,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506877114] [2022-03-03 16:01:40,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506877114] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:01:40,370 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:01:40,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-03 16:01:40,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472202185] [2022-03-03 16:01:40,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:01:40,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 16:01:40,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:01:40,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 16:01:40,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 16:01:40,372 INFO L87 Difference]: Start difference. First operand 14370 states and 40200 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:40,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:01:40,398 INFO L93 Difference]: Finished difference Result 2713 states and 6565 transitions. [2022-03-03 16:01:40,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 16:01:40,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-03-03 16:01:40,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:01:40,405 INFO L225 Difference]: With dead ends: 2713 [2022-03-03 16:01:40,405 INFO L226 Difference]: Without dead ends: 2594 [2022-03-03 16:01:40,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 16:01:40,406 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 67 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:01:40,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 301 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 16:01:40,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2022-03-03 16:01:40,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 2594. [2022-03-03 16:01:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2594 states, 2593 states have (on average 2.42421905129194) internal successors, (6286), 2593 states have internal predecessors, (6286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:40,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 6286 transitions. [2022-03-03 16:01:40,518 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 6286 transitions. Word has length 121 [2022-03-03 16:01:40,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:01:40,520 INFO L470 AbstractCegarLoop]: Abstraction has 2594 states and 6286 transitions. [2022-03-03 16:01:40,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:40,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 6286 transitions. [2022-03-03 16:01:40,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-03-03 16:01:40,532 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:01:40,532 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:01:40,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-03 16:01:40,533 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-03 16:01:40,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:01:40,533 INFO L85 PathProgramCache]: Analyzing trace with hash 139355698, now seen corresponding path program 1 times [2022-03-03 16:01:40,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:01:40,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119324308] [2022-03-03 16:01:40,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:01:40,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:01:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:01:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:01:40,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:01:40,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119324308] [2022-03-03 16:01:40,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119324308] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:01:40,585 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:01:40,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-03 16:01:40,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896544423] [2022-03-03 16:01:40,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:01:40,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 16:01:40,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:01:40,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 16:01:40,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 16:01:40,586 INFO L87 Difference]: Start difference. First operand 2594 states and 6286 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:40,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:01:40,613 INFO L93 Difference]: Finished difference Result 3530 states and 8580 transitions. [2022-03-03 16:01:40,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 16:01:40,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2022-03-03 16:01:40,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:01:40,622 INFO L225 Difference]: With dead ends: 3530 [2022-03-03 16:01:40,622 INFO L226 Difference]: Without dead ends: 3530 [2022-03-03 16:01:40,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 16:01:40,627 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 49 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:01:40,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 392 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 16:01:40,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2022-03-03 16:01:40,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 2620. [2022-03-03 16:01:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2620 states, 2619 states have (on average 2.424207712867507) internal successors, (6349), 2619 states have internal predecessors, (6349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 6349 transitions. [2022-03-03 16:01:40,687 INFO L78 Accepts]: Start accepts. Automaton has 2620 states and 6349 transitions. Word has length 131 [2022-03-03 16:01:40,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:01:40,687 INFO L470 AbstractCegarLoop]: Abstraction has 2620 states and 6349 transitions. [2022-03-03 16:01:40,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:40,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2620 states and 6349 transitions. [2022-03-03 16:01:40,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-03-03 16:01:40,694 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:01:40,694 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:01:40,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-03 16:01:40,695 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-03 16:01:40,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:01:40,696 INFO L85 PathProgramCache]: Analyzing trace with hash 863459016, now seen corresponding path program 1 times [2022-03-03 16:01:40,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:01:40,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051815585] [2022-03-03 16:01:40,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:01:40,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:01:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:01:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:01:40,802 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:01:40,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051815585] [2022-03-03 16:01:40,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051815585] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 16:01:40,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686847710] [2022-03-03 16:01:40,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:01:40,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 16:01:40,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 16:01:40,807 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 16:01:40,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-03 16:01:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:01:40,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-03 16:01:40,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 16:01:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:01:41,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 16:01:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:01:41,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686847710] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 16:01:41,545 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 16:01:41,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-03 16:01:41,545 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753715535] [2022-03-03 16:01:41,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 16:01:41,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 16:01:41,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:01:41,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 16:01:41,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-03 16:01:41,547 INFO L87 Difference]: Start difference. First operand 2620 states and 6349 transitions. Second operand has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:41,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:01:41,672 INFO L93 Difference]: Finished difference Result 4544 states and 11063 transitions. [2022-03-03 16:01:41,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 16:01:41,672 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 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 162 [2022-03-03 16:01:41,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:01:41,688 INFO L225 Difference]: With dead ends: 4544 [2022-03-03 16:01:41,688 INFO L226 Difference]: Without dead ends: 4544 [2022-03-03 16:01:41,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-03 16:01:41,690 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 245 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:01:41,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 1338 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 16:01:41,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4544 states. [2022-03-03 16:01:41,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4544 to 4544. [2022-03-03 16:01:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4544 states, 4543 states have (on average 2.4351749944970282) internal successors, (11063), 4543 states have internal predecessors, (11063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 11063 transitions. [2022-03-03 16:01:41,781 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 11063 transitions. Word has length 162 [2022-03-03 16:01:41,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:01:41,783 INFO L470 AbstractCegarLoop]: Abstraction has 4544 states and 11063 transitions. [2022-03-03 16:01:41,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:41,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 11063 transitions. [2022-03-03 16:01:41,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-03-03 16:01:41,794 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:01:41,794 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:01:41,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-03 16:01:42,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 16:01:42,008 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-03 16:01:42,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:01:42,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1615060600, now seen corresponding path program 2 times [2022-03-03 16:01:42,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:01:42,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512047738] [2022-03-03 16:01:42,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:01:42,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:01:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:01:42,110 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-03-03 16:01:42,110 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:01:42,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512047738] [2022-03-03 16:01:42,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512047738] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:01:42,111 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:01:42,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-03 16:01:42,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005658656] [2022-03-03 16:01:42,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:01:42,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 16:01:42,111 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:01:42,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 16:01:42,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 16:01:42,112 INFO L87 Difference]: Start difference. First operand 4544 states and 11063 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:01:42,142 INFO L93 Difference]: Finished difference Result 3344 states and 7707 transitions. [2022-03-03 16:01:42,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 16:01:42,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 224 [2022-03-03 16:01:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:01:42,150 INFO L225 Difference]: With dead ends: 3344 [2022-03-03 16:01:42,151 INFO L226 Difference]: Without dead ends: 3312 [2022-03-03 16:01:42,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 16:01:42,152 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 87 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:01:42,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 283 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 16:01:42,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2022-03-03 16:01:42,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2022-03-03 16:01:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3312 states, 3311 states have (on average 2.303533675626699) internal successors, (7627), 3311 states have internal predecessors, (7627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 7627 transitions. [2022-03-03 16:01:42,209 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 7627 transitions. Word has length 224 [2022-03-03 16:01:42,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:01:42,209 INFO L470 AbstractCegarLoop]: Abstraction has 3312 states and 7627 transitions. [2022-03-03 16:01:42,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:42,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 7627 transitions. [2022-03-03 16:01:42,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-03-03 16:01:42,217 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:01:42,217 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:01:42,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-03 16:01:42,217 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-03 16:01:42,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:01:42,218 INFO L85 PathProgramCache]: Analyzing trace with hash -320685280, now seen corresponding path program 1 times [2022-03-03 16:01:42,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:01:42,218 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407599307] [2022-03-03 16:01:42,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:01:42,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:01:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:01:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:01:42,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:01:42,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407599307] [2022-03-03 16:01:42,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407599307] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 16:01:42,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159832489] [2022-03-03 16:01:42,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:01:42,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 16:01:42,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 16:01:42,346 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 16:01:42,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-03 16:01:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:01:42,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-03 16:01:42,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 16:01:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:01:42,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 16:01:43,401 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:01:43,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159832489] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 16:01:43,401 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 16:01:43,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-03 16:01:43,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939592797] [2022-03-03 16:01:43,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 16:01:43,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-03 16:01:43,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:01:43,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-03 16:01:43,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-03 16:01:43,404 INFO L87 Difference]: Start difference. First operand 3312 states and 7627 transitions. Second operand has 18 states, 18 states have (on average 19.72222222222222) internal successors, (355), 18 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:43,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:01:43,631 INFO L93 Difference]: Finished difference Result 5976 states and 13767 transitions. [2022-03-03 16:01:43,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-03 16:01:43,631 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 19.72222222222222) internal successors, (355), 18 states have internal predecessors, (355), 0 states have call successors, (0), 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 225 [2022-03-03 16:01:43,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:01:43,644 INFO L225 Difference]: With dead ends: 5976 [2022-03-03 16:01:43,645 INFO L226 Difference]: Without dead ends: 5976 [2022-03-03 16:01:43,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2022-03-03 16:01:43,646 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 648 mSDsluCounter, 2224 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 16:01:43,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [648 Valid, 2396 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 16:01:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2022-03-03 16:01:43,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 5976. [2022-03-03 16:01:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5976 states, 5975 states have (on average 2.3041004184100418) internal successors, (13767), 5975 states have internal predecessors, (13767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:43,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5976 states to 5976 states and 13767 transitions. [2022-03-03 16:01:43,777 INFO L78 Accepts]: Start accepts. Automaton has 5976 states and 13767 transitions. Word has length 225 [2022-03-03 16:01:43,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:01:43,778 INFO L470 AbstractCegarLoop]: Abstraction has 5976 states and 13767 transitions. [2022-03-03 16:01:43,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.72222222222222) internal successors, (355), 18 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:43,778 INFO L276 IsEmpty]: Start isEmpty. Operand 5976 states and 13767 transitions. [2022-03-03 16:01:43,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2022-03-03 16:01:43,795 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:01:43,795 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:01:43,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-03 16:01:44,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-03-03 16:01:44,020 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-03 16:01:44,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:01:44,020 INFO L85 PathProgramCache]: Analyzing trace with hash 185124256, now seen corresponding path program 2 times [2022-03-03 16:01:44,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:01:44,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306620999] [2022-03-03 16:01:44,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:01:44,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:01:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:01:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:01:44,307 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:01:44,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306620999] [2022-03-03 16:01:44,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306620999] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 16:01:44,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229300198] [2022-03-03 16:01:44,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 16:01:44,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 16:01:44,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 16:01:44,309 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 16:01:44,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-03 16:01:44,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 16:01:44,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 16:01:44,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-03 16:01:44,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 16:01:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:01:45,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 16:01:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:01:46,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229300198] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 16:01:46,033 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 16:01:46,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-03-03 16:01:46,034 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097795344] [2022-03-03 16:01:46,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 16:01:46,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-03 16:01:46,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:01:46,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-03 16:01:46,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-03-03 16:01:46,041 INFO L87 Difference]: Start difference. First operand 5976 states and 13767 transitions. Second operand has 34 states, 34 states have (on average 17.735294117647058) internal successors, (603), 34 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:46,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:01:46,801 INFO L93 Difference]: Finished difference Result 11304 states and 26047 transitions. [2022-03-03 16:01:46,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-03 16:01:46,802 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 17.735294117647058) internal successors, (603), 34 states have internal predecessors, (603), 0 states have call successors, (0), 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 349 [2022-03-03 16:01:46,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:01:46,824 INFO L225 Difference]: With dead ends: 11304 [2022-03-03 16:01:46,824 INFO L226 Difference]: Without dead ends: 11304 [2022-03-03 16:01:46,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 681 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1192, Invalid=2590, Unknown=0, NotChecked=0, Total=3782 [2022-03-03 16:01:46,826 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 2055 mSDsluCounter, 2469 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2055 SdHoareTripleChecker+Valid, 2628 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 16:01:46,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2055 Valid, 2628 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 16:01:46,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11304 states. [2022-03-03 16:01:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11304 to 11304. [2022-03-03 16:01:47,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11304 states, 11303 states have (on average 2.3044324515615324) internal successors, (26047), 11303 states have internal predecessors, (26047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:47,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11304 states to 11304 states and 26047 transitions. [2022-03-03 16:01:47,055 INFO L78 Accepts]: Start accepts. Automaton has 11304 states and 26047 transitions. Word has length 349 [2022-03-03 16:01:47,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:01:47,055 INFO L470 AbstractCegarLoop]: Abstraction has 11304 states and 26047 transitions. [2022-03-03 16:01:47,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 17.735294117647058) internal successors, (603), 34 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:01:47,056 INFO L276 IsEmpty]: Start isEmpty. Operand 11304 states and 26047 transitions. [2022-03-03 16:01:47,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2022-03-03 16:01:47,089 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:01:47,089 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:01:47,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-03 16:01:47,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 16:01:47,304 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-03 16:01:47,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:01:47,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2037947040, now seen corresponding path program 3 times [2022-03-03 16:01:47,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:01:47,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197286962] [2022-03-03 16:01:47,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:01:47,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:01:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:01:47,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:01:47,941 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:01:47,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197286962] [2022-03-03 16:01:47,941 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197286962] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 16:01:47,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318012133] [2022-03-03 16:01:47,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 16:01:47,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 16:01:47,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 16:01:47,943 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 16:01:47,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-03 16:01:48,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-03 16:01:48,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 16:01:48,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-03 16:01:48,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 16:01:50,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 16:01:50,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 16:01:50,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-03 16:01:50,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 16:01:50,724 INFO L353 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-03-03 16:01:50,724 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-03-03 16:01:50,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 16:01:50,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-03-03 16:01:50,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-03 16:01:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 455 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 0 not checked. [2022-03-03 16:01:50,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 16:01:51,347 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_775 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-03-03 16:01:51,409 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 16:01:51,409 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-03-03 16:01:51,419 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 16:01:51,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2022-03-03 16:01:51,424 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 16:01:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 377 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 78 not checked. [2022-03-03 16:01:52,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318012133] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 16:01:52,597 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 16:01:52,597 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12, 12] total 53 [2022-03-03 16:01:52,597 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151715474] [2022-03-03 16:01:52,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 16:01:52,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-03-03 16:01:52,599 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:01:52,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-03-03 16:01:52,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=2297, Unknown=1, NotChecked=100, Total=2756 [2022-03-03 16:01:52,600 INFO L87 Difference]: Start difference. First operand 11304 states and 26047 transitions. Second operand has 53 states, 53 states have (on average 16.471698113207548) internal successors, (873), 53 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:02:02,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:02:02,471 INFO L93 Difference]: Finished difference Result 23411 states and 53779 transitions. [2022-03-03 16:02:02,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2022-03-03 16:02:02,472 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 16.471698113207548) internal successors, (873), 53 states have internal predecessors, (873), 0 states have call successors, (0), 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 597 [2022-03-03 16:02:02,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:02:02,511 INFO L225 Difference]: With dead ends: 23411 [2022-03-03 16:02:02,511 INFO L226 Difference]: Without dead ends: 23411 [2022-03-03 16:02:02,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1417 GetRequests, 1171 SyntacticMatches, 20 SemanticMatches, 226 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20671 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=10669, Invalid=40636, Unknown=1, NotChecked=450, Total=51756 [2022-03-03 16:02:02,525 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 14625 mSDsluCounter, 4044 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 966 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14625 SdHoareTripleChecker+Valid, 4281 SdHoareTripleChecker+Invalid, 3160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 966 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 762 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 16:02:02,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14625 Valid, 4281 Invalid, 3160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [966 Valid, 1432 Invalid, 0 Unknown, 762 Unchecked, 1.2s Time] [2022-03-03 16:02:02,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23411 states. [2022-03-03 16:02:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23411 to 19980. [2022-03-03 16:02:02,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19980 states, 19979 states have (on average 2.29465939236198) internal successors, (45845), 19979 states have internal predecessors, (45845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:02:02,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19980 states to 19980 states and 45845 transitions. [2022-03-03 16:02:02,885 INFO L78 Accepts]: Start accepts. Automaton has 19980 states and 45845 transitions. Word has length 597 [2022-03-03 16:02:02,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:02:02,887 INFO L470 AbstractCegarLoop]: Abstraction has 19980 states and 45845 transitions. [2022-03-03 16:02:02,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 16.471698113207548) internal successors, (873), 53 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:02:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 19980 states and 45845 transitions. [2022-03-03 16:02:02,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2022-03-03 16:02:02,961 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:02:02,961 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:02:02,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-03 16:02:03,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 16:02:03,186 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-03 16:02:03,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:02:03,187 INFO L85 PathProgramCache]: Analyzing trace with hash -681457465, now seen corresponding path program 1 times [2022-03-03 16:02:03,187 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:02:03,187 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382200121] [2022-03-03 16:02:03,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:02:03,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:02:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:02:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:02:03,953 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:02:03,953 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382200121] [2022-03-03 16:02:03,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382200121] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 16:02:03,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907683260] [2022-03-03 16:02:03,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:02:03,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 16:02:03,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 16:02:03,955 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 16:02:03,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-03 16:02:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:02:04,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-03 16:02:04,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 16:02:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:02:05,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 16:02:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:02:06,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907683260] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 16:02:06,690 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 16:02:06,691 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 43 [2022-03-03 16:02:06,691 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344213182] [2022-03-03 16:02:06,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 16:02:06,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-03 16:02:06,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:02:06,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-03 16:02:06,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2022-03-03 16:02:06,693 INFO L87 Difference]: Start difference. First operand 19980 states and 45845 transitions. Second operand has 43 states, 43 states have (on average 19.906976744186046) internal successors, (856), 43 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:02:07,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:02:07,718 INFO L93 Difference]: Finished difference Result 24732 states and 56741 transitions. [2022-03-03 16:02:07,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-03 16:02:07,723 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 19.906976744186046) internal successors, (856), 43 states have internal predecessors, (856), 0 states have call successors, (0), 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 656 [2022-03-03 16:02:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:02:07,770 INFO L225 Difference]: With dead ends: 24732 [2022-03-03 16:02:07,771 INFO L226 Difference]: Without dead ends: 24732 [2022-03-03 16:02:07,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1383 GetRequests, 1303 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1261 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2044, Invalid=4436, Unknown=0, NotChecked=0, Total=6480 [2022-03-03 16:02:07,772 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 2777 mSDsluCounter, 2599 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2777 SdHoareTripleChecker+Valid, 2752 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 16:02:07,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2777 Valid, 2752 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 16:02:07,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24732 states. [2022-03-03 16:02:08,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24732 to 24732. [2022-03-03 16:02:08,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24732 states, 24731 states have (on average 2.2943269580688206) internal successors, (56741), 24731 states have internal predecessors, (56741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:02:08,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24732 states to 24732 states and 56741 transitions. [2022-03-03 16:02:08,347 INFO L78 Accepts]: Start accepts. Automaton has 24732 states and 56741 transitions. Word has length 656 [2022-03-03 16:02:08,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:02:08,348 INFO L470 AbstractCegarLoop]: Abstraction has 24732 states and 56741 transitions. [2022-03-03 16:02:08,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 19.906976744186046) internal successors, (856), 43 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:02:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 24732 states and 56741 transitions. [2022-03-03 16:02:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 789 [2022-03-03 16:02:08,387 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:02:08,387 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 11, 11, 11, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:02:08,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-03 16:02:08,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-03 16:02:08,588 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-03 16:02:08,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:02:08,589 INFO L85 PathProgramCache]: Analyzing trace with hash 129194109, now seen corresponding path program 2 times [2022-03-03 16:02:08,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:02:08,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972440122] [2022-03-03 16:02:08,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:02:08,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:02:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:02:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5856 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 5475 trivial. 0 not checked. [2022-03-03 16:02:09,354 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:02:09,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972440122] [2022-03-03 16:02:09,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972440122] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:02:09,354 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:02:09,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-03 16:02:09,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253029459] [2022-03-03 16:02:09,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:02:09,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-03 16:02:09,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:02:09,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-03 16:02:09,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-03-03 16:02:09,356 INFO L87 Difference]: Start difference. First operand 24732 states and 56741 transitions. Second operand has 16 states, 16 states have (on average 11.875) internal successors, (190), 16 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:02:09,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:02:09,992 INFO L93 Difference]: Finished difference Result 24603 states and 56488 transitions. [2022-03-03 16:02:09,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 16:02:09,992 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.875) internal successors, (190), 16 states have internal predecessors, (190), 0 states have call successors, (0), 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 788 [2022-03-03 16:02:09,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:02:10,034 INFO L225 Difference]: With dead ends: 24603 [2022-03-03 16:02:10,034 INFO L226 Difference]: Without dead ends: 24603 [2022-03-03 16:02:10,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=504, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:02:10,035 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 760 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 16:02:10,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 1234 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 16:02:10,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24603 states. [2022-03-03 16:02:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24603 to 24590. [2022-03-03 16:02:10,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24590 states, 24589 states have (on average 2.29602667859612) internal successors, (56457), 24589 states have internal predecessors, (56457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:02:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24590 states to 24590 states and 56457 transitions. [2022-03-03 16:02:10,431 INFO L78 Accepts]: Start accepts. Automaton has 24590 states and 56457 transitions. Word has length 788 [2022-03-03 16:02:10,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:02:10,432 INFO L470 AbstractCegarLoop]: Abstraction has 24590 states and 56457 transitions. [2022-03-03 16:02:10,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.875) internal successors, (190), 16 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:02:10,432 INFO L276 IsEmpty]: Start isEmpty. Operand 24590 states and 56457 transitions. [2022-03-03 16:02:10,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2022-03-03 16:02:10,468 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:02:10,468 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:02:10,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-03 16:02:10,469 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-03 16:02:10,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:02:10,469 INFO L85 PathProgramCache]: Analyzing trace with hash -311280536, now seen corresponding path program 3 times [2022-03-03 16:02:10,469 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:02:10,469 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039040631] [2022-03-03 16:02:10,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:02:10,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:02:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:02:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 947 proven. 20 refuted. 0 times theorem prover too weak. 4923 trivial. 0 not checked. [2022-03-03 16:02:11,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:02:11,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039040631] [2022-03-03 16:02:11,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039040631] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 16:02:11,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486319240] [2022-03-03 16:02:11,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 16:02:11,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 16:02:11,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 16:02:11,941 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 16:02:11,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-03 16:02:12,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-03 16:02:12,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 16:02:12,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-03 16:02:12,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 16:02:14,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 16:02:15,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 16:02:15,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-03 16:02:15,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 16:02:15,223 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-03 16:02:15,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-03-03 16:02:15,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 16:02:15,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-03-03 16:02:15,433 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-03-03 16:02:15,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 16:02:15,511 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-03 16:02:15,671 INFO L353 Elim1Store]: treesize reduction 69, result has 15.9 percent of original size [2022-03-03 16:02:15,671 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 30 [2022-03-03 16:02:15,721 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-03 16:02:15,722 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-03-03 16:02:15,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-03 16:02:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 1132 proven. 440 refuted. 0 times theorem prover too weak. 4318 trivial. 0 not checked. [2022-03-03 16:02:15,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 16:02:28,158 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-03-03 16:02:28,193 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1664 Int)) (or (not (<= v_ArrVal_1664 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) is different from false [2022-03-03 16:02:28,208 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1664 Int)) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) is different from false [2022-03-03 16:02:28,221 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1664 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) is different from false [2022-03-03 16:02:28,282 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664)))) is different from false [2022-03-03 16:02:28,330 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) is different from false [2022-03-03 16:02:28,365 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-03-03 16:02:28,430 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse2 .cse1))))))) is different from false [2022-03-03 16:02:28,519 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse0 .cse1))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1664))))) is different from false [2022-03-03 16:02:28,814 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) is different from false [2022-03-03 16:02:28,938 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 16:02:28,939 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 90 [2022-03-03 16:02:28,947 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 16:02:28,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 143 [2022-03-03 16:02:28,956 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-03-03 16:02:28,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 16:02:28,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2022-03-03 16:02:29,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-03-03 16:02:29,366 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 16:02:29,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 99 [2022-03-03 16:02:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 463 proven. 411 refuted. 0 times theorem prover too weak. 4318 trivial. 698 not checked. [2022-03-03 16:02:30,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486319240] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 16:02:30,643 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 16:02:30,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18, 21] total 59 [2022-03-03 16:02:30,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026727943] [2022-03-03 16:02:30,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 16:02:30,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-03-03 16:02:30,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:02:30,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-03-03 16:02:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=2068, Unknown=10, NotChecked=1030, Total=3422 [2022-03-03 16:02:30,646 INFO L87 Difference]: Start difference. First operand 24590 states and 56457 transitions. Second operand has 59 states, 59 states have (on average 9.627118644067796) internal successors, (568), 59 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:02:32,598 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0)) (.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (or .cse4 (not (= |c_ULTIMATE.start_init_~q#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 4) 4) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) .cse4 (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (* (select .cse5 84) 4) 4) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (<= (select .cse5 (+ 84 |c_~#queue~0.offset|)) 1) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-03 16:02:33,057 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (<= (* (select .cse4 84) 4) 4) (<= (select .cse4 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-03 16:02:33,630 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse0 .cse1))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1664))))) (= 7 |c_~#queue~0.base|) (<= (* (select .cse3 84) 4) 4) (<= (select .cse3 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-03 16:02:34,122 WARN L838 $PredicateComparison]: unable to prove that (and (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 4) 4) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse2 .cse1))))))) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-03 16:02:36,199 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))))))) is different from false [2022-03-03 16:02:38,239 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 4) 4) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (* (select .cse4 84) 4) 4) (<= (select .cse4 (+ 84 |c_~#queue~0.offset|)) 1) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-03 16:02:38,866 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= (* (select .cse4 84) 4) 4) (<= (select .cse4 (+ 84 |c_~#queue~0.offset|)) 1) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-03 16:02:39,291 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-03 16:02:39,719 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-03 16:02:40,172 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse0 .cse1))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1664))))) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-03 16:02:40,622 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse2 .cse1))))))) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-03 16:02:42,631 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))))))) is different from false [2022-03-03 16:02:43,637 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1664)))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-03 16:02:44,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:02:44,554 INFO L93 Difference]: Finished difference Result 135976 states and 316700 transitions. [2022-03-03 16:02:44,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-03-03 16:02:44,555 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 9.627118644067796) internal successors, (568), 59 states have internal predecessors, (568), 0 states have call successors, (0), 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 792 [2022-03-03 16:02:44,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:02:44,819 INFO L225 Difference]: With dead ends: 135976 [2022-03-03 16:02:44,819 INFO L226 Difference]: Without dead ends: 135976 [2022-03-03 16:02:44,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1702 GetRequests, 1554 SyntacticMatches, 17 SemanticMatches, 131 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 4501 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=2204, Invalid=9855, Unknown=23, NotChecked=5474, Total=17556 [2022-03-03 16:02:44,821 INFO L933 BasicCegarLoop]: 532 mSDtfsCounter, 5016 mSDsluCounter, 13050 mSDsCounter, 0 mSdLazyCounter, 3068 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5016 SdHoareTripleChecker+Valid, 13449 SdHoareTripleChecker+Invalid, 12643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 3068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9253 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:02:44,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5016 Valid, 13449 Invalid, 12643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 3068 Invalid, 0 Unknown, 9253 Unchecked, 1.4s Time] [2022-03-03 16:02:45,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135976 states. [2022-03-03 16:02:46,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135976 to 58018. [2022-03-03 16:02:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58018 states, 58017 states have (on average 2.3215781581260666) internal successors, (134691), 58017 states have internal predecessors, (134691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:02:46,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58018 states to 58018 states and 134691 transitions. [2022-03-03 16:02:46,938 INFO L78 Accepts]: Start accepts. Automaton has 58018 states and 134691 transitions. Word has length 792 [2022-03-03 16:02:46,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:02:46,938 INFO L470 AbstractCegarLoop]: Abstraction has 58018 states and 134691 transitions. [2022-03-03 16:02:46,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 9.627118644067796) internal successors, (568), 59 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:02:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 58018 states and 134691 transitions. [2022-03-03 16:02:47,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2022-03-03 16:02:47,066 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:02:47,066 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:02:47,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-03 16:02:47,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 16:02:47,291 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-03 16:02:47,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:02:47,292 INFO L85 PathProgramCache]: Analyzing trace with hash 574269212, now seen corresponding path program 4 times [2022-03-03 16:02:47,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:02:47,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982834919] [2022-03-03 16:02:47,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:02:47,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:02:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:02:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 3413 proven. 178 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked. [2022-03-03 16:02:49,322 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:02:49,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982834919] [2022-03-03 16:02:49,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982834919] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 16:02:49,323 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948854215] [2022-03-03 16:02:49,323 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 16:02:49,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 16:02:49,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 16:02:49,328 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 16:02:49,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-03 16:02:55,478 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 16:02:55,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 16:02:55,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 1651 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-03 16:02:55,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 16:02:56,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 16:02:56,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 16:02:56,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-03 16:02:56,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 16:02:56,550 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-03 16:02:56,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-03-03 16:02:56,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 16:02:56,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-03-03 16:02:56,740 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-03-03 16:02:56,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 16:02:56,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 16:02:57,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 16:02:57,057 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-03 16:02:57,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 29 [2022-03-03 16:02:57,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 16:02:57,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-03-03 16:02:57,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-03-03 16:02:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 2706 proven. 118 refuted. 0 times theorem prover too weak. 3066 trivial. 0 not checked. [2022-03-03 16:02:57,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 16:03:21,113 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))) is different from false [2022-03-03 16:03:21,190 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))) is different from false [2022-03-03 16:03:21,204 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))) is different from false [2022-03-03 16:03:21,218 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))) is different from false [2022-03-03 16:03:21,288 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))) is different from false [2022-03-03 16:03:21,342 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2050) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))) is different from false [2022-03-03 16:03:21,396 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2050) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))))) is different from false [2022-03-03 16:03:21,467 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2050) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2051))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))))))) is different from false [2022-03-03 16:03:21,548 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse2 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1))))))) is different from false [2022-03-03 16:03:21,756 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))))) is different from false [2022-03-03 16:03:21,907 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 16:03:21,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 159 [2022-03-03 16:03:21,915 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 16:03:21,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 295 treesize of output 293 [2022-03-03 16:03:21,922 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 809 treesize of output 789 [2022-03-03 16:03:21,938 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 805 treesize of output 789 [2022-03-03 16:03:21,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-03-03 16:03:22,127 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 16:03:22,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 224 treesize of output 220 [2022-03-03 16:03:22,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 2563 proven. 89 refuted. 0 times theorem prover too weak. 3072 trivial. 166 not checked. [2022-03-03 16:03:22,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948854215] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 16:03:22,697 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 16:03:22,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 19, 22] total 68 [2022-03-03 16:03:22,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732273066] [2022-03-03 16:03:22,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 16:03:22,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-03-03 16:03:22,699 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:03:22,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-03-03 16:03:22,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=2904, Unknown=37, NotChecked=1210, Total=4556 [2022-03-03 16:03:22,700 INFO L87 Difference]: Start difference. First operand 58018 states and 134691 transitions. Second operand has 68 states, 68 states have (on average 10.191176470588236) internal successors, (693), 68 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:03:23,800 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-03 16:03:24,225 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse5 .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse1 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse3 .cse2))) (not (= (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse2) 20))))))) (= (select .cse0 84) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-03 16:03:24,764 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= (select .cse0 84) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse1 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse3 .cse2))) (not (= 20 (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse2))))))))) is different from false [2022-03-03 16:03:25,337 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2050) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2051))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1))))))) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-03 16:03:27,374 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2050) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse0 .cse1)))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-03 16:03:28,328 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (= (+ (- 1) (select .cse0 .cse1)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse3)))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (<= (select .cse0 84) 2) (= 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) (= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) (<= (* .cse4 4) (+ 8 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (not (= .cse4 20)) (<= |c_~#stored_elements~0.base| 6) (= (+ (- 1) (select (select |c_#memory_int| 7) .cse1)) 1))) is different from false [2022-03-03 16:03:28,671 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (+ (- 1) (select .cse0 (+ 84 |c_~#queue~0.offset|))) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse1 .cse2)))))) (<= (select .cse0 84) 2) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-03 16:03:29,533 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-03 16:03:30,135 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2051 Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_2050) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2051))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2056) .cse1) 20))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-03 16:03:31,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:03:31,737 INFO L93 Difference]: Finished difference Result 174095 states and 407878 transitions. [2022-03-03 16:03:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:03:31,741 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 10.191176470588236) internal successors, (693), 68 states have internal predecessors, (693), 0 states have call successors, (0), 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 792 [2022-03-03 16:03:31,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:03:32,255 INFO L225 Difference]: With dead ends: 174095 [2022-03-03 16:03:32,256 INFO L226 Difference]: Without dead ends: 174095 [2022-03-03 16:03:32,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1700 GetRequests, 1578 SyntacticMatches, 15 SemanticMatches, 107 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 2859 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=1185, Invalid=6855, Unknown=46, NotChecked=3686, Total=11772 [2022-03-03 16:03:32,257 INFO L933 BasicCegarLoop]: 640 mSDtfsCounter, 4248 mSDsluCounter, 15831 mSDsCounter, 0 mSdLazyCounter, 3394 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4248 SdHoareTripleChecker+Valid, 16310 SdHoareTripleChecker+Invalid, 10654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 3394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7138 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:03:32,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4248 Valid, 16310 Invalid, 10654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 3394 Invalid, 0 Unknown, 7138 Unchecked, 1.5s Time] [2022-03-03 16:03:32,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174095 states. [2022-03-03 16:03:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174095 to 93381. [2022-03-03 16:03:34,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93381 states, 93380 states have (on average 2.411169415292354) internal successors, (225155), 93380 states have internal predecessors, (225155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:03:35,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93381 states to 93381 states and 225155 transitions. [2022-03-03 16:03:35,379 INFO L78 Accepts]: Start accepts. Automaton has 93381 states and 225155 transitions. Word has length 792 [2022-03-03 16:03:35,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:03:35,379 INFO L470 AbstractCegarLoop]: Abstraction has 93381 states and 225155 transitions. [2022-03-03 16:03:35,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 10.191176470588236) internal successors, (693), 68 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:03:35,380 INFO L276 IsEmpty]: Start isEmpty. Operand 93381 states and 225155 transitions. [2022-03-03 16:03:35,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2022-03-03 16:03:35,654 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:03:35,655 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:03:35,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-03 16:03:35,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 16:03:35,872 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-03 16:03:35,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:03:35,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1148069001, now seen corresponding path program 1 times [2022-03-03 16:03:35,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:03:35,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630485465] [2022-03-03 16:03:35,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:03:35,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:03:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:03:38,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 3413 proven. 178 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked. [2022-03-03 16:03:38,615 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:03:38,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630485465] [2022-03-03 16:03:38,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630485465] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 16:03:38,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163332021] [2022-03-03 16:03:38,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:03:38,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 16:03:38,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 16:03:38,617 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 16:03:38,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-03 16:03:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:03:39,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 1652 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-03 16:03:39,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 16:03:40,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 16:03:40,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 16:03:40,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-03 16:03:40,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 16:03:40,810 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-03 16:03:40,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-03-03 16:03:40,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 16:03:40,852 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-03-03 16:03:40,992 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-03-03 16:03:41,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 16:03:41,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 16:03:41,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 16:03:41,217 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-03 16:03:41,217 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 29 [2022-03-03 16:03:41,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 16:03:41,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-03-03 16:03:41,300 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-03-03 16:03:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 3292 proven. 302 refuted. 0 times theorem prover too weak. 2296 trivial. 0 not checked. [2022-03-03 16:03:41,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 16:04:05,547 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1)))))) is different from false [2022-03-03 16:04:05,614 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1)))))) is different from false [2022-03-03 16:04:05,626 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20))))) is different from false [2022-03-03 16:04:05,639 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1)))))) is different from false [2022-03-03 16:04:05,692 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2441 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2441)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1)))))) is different from false [2022-03-03 16:04:05,736 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2441 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int) (v_ArrVal_2439 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2439) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2441)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20))))) is different from false [2022-03-03 16:04:05,767 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_2441 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int) (v_ArrVal_2439 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2439) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2441)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1)))))))) is different from false [2022-03-03 16:04:05,837 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2441 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| Int) (v_ArrVal_2439 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| 4)) v_ArrVal_2439) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2441))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| (select .cse2 .cse3))))))) is different from false [2022-03-03 16:04:05,927 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2441 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| Int) (v_ArrVal_2439 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| 4)) v_ArrVal_2439) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2441))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| (select .cse2 .cse1))))))) is different from false [2022-03-03 16:04:06,131 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2441 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| Int) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2446 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| Int) (v_ArrVal_2439 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2438))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| 4)) v_ArrVal_2439) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2441))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2445) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_282| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| 4)) v_ArrVal_2446) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_279| (select .cse2 .cse1)))))))) is different from false [2022-03-03 16:04:06,248 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 16:04:06,249 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 159 [2022-03-03 16:04:06,256 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 16:04:06,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 295 treesize of output 293 [2022-03-03 16:04:06,261 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 289 treesize of output 273 [2022-03-03 16:04:06,266 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 831 treesize of output 811 [2022-03-03 16:04:06,300 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 Received shutdown request... [2022-03-03 16:15:24,322 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-03 16:15:24,322 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-03 16:15:24,340 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-03 16:15:24,341 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-03-03 16:15:24,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-03 16:15:24,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-03 16:15:24,543 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 794 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 27 for 89ms.. [2022-03-03 16:15:24,545 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-03-03 16:15:24,545 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2022-03-03 16:15:24,545 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2022-03-03 16:15:24,545 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-03-03 16:15:24,547 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1] [2022-03-03 16:15:24,549 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-03 16:15:24,550 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-03 16:15:24,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 04:15:24 BasicIcfg [2022-03-03 16:15:24,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-03 16:15:24,552 INFO L158 Benchmark]: Toolchain (without parser) took 829460.09ms. Allocated memory was 184.5MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 130.1MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-03-03 16:15:24,552 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory was 148.1MB in the beginning and 147.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-03 16:15:24,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 704.92ms. Allocated memory was 184.5MB in the beginning and 229.6MB in the end (delta: 45.1MB). Free memory was 130.0MB in the beginning and 184.0MB in the end (delta: -54.0MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-03-03 16:15:24,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.95ms. Allocated memory is still 229.6MB. Free memory was 184.0MB in the beginning and 181.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 16:15:24,553 INFO L158 Benchmark]: Boogie Preprocessor took 29.33ms. Allocated memory is still 229.6MB. Free memory was 181.3MB in the beginning and 179.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 16:15:24,553 INFO L158 Benchmark]: RCFGBuilder took 602.90ms. Allocated memory is still 229.6MB. Free memory was 179.3MB in the beginning and 160.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-03-03 16:15:24,553 INFO L158 Benchmark]: TraceAbstraction took 828068.92ms. Allocated memory was 229.6MB in the beginning and 4.3GB in the end (delta: 4.0GB). Free memory was 160.3MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-03-03 16:15:24,555 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.13ms. Allocated memory is still 184.5MB. Free memory was 148.1MB in the beginning and 147.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 704.92ms. Allocated memory was 184.5MB in the beginning and 229.6MB in the end (delta: 45.1MB). Free memory was 130.0MB in the beginning and 184.0MB in the end (delta: -54.0MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.95ms. Allocated memory is still 229.6MB. Free memory was 184.0MB in the beginning and 181.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.33ms. Allocated memory is still 229.6MB. Free memory was 181.3MB in the beginning and 179.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 602.90ms. Allocated memory is still 229.6MB. Free memory was 179.3MB in the beginning and 160.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 828068.92ms. Allocated memory was 229.6MB in the beginning and 4.3GB in the end (delta: 4.0GB). Free memory was 160.3MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 794 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 27 for 89ms.. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 794 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 27 for 89ms.. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 794 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 27 for 89ms.. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 794 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 27 for 89ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 347 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 827.9s, OverallIterations: 14, TraceHistogramMax: 20, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.8s, AutomataDifference: 37.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31140 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31140 mSDsluCounter, 46619 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 17153 IncrementalHoareTripleChecker+Unchecked, 43660 mSDsCounter, 1588 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9151 IncrementalHoareTripleChecker+Invalid, 27892 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1588 mSolverCounterUnsat, 3456 mSDtfsCounter, 9151 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7805 GetRequests, 7062 SyntacticMatches, 53 SemanticMatches, 690 ConstructedPredicates, 43 IntricatePredicates, 0 DeprecatedPredicates, 30463 ImplicationChecksByTransitivity, 66.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93381occurred in iteration=13, InterpolantAutomatonStates: 485, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 163026 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 7.8s SatisfiabilityAnalysisTime, 60.7s InterpolantComputationTime, 8588 NumberOfCodeBlocks, 7618 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 12134 ConstructedInterpolants, 105 QuantifiedInterpolants, 48051 SizeOfPredicates, 109 NumberOfNonLiveVariables, 5657 ConjunctsInSsa, 213 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 44996/64449 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown