./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 05:39:26,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 05:39:26,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 05:39:26,853 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 05:39:26,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 05:39:26,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 05:39:26,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 05:39:26,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 05:39:26,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 05:39:26,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 05:39:26,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 05:39:26,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 05:39:26,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 05:39:26,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 05:39:26,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 05:39:26,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 05:39:26,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 05:39:26,882 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 05:39:26,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 05:39:26,888 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 05:39:26,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 05:39:26,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 05:39:26,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 05:39:26,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 05:39:26,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 05:39:26,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 05:39:26,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 05:39:26,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 05:39:26,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 05:39:26,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 05:39:26,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 05:39:26,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 05:39:26,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 05:39:26,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 05:39:26,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 05:39:26,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 05:39:26,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 05:39:26,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 05:39:26,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 05:39:26,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 05:39:26,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 05:39:26,927 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-19 05:39:26,988 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 05:39:26,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 05:39:26,993 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-19 05:39:26,994 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-19 05:39:26,995 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 05:39:26,996 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 05:39:26,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-19 05:39:26,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-19 05:39:26,998 INFO L138 SettingsManager]: * Use SBE=true [2021-11-19 05:39:26,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 05:39:26,999 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 05:39:27,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 05:39:27,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 05:39:27,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 05:39:27,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 05:39:27,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 05:39:27,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 05:39:27,001 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 05:39:27,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 05:39:27,002 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 05:39:27,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 05:39:27,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 05:39:27,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-19 05:39:27,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 05:39:27,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 05:39:27,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 05:39:27,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 05:39:27,004 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 05:39:27,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-19 05:39:27,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 05:39:27,005 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-19 05:39:27,005 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-19 05:39:27,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 05:39:27,006 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 05:39:27,007 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2021-11-19 05:39:27,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 05:39:27,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 05:39:27,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 05:39:27,434 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 05:39:27,435 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 05:39:27,437 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/../../sv-benchmarks/c/pthread/queue_ok.i [2021-11-19 05:39:27,522 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/data/d66472be1/4c755775033f4ef2a297a66893a35c0a/FLAG02759e27b [2021-11-19 05:39:28,289 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 05:39:28,290 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/sv-benchmarks/c/pthread/queue_ok.i [2021-11-19 05:39:28,310 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/data/d66472be1/4c755775033f4ef2a297a66893a35c0a/FLAG02759e27b [2021-11-19 05:39:28,523 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/data/d66472be1/4c755775033f4ef2a297a66893a35c0a [2021-11-19 05:39:28,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 05:39:28,532 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 05:39:28,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 05:39:28,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 05:39:28,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 05:39:28,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:39:28" (1/1) ... [2021-11-19 05:39:28,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fc15830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:39:28, skipping insertion in model container [2021-11-19 05:39:28,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:39:28" (1/1) ... [2021-11-19 05:39:28,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 05:39:28,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 05:39:29,491 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2021-11-19 05:39:29,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2021-11-19 05:39:29,513 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 05:39:29,532 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 05:39:29,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2021-11-19 05:39:29,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2021-11-19 05:39:29,639 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 05:39:29,773 INFO L208 MainTranslator]: Completed translation [2021-11-19 05:39:29,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:39:29 WrapperNode [2021-11-19 05:39:29,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 05:39:29,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 05:39:29,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 05:39:29,777 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 05:39:29,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:39:29" (1/1) ... [2021-11-19 05:39:29,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:39:29" (1/1) ... [2021-11-19 05:39:29,905 INFO L137 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 201 [2021-11-19 05:39:29,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 05:39:29,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 05:39:29,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 05:39:29,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 05:39:29,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:39:29" (1/1) ... [2021-11-19 05:39:29,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:39:29" (1/1) ... [2021-11-19 05:39:29,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:39:29" (1/1) ... [2021-11-19 05:39:29,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:39:29" (1/1) ... [2021-11-19 05:39:29,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:39:29" (1/1) ... [2021-11-19 05:39:29,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:39:29" (1/1) ... [2021-11-19 05:39:29,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:39:29" (1/1) ... [2021-11-19 05:39:29,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 05:39:30,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 05:39:30,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 05:39:30,003 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 05:39:30,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:39:29" (1/1) ... [2021-11-19 05:39:30,014 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 05:39:30,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:39:30,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 05:39:30,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 05:39:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-11-19 05:39:30,189 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-11-19 05:39:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-11-19 05:39:30,192 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-11-19 05:39:30,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-19 05:39:30,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-19 05:39:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-19 05:39:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-19 05:39:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-19 05:39:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 05:39:30,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 05:39:30,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 05:39:30,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 05:39:30,196 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-19 05:39:30,406 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 05:39:30,408 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 05:39:30,882 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 05:39:30,896 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 05:39:30,897 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-19 05:39:30,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:39:30 BoogieIcfgContainer [2021-11-19 05:39:30,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 05:39:30,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 05:39:30,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 05:39:30,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 05:39:30,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:39:28" (1/3) ... [2021-11-19 05:39:30,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49467038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:39:30, skipping insertion in model container [2021-11-19 05:39:30,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:39:29" (2/3) ... [2021-11-19 05:39:30,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49467038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:39:30, skipping insertion in model container [2021-11-19 05:39:30,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:39:30" (3/3) ... [2021-11-19 05:39:30,917 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2021-11-19 05:39:30,924 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-19 05:39:30,925 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 05:39:30,925 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-19 05:39:30,925 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-19 05:39:30,985 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,985 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,985 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,986 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,986 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,986 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,986 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,987 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,987 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,994 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,994 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,995 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,995 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,995 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,995 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,996 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,996 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,996 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,996 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,997 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,997 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,997 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,997 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,998 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,998 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,998 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,998 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,999 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,999 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,999 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,999 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:30,999 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,000 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,000 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,000 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,000 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,001 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,001 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,002 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,003 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,003 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,003 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,003 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,004 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,004 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,004 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,004 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,004 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,005 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,005 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,005 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,005 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,005 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,006 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,006 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,006 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,006 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,006 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,007 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,007 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,007 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,007 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,024 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,024 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,024 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,024 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,025 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,025 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,025 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,025 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,025 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,026 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,026 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,026 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,026 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,027 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,027 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,027 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,027 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,027 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,028 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,028 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,028 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,028 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,028 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,029 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,029 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,029 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,029 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,030 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,030 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,030 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,030 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,030 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,031 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,031 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,031 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,031 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,031 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,032 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,032 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,032 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,032 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,033 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,033 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,033 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,033 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,033 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,034 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,034 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,034 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,034 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,034 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,035 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,035 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,035 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,035 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,036 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,036 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,036 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,036 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,037 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,037 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,037 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,037 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,037 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,038 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,038 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,038 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,038 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,038 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,039 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,039 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,039 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,039 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,040 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,040 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,040 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,040 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,040 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,041 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,041 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,041 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,041 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,041 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,042 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,042 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,042 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,042 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,042 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,043 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,043 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,043 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,043 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,044 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,044 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,044 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,044 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,045 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,045 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,045 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,045 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,045 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,046 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,046 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,046 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,046 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,046 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,047 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,047 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,047 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,047 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,049 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,049 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,049 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,049 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,050 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,050 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,050 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,050 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,050 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,051 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,051 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,051 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,051 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,052 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,052 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,052 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,053 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,053 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,053 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,053 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,053 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,054 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,054 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,054 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,054 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,055 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,055 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,055 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,055 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,056 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,056 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,056 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,056 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,056 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,056 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,057 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,057 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,057 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,057 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,057 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,058 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,058 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,058 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,058 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,059 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,059 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,059 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,059 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,059 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,060 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,060 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,060 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,060 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,060 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,061 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,061 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,061 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,061 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,061 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,062 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,062 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,062 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,062 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,062 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,063 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,063 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,063 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,063 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,064 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,064 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,064 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,064 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,064 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,065 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,065 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,065 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,065 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,065 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,066 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,066 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,066 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,066 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,066 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,067 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,067 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,067 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,067 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,068 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,068 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,068 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,068 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,068 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,069 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,069 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,069 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,069 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,070 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,070 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,070 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,070 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,070 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,071 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,071 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,071 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,071 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,071 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,072 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,072 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,072 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,072 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,072 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,073 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,073 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,073 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,073 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,073 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,073 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,074 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,074 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,074 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,074 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,074 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,075 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,075 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,075 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,075 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,075 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,075 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,076 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,076 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,076 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,076 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,076 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,076 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,077 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,077 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,077 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,077 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,077 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,078 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,078 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,078 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,078 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,078 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,079 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,079 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,079 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,079 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,079 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,080 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,080 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,080 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,080 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,080 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,081 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,081 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,081 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,081 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,081 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,082 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,082 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,082 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,082 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,082 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,083 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,083 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,083 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,083 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,083 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,083 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,084 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,084 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,084 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,084 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,084 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,085 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,085 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,085 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,085 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,085 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,086 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,086 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,086 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,086 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,086 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,087 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,087 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,087 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,087 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,087 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,088 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,088 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,088 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,088 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,088 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,089 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,089 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,089 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,089 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,089 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,090 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,090 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,090 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,090 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,090 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,091 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,091 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,091 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,091 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,091 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,092 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,092 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,092 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,092 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,092 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,092 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,093 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,093 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,093 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,093 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,093 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,094 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,094 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,094 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,094 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,094 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,095 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,095 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,095 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,095 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,095 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,096 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,096 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,096 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,096 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,096 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,100 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,104 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,105 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,105 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,105 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,105 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,106 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,106 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,106 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,106 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,106 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,106 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,106 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,107 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,107 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,107 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,107 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,107 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,111 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,114 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,116 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,117 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,117 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,117 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,117 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,123 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,124 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,124 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,124 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,124 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,125 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,125 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,125 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,126 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,126 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,127 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,127 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,128 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,129 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,139 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,139 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,139 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,140 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,140 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,140 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,140 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,141 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:39:31,144 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-11-19 05:39:31,244 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 05:39:31,253 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=PETRI_NET, 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 [2021-11-19 05:39:31,253 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-19 05:39:31,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 222 places, 228 transitions, 472 flow [2021-11-19 05:39:31,399 INFO L129 PetriNetUnfolder]: 13/226 cut-off events. [2021-11-19 05:39:31,400 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-11-19 05:39:31,414 INFO L84 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 226 events. 13/226 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 367 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 146. Up to 3 conditions per place. [2021-11-19 05:39:31,415 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 228 transitions, 472 flow [2021-11-19 05:39:31,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 216 transitions, 441 flow [2021-11-19 05:39:31,441 INFO L129 PetriNetUnfolder]: 1/62 cut-off events. [2021-11-19 05:39:31,441 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-19 05:39:31,442 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-19 05:39:31,442 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 05:39:31,443 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)] === [2021-11-19 05:39:31,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:39:31,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1507037300, now seen corresponding path program 1 times [2021-11-19 05:39:31,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:39:31,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16999263] [2021-11-19 05:39:31,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:39:31,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:39:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:39:31,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:39:31,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:39:31,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16999263] [2021-11-19 05:39:31,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16999263] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:39:31,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:39:31,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-19 05:39:31,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664077176] [2021-11-19 05:39:31,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:39:31,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-19 05:39:31,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:39:31,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-19 05:39:31,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 05:39:31,883 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 228 [2021-11-19 05:39:31,895 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 216 transitions, 441 flow. Second operand has 2 states, 2 states have (on average 217.5) internal successors, (435), 2 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:31,895 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-19 05:39:31,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 228 [2021-11-19 05:39:31,898 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-19 05:39:32,027 INFO L129 PetriNetUnfolder]: 9/207 cut-off events. [2021-11-19 05:39:32,027 INFO L130 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2021-11-19 05:39:32,034 INFO L84 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 207 events. 9/207 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 275 event pairs, 0 based on Foata normal form. 5/202 useless extension candidates. Maximal degree in co-relation 143. Up to 4 conditions per place. [2021-11-19 05:39:32,038 INFO L132 encePairwiseOnDemand]: 224/228 looper letters, 3 selfloop transitions, 0 changer transitions 0/207 dead transitions. [2021-11-19 05:39:32,039 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 207 transitions, 429 flow [2021-11-19 05:39:32,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-19 05:39:32,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-11-19 05:39:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 441 transitions. [2021-11-19 05:39:32,069 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9671052631578947 [2021-11-19 05:39:32,070 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 441 transitions. [2021-11-19 05:39:32,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 441 transitions. [2021-11-19 05:39:32,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:39:32,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 441 transitions. [2021-11-19 05:39:32,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 220.5) internal successors, (441), 2 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:32,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:32,132 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:32,134 INFO L186 Difference]: Start difference. First operand has 210 places, 216 transitions, 441 flow. Second operand 2 states and 441 transitions. [2021-11-19 05:39:32,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 207 transitions, 429 flow [2021-11-19 05:39:32,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 207 transitions, 424 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-11-19 05:39:32,164 INFO L242 Difference]: Finished difference. Result has 203 places, 207 transitions, 418 flow [2021-11-19 05:39:32,168 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=418, PETRI_PLACES=203, PETRI_TRANSITIONS=207} [2021-11-19 05:39:32,174 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, -7 predicate places. [2021-11-19 05:39:32,174 INFO L470 AbstractCegarLoop]: Abstraction has has 203 places, 207 transitions, 418 flow [2021-11-19 05:39:32,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 217.5) internal successors, (435), 2 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:32,176 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-19 05:39:32,177 INFO L254 CegarLoopForPetriNet]: 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] [2021-11-19 05:39:32,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 05:39:32,179 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)] === [2021-11-19 05:39:32,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:39:32,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1306886744, now seen corresponding path program 1 times [2021-11-19 05:39:32,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:39:32,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16015190] [2021-11-19 05:39:32,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:39:32,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:39:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:39:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:39:32,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:39:32,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16015190] [2021-11-19 05:39:32,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16015190] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:39:32,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:39:32,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-19 05:39:32,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009059121] [2021-11-19 05:39:32,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:39:32,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-19 05:39:32,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:39:32,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-19 05:39:32,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-19 05:39:32,924 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 228 [2021-11-19 05:39:32,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 207 transitions, 418 flow. Second operand has 12 states, 12 states have (on average 166.25) internal successors, (1995), 12 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:32,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-19 05:39:32,930 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 228 [2021-11-19 05:39:32,930 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-19 05:39:34,270 INFO L129 PetriNetUnfolder]: 611/2579 cut-off events. [2021-11-19 05:39:34,270 INFO L130 PetriNetUnfolder]: For 26/29 co-relation queries the response was YES. [2021-11-19 05:39:34,283 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3511 conditions, 2579 events. 611/2579 cut-off events. For 26/29 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 20510 event pairs, 459 based on Foata normal form. 0/2405 useless extension candidates. Maximal degree in co-relation 3508. Up to 882 conditions per place. [2021-11-19 05:39:34,304 INFO L132 encePairwiseOnDemand]: 215/228 looper letters, 42 selfloop transitions, 12 changer transitions 0/203 dead transitions. [2021-11-19 05:39:34,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 203 transitions, 518 flow [2021-11-19 05:39:34,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-19 05:39:34,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-11-19 05:39:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2174 transitions. [2021-11-19 05:39:34,316 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.733468286099865 [2021-11-19 05:39:34,316 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2174 transitions. [2021-11-19 05:39:34,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2174 transitions. [2021-11-19 05:39:34,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:39:34,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2174 transitions. [2021-11-19 05:39:34,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 167.23076923076923) internal successors, (2174), 13 states have internal predecessors, (2174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:34,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 228.0) internal successors, (3192), 14 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:34,344 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 228.0) internal successors, (3192), 14 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:34,344 INFO L186 Difference]: Start difference. First operand has 203 places, 207 transitions, 418 flow. Second operand 13 states and 2174 transitions. [2021-11-19 05:39:34,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 203 transitions, 518 flow [2021-11-19 05:39:34,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 203 transitions, 518 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-11-19 05:39:34,357 INFO L242 Difference]: Finished difference. Result has 212 places, 203 transitions, 434 flow [2021-11-19 05:39:34,361 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=434, PETRI_PLACES=212, PETRI_TRANSITIONS=203} [2021-11-19 05:39:34,362 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 2 predicate places. [2021-11-19 05:39:34,363 INFO L470 AbstractCegarLoop]: Abstraction has has 212 places, 203 transitions, 434 flow [2021-11-19 05:39:34,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 166.25) internal successors, (1995), 12 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:34,365 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-19 05:39:34,366 INFO L254 CegarLoopForPetriNet]: 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] [2021-11-19 05:39:34,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-19 05:39:34,367 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)] === [2021-11-19 05:39:34,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:39:34,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1406642397, now seen corresponding path program 1 times [2021-11-19 05:39:34,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:39:34,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043910683] [2021-11-19 05:39:34,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:39:34,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:39:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:39:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:39:34,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:39:34,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043910683] [2021-11-19 05:39:34,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043910683] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:39:34,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:39:34,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 05:39:34,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859961223] [2021-11-19 05:39:34,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:39:34,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 05:39:34,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:39:34,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 05:39:34,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 05:39:34,567 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 228 [2021-11-19 05:39:34,569 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 203 transitions, 434 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:34,569 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-19 05:39:34,569 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 228 [2021-11-19 05:39:34,569 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-19 05:39:34,644 INFO L129 PetriNetUnfolder]: 16/304 cut-off events. [2021-11-19 05:39:34,644 INFO L130 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2021-11-19 05:39:34,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 304 events. 16/304 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 688 event pairs, 2 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 343. Up to 12 conditions per place. [2021-11-19 05:39:34,647 INFO L132 encePairwiseOnDemand]: 224/228 looper letters, 7 selfloop transitions, 2 changer transitions 5/206 dead transitions. [2021-11-19 05:39:34,647 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 206 transitions, 467 flow [2021-11-19 05:39:34,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 05:39:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-19 05:39:34,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2021-11-19 05:39:34,650 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2021-11-19 05:39:34,650 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 646 transitions. [2021-11-19 05:39:34,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 646 transitions. [2021-11-19 05:39:34,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:39:34,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 646 transitions. [2021-11-19 05:39:34,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:34,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:34,658 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:34,659 INFO L186 Difference]: Start difference. First operand has 212 places, 203 transitions, 434 flow. Second operand 3 states and 646 transitions. [2021-11-19 05:39:34,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 206 transitions, 467 flow [2021-11-19 05:39:34,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 206 transitions, 444 flow, removed 0 selfloop flow, removed 11 redundant places. [2021-11-19 05:39:34,667 INFO L242 Difference]: Finished difference. Result has 204 places, 200 transitions, 413 flow [2021-11-19 05:39:34,668 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=413, PETRI_PLACES=204, PETRI_TRANSITIONS=200} [2021-11-19 05:39:34,669 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, -6 predicate places. [2021-11-19 05:39:34,669 INFO L470 AbstractCegarLoop]: Abstraction has has 204 places, 200 transitions, 413 flow [2021-11-19 05:39:34,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:34,670 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-19 05:39:34,671 INFO L254 CegarLoopForPetriNet]: 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] [2021-11-19 05:39:34,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-19 05:39:34,671 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)] === [2021-11-19 05:39:34,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:39:34,672 INFO L85 PathProgramCache]: Analyzing trace with hash -160886474, now seen corresponding path program 1 times [2021-11-19 05:39:34,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:39:34,672 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975709847] [2021-11-19 05:39:34,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:39:34,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:39:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:39:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:39:34,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:39:34,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975709847] [2021-11-19 05:39:34,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975709847] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:39:34,749 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:39:34,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 05:39:34,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627399190] [2021-11-19 05:39:34,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:39:34,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 05:39:34,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:39:34,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 05:39:34,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 05:39:34,754 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 228 [2021-11-19 05:39:34,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 200 transitions, 413 flow. Second operand has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:34,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-19 05:39:34,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 228 [2021-11-19 05:39:34,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-19 05:39:34,877 INFO L129 PetriNetUnfolder]: 20/333 cut-off events. [2021-11-19 05:39:34,877 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-11-19 05:39:34,878 INFO L84 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 333 events. 20/333 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 666 event pairs, 6 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 398. Up to 24 conditions per place. [2021-11-19 05:39:34,880 INFO L132 encePairwiseOnDemand]: 225/228 looper letters, 13 selfloop transitions, 2 changer transitions 1/205 dead transitions. [2021-11-19 05:39:34,880 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 205 transitions, 455 flow [2021-11-19 05:39:34,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 05:39:34,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-19 05:39:34,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2021-11-19 05:39:34,883 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2021-11-19 05:39:34,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 646 transitions. [2021-11-19 05:39:34,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 646 transitions. [2021-11-19 05:39:34,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:39:34,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 646 transitions. [2021-11-19 05:39:34,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:34,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:34,890 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:34,890 INFO L186 Difference]: Start difference. First operand has 204 places, 200 transitions, 413 flow. Second operand 3 states and 646 transitions. [2021-11-19 05:39:34,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 205 transitions, 455 flow [2021-11-19 05:39:34,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 205 transitions, 451 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-19 05:39:34,897 INFO L242 Difference]: Finished difference. Result has 204 places, 200 transitions, 419 flow [2021-11-19 05:39:34,898 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=204, PETRI_TRANSITIONS=200} [2021-11-19 05:39:34,898 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, -6 predicate places. [2021-11-19 05:39:34,899 INFO L470 AbstractCegarLoop]: Abstraction has has 204 places, 200 transitions, 419 flow [2021-11-19 05:39:34,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:34,899 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-19 05:39:34,900 INFO L254 CegarLoopForPetriNet]: 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] [2021-11-19 05:39:34,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-19 05:39:34,900 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)] === [2021-11-19 05:39:34,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:39:34,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1688509092, now seen corresponding path program 1 times [2021-11-19 05:39:34,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:39:34,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873999118] [2021-11-19 05:39:34,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:39:34,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:39:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:39:34,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:39:34,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:39:34,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873999118] [2021-11-19 05:39:34,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873999118] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 05:39:34,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67178159] [2021-11-19 05:39:34,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:39:34,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:39:34,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:39:34,995 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 05:39:34,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-19 05:39:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:39:35,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-19 05:39:35,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 05:39:35,380 INFO L388 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 11 treesize of output 7 [2021-11-19 05:39:35,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 05:39:35,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-19 05:39:35,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67178159] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:39:35,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-19 05:39:35,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-11-19 05:39:35,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307514067] [2021-11-19 05:39:35,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:39:35,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 05:39:35,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:39:35,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 05:39:35,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-19 05:39:35,599 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 228 [2021-11-19 05:39:35,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 200 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:35,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-19 05:39:35,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 228 [2021-11-19 05:39:35,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-19 05:39:35,701 INFO L129 PetriNetUnfolder]: 22/488 cut-off events. [2021-11-19 05:39:35,701 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-11-19 05:39:35,703 INFO L84 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 488 events. 22/488 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1358 event pairs, 3 based on Foata normal form. 2/476 useless extension candidates. Maximal degree in co-relation 542. Up to 19 conditions per place. [2021-11-19 05:39:35,705 INFO L132 encePairwiseOnDemand]: 224/228 looper letters, 12 selfloop transitions, 3 changer transitions 3/202 dead transitions. [2021-11-19 05:39:35,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 202 transitions, 458 flow [2021-11-19 05:39:35,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 05:39:35,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-19 05:39:35,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2021-11-19 05:39:35,708 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9298245614035088 [2021-11-19 05:39:35,708 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 636 transitions. [2021-11-19 05:39:35,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 636 transitions. [2021-11-19 05:39:35,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:39:35,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 636 transitions. [2021-11-19 05:39:35,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:35,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:35,714 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:35,714 INFO L186 Difference]: Start difference. First operand has 204 places, 200 transitions, 419 flow. Second operand 3 states and 636 transitions. [2021-11-19 05:39:35,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 202 transitions, 458 flow [2021-11-19 05:39:35,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 202 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-19 05:39:35,721 INFO L242 Difference]: Finished difference. Result has 204 places, 197 transitions, 417 flow [2021-11-19 05:39:35,722 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=417, PETRI_PLACES=204, PETRI_TRANSITIONS=197} [2021-11-19 05:39:35,726 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, -6 predicate places. [2021-11-19 05:39:35,726 INFO L470 AbstractCegarLoop]: Abstraction has has 204 places, 197 transitions, 417 flow [2021-11-19 05:39:35,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:35,727 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-19 05:39:35,727 INFO L254 CegarLoopForPetriNet]: 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] [2021-11-19 05:39:35,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-19 05:39:35,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:39:35,950 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)] === [2021-11-19 05:39:35,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:39:35,951 INFO L85 PathProgramCache]: Analyzing trace with hash -904680422, now seen corresponding path program 1 times [2021-11-19 05:39:35,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:39:35,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362711689] [2021-11-19 05:39:35,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:39:35,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:39:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:39:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:39:36,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:39:36,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362711689] [2021-11-19 05:39:36,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362711689] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 05:39:36,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885660070] [2021-11-19 05:39:36,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:39:36,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:39:36,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:39:36,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 05:39:36,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-19 05:39:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:39:36,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-19 05:39:36,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 05:39:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:39:36,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 05:39:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:39:36,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885660070] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 05:39:36,794 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 05:39:36,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-11-19 05:39:36,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943455017] [2021-11-19 05:39:36,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 05:39:36,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-19 05:39:36,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:39:36,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-19 05:39:36,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-19 05:39:36,802 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 228 [2021-11-19 05:39:36,805 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 197 transitions, 417 flow. Second operand has 10 states, 10 states have (on average 211.2) internal successors, (2112), 10 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:36,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-19 05:39:36,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 228 [2021-11-19 05:39:36,805 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-19 05:39:36,941 INFO L129 PetriNetUnfolder]: 30/420 cut-off events. [2021-11-19 05:39:36,941 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-11-19 05:39:36,943 INFO L84 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 420 events. 30/420 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 670 event pairs, 4 based on Foata normal form. 4/413 useless extension candidates. Maximal degree in co-relation 538. Up to 19 conditions per place. [2021-11-19 05:39:36,945 INFO L132 encePairwiseOnDemand]: 222/228 looper letters, 20 selfloop transitions, 9 changer transitions 1/214 dead transitions. [2021-11-19 05:39:36,945 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 214 transitions, 525 flow [2021-11-19 05:39:36,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-19 05:39:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-19 05:39:36,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1912 transitions. [2021-11-19 05:39:36,951 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9317738791423001 [2021-11-19 05:39:36,951 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1912 transitions. [2021-11-19 05:39:36,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1912 transitions. [2021-11-19 05:39:36,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:39:36,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1912 transitions. [2021-11-19 05:39:36,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 212.44444444444446) internal successors, (1912), 9 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:36,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 228.0) internal successors, (2280), 10 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:36,965 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 228.0) internal successors, (2280), 10 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:36,965 INFO L186 Difference]: Start difference. First operand has 204 places, 197 transitions, 417 flow. Second operand 9 states and 1912 transitions. [2021-11-19 05:39:36,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 214 transitions, 525 flow [2021-11-19 05:39:36,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 214 transitions, 522 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-19 05:39:36,972 INFO L242 Difference]: Finished difference. Result has 211 places, 202 transitions, 462 flow [2021-11-19 05:39:36,973 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=462, PETRI_PLACES=211, PETRI_TRANSITIONS=202} [2021-11-19 05:39:36,973 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 1 predicate places. [2021-11-19 05:39:36,973 INFO L470 AbstractCegarLoop]: Abstraction has has 211 places, 202 transitions, 462 flow [2021-11-19 05:39:36,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 211.2) internal successors, (2112), 10 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:36,975 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-19 05:39:36,975 INFO L254 CegarLoopForPetriNet]: 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] [2021-11-19 05:39:37,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-19 05:39:37,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:39:37,200 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)] === [2021-11-19 05:39:37,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:39:37,200 INFO L85 PathProgramCache]: Analyzing trace with hash -288699814, now seen corresponding path program 2 times [2021-11-19 05:39:37,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:39:37,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40570752] [2021-11-19 05:39:37,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:39:37,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:39:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:39:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:39:37,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:39:37,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40570752] [2021-11-19 05:39:37,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40570752] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 05:39:37,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473836432] [2021-11-19 05:39:37,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-19 05:39:37,347 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:39:37,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:39:37,355 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 05:39:37,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-19 05:39:37,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-19 05:39:37,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 05:39:37,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-19 05:39:37,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 05:39:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:39:38,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 05:39:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:39:38,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473836432] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 05:39:38,479 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 05:39:38,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2021-11-19 05:39:38,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843432780] [2021-11-19 05:39:38,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 05:39:38,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-19 05:39:38,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:39:38,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-19 05:39:38,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-11-19 05:39:38,491 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 228 [2021-11-19 05:39:38,497 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 202 transitions, 462 flow. Second operand has 18 states, 18 states have (on average 211.33333333333334) internal successors, (3804), 18 states have internal predecessors, (3804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:38,497 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-19 05:39:38,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 228 [2021-11-19 05:39:38,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-19 05:39:38,906 INFO L129 PetriNetUnfolder]: 58/742 cut-off events. [2021-11-19 05:39:38,906 INFO L130 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2021-11-19 05:39:38,909 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1061 conditions, 742 events. 58/742 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1372 event pairs, 4 based on Foata normal form. 8/731 useless extension candidates. Maximal degree in co-relation 1052. Up to 39 conditions per place. [2021-11-19 05:39:38,912 INFO L132 encePairwiseOnDemand]: 222/228 looper letters, 40 selfloop transitions, 21 changer transitions 0/245 dead transitions. [2021-11-19 05:39:38,912 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 245 transitions, 768 flow [2021-11-19 05:39:38,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-19 05:39:38,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-11-19 05:39:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4454 transitions. [2021-11-19 05:39:38,926 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9302422723475355 [2021-11-19 05:39:38,926 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4454 transitions. [2021-11-19 05:39:38,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4454 transitions. [2021-11-19 05:39:38,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:39:38,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4454 transitions. [2021-11-19 05:39:38,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 212.0952380952381) internal successors, (4454), 21 states have internal predecessors, (4454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:38,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 228.0) internal successors, (5016), 22 states have internal predecessors, (5016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:38,962 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 228.0) internal successors, (5016), 22 states have internal predecessors, (5016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:38,962 INFO L186 Difference]: Start difference. First operand has 211 places, 202 transitions, 462 flow. Second operand 21 states and 4454 transitions. [2021-11-19 05:39:38,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 245 transitions, 768 flow [2021-11-19 05:39:38,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 245 transitions, 754 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-11-19 05:39:38,973 INFO L242 Difference]: Finished difference. Result has 234 places, 215 transitions, 586 flow [2021-11-19 05:39:38,974 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=586, PETRI_PLACES=234, PETRI_TRANSITIONS=215} [2021-11-19 05:39:38,975 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 24 predicate places. [2021-11-19 05:39:38,975 INFO L470 AbstractCegarLoop]: Abstraction has has 234 places, 215 transitions, 586 flow [2021-11-19 05:39:38,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 211.33333333333334) internal successors, (3804), 18 states have internal predecessors, (3804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:39:38,977 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-19 05:39:38,978 INFO L254 CegarLoopForPetriNet]: 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] [2021-11-19 05:39:39,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-19 05:39:39,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:39:39,200 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)] === [2021-11-19 05:39:39,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:39:39,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1524175112, now seen corresponding path program 3 times [2021-11-19 05:39:39,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:39:39,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334667511] [2021-11-19 05:39:39,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:39:39,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:39:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:39:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:39:39,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:39:39,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334667511] [2021-11-19 05:39:39,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334667511] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 05:39:39,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906917751] [2021-11-19 05:39:39,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 05:39:39,576 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:39:39,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:39:39,577 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 05:39:39,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-19 05:39:39,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-19 05:39:39,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 05:39:39,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-19 05:39:39,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 05:39:39,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-19 05:39:39,911 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 05:39:39,914 INFO L388 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 11 treesize of output 11 [2021-11-19 05:39:40,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2021-11-19 05:39:40,663 INFO L354 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2021-11-19 05:39:40,664 INFO L388 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 29 treesize of output 28 [2021-11-19 05:39:40,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 05:39:40,858 INFO L354 Elim1Store]: treesize reduction 69, result has 15.9 percent of original size [2021-11-19 05:39:40,858 INFO L388 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 [2021-11-19 05:39:40,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:39:40,908 INFO L388 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 [2021-11-19 05:39:40,936 INFO L388 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 [2021-11-19 05:39:41,049 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 183 proven. 135 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2021-11-19 05:39:41,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 05:39:59,354 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1) 20))))) is different from false [2021-11-19 05:39:59,533 INFO L354 Elim1Store]: treesize reduction 95, result has 40.6 percent of original size [2021-11-19 05:39:59,533 INFO L388 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 179 [2021-11-19 05:39:59,558 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 05:39:59,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 197 [2021-11-19 05:39:59,927 INFO L388 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 [2021-11-19 05:40:00,000 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 05:40:00,001 INFO L388 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 58 treesize of output 58 [2021-11-19 05:40:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 153 proven. 135 refuted. 0 times theorem prover too weak. 340 trivial. 30 not checked. [2021-11-19 05:40:00,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906917751] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 05:40:00,834 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 05:40:00,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 13] total 35 [2021-11-19 05:40:00,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338183742] [2021-11-19 05:40:00,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 05:40:00,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-19 05:40:00,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:40:00,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-19 05:40:00,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=972, Unknown=21, NotChecked=64, Total=1190 [2021-11-19 05:40:00,856 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 228 [2021-11-19 05:40:00,864 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 215 transitions, 586 flow. Second operand has 35 states, 35 states have (on average 155.2) internal successors, (5432), 35 states have internal predecessors, (5432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:40:00,864 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-19 05:40:00,864 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 228 [2021-11-19 05:40:00,864 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-19 05:40:01,811 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_t1Thread1of1ForFork1_~i~0#1| 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) .cse0) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)))) (= (select |c_#valid| |c_~#stored_elements~0.base|) 1) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24|) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse2) 20))))))) is different from false [2021-11-19 05:40:03,383 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) .cse0) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)))) (= (select |c_#valid| |c_~#stored_elements~0.base|) 1) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24|) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse2) 20))))))) is different from false [2021-11-19 05:40:03,879 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) .cse0) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24|) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse2) 20))))))) is different from false [2021-11-19 05:40:04,367 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) .cse0) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24|) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse2) 20))))))) is different from false [2021-11-19 05:40:05,920 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) .cse0) 1) (<= |c_t1Thread1of1ForFork1_~i~0#1| 2) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24|) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse2) 20))))))) is different from false [2021-11-19 05:40:06,525 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) .cse0) 1) (<= |c_t1Thread1of1ForFork1_~i~0#1| 2) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)))) (= (select |c_#valid| |c_~#stored_elements~0.base|) 1) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24|) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse2) 20))))))) is different from false [2021-11-19 05:40:07,897 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 3) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) .cse0) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24|) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse2) 20))))))) is different from false [2021-11-19 05:40:08,483 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 3) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) .cse0) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)))) (= (select |c_#valid| |c_~#stored_elements~0.base|) 1) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24|) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse2) 20))))))) is different from false [2021-11-19 05:40:10,032 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 4) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) .cse0) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24|) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse2) 20))))))) is different from false [2021-11-19 05:40:10,708 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 4) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) .cse0) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)))) (= (select |c_#valid| |c_~#stored_elements~0.base|) 1) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24|) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse2) 20))))))) is different from false [2021-11-19 05:40:12,309 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) .cse0) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)))) (<= |c_t1Thread1of1ForFork1_~i~0#1| 5) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24|) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse2) 20))))))) is different from false [2021-11-19 05:40:13,075 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) .cse0) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)))) (<= |c_t1Thread1of1ForFork1_~i~0#1| 5) (= (select |c_#valid| |c_~#stored_elements~0.base|) 1) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24|) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse2) 20))))))) is different from false [2021-11-19 05:40:14,338 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 6) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) .cse0) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24|) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse2) 20))))))) is different from false [2021-11-19 05:40:15,350 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 6) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) .cse0) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)))) (= (select |c_#valid| |c_~#stored_elements~0.base|) 1) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24|) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse2) 20))))))) is different from false [2021-11-19 05:40:16,953 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 7) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) .cse0) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24|) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse2) 20))))))) is different from false [2021-11-19 05:40:17,819 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 7) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) .cse0) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)))) (= (select |c_#valid| |c_~#stored_elements~0.base|) 1) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24|) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse2) 20))))))) is different from false [2021-11-19 05:40:19,140 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) .cse0) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)))) (= (select |c_#valid| |c_~#stored_elements~0.base|) 1) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24|) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_24| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse2) 20))))))) is different from false [2021-11-19 05:40:19,364 INFO L129 PetriNetUnfolder]: 2352/9229 cut-off events. [2021-11-19 05:40:19,365 INFO L130 PetriNetUnfolder]: For 1147/1147 co-relation queries the response was YES. [2021-11-19 05:40:19,414 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18268 conditions, 9229 events. 2352/9229 cut-off events. For 1147/1147 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 66523 event pairs, 157 based on Foata normal form. 15/9064 useless extension candidates. Maximal degree in co-relation 18254. Up to 820 conditions per place. [2021-11-19 05:40:19,466 INFO L132 encePairwiseOnDemand]: 205/228 looper letters, 914 selfloop transitions, 369 changer transitions 0/1408 dead transitions. [2021-11-19 05:40:19,466 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 1408 transitions, 6907 flow [2021-11-19 05:40:19,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2021-11-19 05:40:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2021-11-19 05:40:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 28905 transitions. [2021-11-19 05:40:19,540 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6779482127779342 [2021-11-19 05:40:19,540 INFO L72 ComplementDD]: Start complementDD. Operand 187 states and 28905 transitions. [2021-11-19 05:40:19,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 28905 transitions. [2021-11-19 05:40:19,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:40:19,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 187 states and 28905 transitions. [2021-11-19 05:40:19,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 188 states, 187 states have (on average 154.57219251336898) internal successors, (28905), 187 states have internal predecessors, (28905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:40:19,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 188 states, 188 states have (on average 228.0) internal successors, (42864), 188 states have internal predecessors, (42864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:40:19,779 INFO L81 ComplementDD]: Finished complementDD. Result has 188 states, 188 states have (on average 228.0) internal successors, (42864), 188 states have internal predecessors, (42864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:40:19,779 INFO L186 Difference]: Start difference. First operand has 234 places, 215 transitions, 586 flow. Second operand 187 states and 28905 transitions. [2021-11-19 05:40:19,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 1408 transitions, 6907 flow [2021-11-19 05:40:19,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 1408 transitions, 6738 flow, removed 49 selfloop flow, removed 6 redundant places. [2021-11-19 05:40:19,832 INFO L242 Difference]: Finished difference. Result has 551 places, 616 transitions, 3691 flow [2021-11-19 05:40:19,834 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=187, PETRI_FLOW=3691, PETRI_PLACES=551, PETRI_TRANSITIONS=616} [2021-11-19 05:40:19,836 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 341 predicate places. [2021-11-19 05:40:19,836 INFO L470 AbstractCegarLoop]: Abstraction has has 551 places, 616 transitions, 3691 flow [2021-11-19 05:40:19,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 155.2) internal successors, (5432), 35 states have internal predecessors, (5432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:40:19,838 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-19 05:40:19,839 INFO L254 CegarLoopForPetriNet]: 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] [2021-11-19 05:40:19,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-19 05:40:20,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:40:20,052 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)] === [2021-11-19 05:40:20,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:40:20,053 INFO L85 PathProgramCache]: Analyzing trace with hash -632383168, now seen corresponding path program 1 times [2021-11-19 05:40:20,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:40:20,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003269417] [2021-11-19 05:40:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:40:20,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:40:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:40:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:40:20,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:40:20,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003269417] [2021-11-19 05:40:20,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003269417] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 05:40:20,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866054236] [2021-11-19 05:40:20,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:40:20,427 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:40:20,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:40:20,429 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 05:40:20,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-19 05:40:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:40:20,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-19 05:40:20,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 05:40:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:40:21,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 05:40:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:40:22,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866054236] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 05:40:22,521 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 05:40:22,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2021-11-19 05:40:22,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319990380] [2021-11-19 05:40:22,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 05:40:22,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-19 05:40:22,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:40:22,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-19 05:40:22,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2021-11-19 05:40:22,538 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 228 [2021-11-19 05:40:22,545 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 616 transitions, 3691 flow. Second operand has 34 states, 34 states have (on average 211.41176470588235) internal successors, (7188), 34 states have internal predecessors, (7188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:40:22,545 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-19 05:40:22,545 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 228 [2021-11-19 05:40:22,546 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-19 05:40:28,686 INFO L129 PetriNetUnfolder]: 1110/8742 cut-off events. [2021-11-19 05:40:28,686 INFO L130 PetriNetUnfolder]: For 572020/574470 co-relation queries the response was YES. [2021-11-19 05:40:28,854 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53478 conditions, 8742 events. 1110/8742 cut-off events. For 572020/574470 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 57260 event pairs, 233 based on Foata normal form. 211/8807 useless extension candidates. Maximal degree in co-relation 53326. Up to 1081 conditions per place. [2021-11-19 05:40:28,935 INFO L132 encePairwiseOnDemand]: 222/228 looper letters, 166 selfloop transitions, 165 changer transitions 0/791 dead transitions. [2021-11-19 05:40:28,935 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 791 transitions, 7607 flow [2021-11-19 05:40:28,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-19 05:40:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2021-11-19 05:40:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 9538 transitions. [2021-11-19 05:40:28,949 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9296296296296296 [2021-11-19 05:40:28,950 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 9538 transitions. [2021-11-19 05:40:28,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 9538 transitions. [2021-11-19 05:40:28,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:40:28,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 9538 transitions. [2021-11-19 05:40:28,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 211.95555555555555) internal successors, (9538), 45 states have internal predecessors, (9538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:40:28,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 228.0) internal successors, (10488), 46 states have internal predecessors, (10488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:40:28,992 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 228.0) internal successors, (10488), 46 states have internal predecessors, (10488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:40:28,992 INFO L186 Difference]: Start difference. First operand has 551 places, 616 transitions, 3691 flow. Second operand 45 states and 9538 transitions. [2021-11-19 05:40:28,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 791 transitions, 7607 flow [2021-11-19 05:40:30,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 593 places, 791 transitions, 7587 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-11-19 05:40:30,871 INFO L242 Difference]: Finished difference. Result has 602 places, 671 transitions, 4729 flow [2021-11-19 05:40:30,872 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=3671, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=4729, PETRI_PLACES=602, PETRI_TRANSITIONS=671} [2021-11-19 05:40:30,873 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 392 predicate places. [2021-11-19 05:40:30,873 INFO L470 AbstractCegarLoop]: Abstraction has has 602 places, 671 transitions, 4729 flow [2021-11-19 05:40:30,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 211.41176470588235) internal successors, (7188), 34 states have internal predecessors, (7188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:40:30,876 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-19 05:40:30,876 INFO L254 CegarLoopForPetriNet]: 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] [2021-11-19 05:40:30,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-19 05:40:31,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-19 05:40:31,104 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)] === [2021-11-19 05:40:31,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:40:31,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1704739294, now seen corresponding path program 2 times [2021-11-19 05:40:31,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:40:31,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598943161] [2021-11-19 05:40:31,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:40:31,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:40:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:40:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:40:31,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:40:31,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598943161] [2021-11-19 05:40:31,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598943161] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 05:40:31,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200860209] [2021-11-19 05:40:31,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-19 05:40:31,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:40:31,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:40:32,000 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 05:40:32,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-19 05:40:32,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-19 05:40:32,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 05:40:32,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-19 05:40:32,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 05:40:33,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:40:33,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 05:40:35,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:40:35,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200860209] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 05:40:35,382 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 05:40:35,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2021-11-19 05:40:35,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448645718] [2021-11-19 05:40:35,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 05:40:35,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-11-19 05:40:35,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:40:35,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-11-19 05:40:35,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2021-11-19 05:40:35,408 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 228 [2021-11-19 05:40:35,421 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 671 transitions, 4729 flow. Second operand has 43 states, 43 states have (on average 211.48837209302326) internal successors, (9094), 43 states have internal predecessors, (9094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:40:35,422 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-19 05:40:35,422 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 228 [2021-11-19 05:40:35,422 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-19 05:40:44,564 INFO L129 PetriNetUnfolder]: 1430/11232 cut-off events. [2021-11-19 05:40:44,564 INFO L130 PetriNetUnfolder]: For 791491/794475 co-relation queries the response was YES. [2021-11-19 05:40:44,761 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71285 conditions, 11232 events. 1430/11232 cut-off events. For 791491/794475 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 73339 event pairs, 314 based on Foata normal form. 190/11246 useless extension candidates. Maximal degree in co-relation 71124. Up to 1406 conditions per place. [2021-11-19 05:40:44,851 INFO L132 encePairwiseOnDemand]: 222/228 looper letters, 216 selfloop transitions, 200 changer transitions 0/876 dead transitions. [2021-11-19 05:40:44,851 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 876 transitions, 9690 flow [2021-11-19 05:40:44,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-11-19 05:40:44,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2021-11-19 05:40:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 12710 transitions. [2021-11-19 05:40:44,869 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.929093567251462 [2021-11-19 05:40:44,869 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 12710 transitions. [2021-11-19 05:40:44,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 12710 transitions. [2021-11-19 05:40:44,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:40:44,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 12710 transitions. [2021-11-19 05:40:44,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 211.83333333333334) internal successors, (12710), 60 states have internal predecessors, (12710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:40:44,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 228.0) internal successors, (13908), 61 states have internal predecessors, (13908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:40:44,915 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 228.0) internal successors, (13908), 61 states have internal predecessors, (13908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:40:44,915 INFO L186 Difference]: Start difference. First operand has 602 places, 671 transitions, 4729 flow. Second operand 60 states and 12710 transitions. [2021-11-19 05:40:44,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 876 transitions, 9690 flow [2021-11-19 05:40:47,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 642 places, 876 transitions, 9375 flow, removed 68 selfloop flow, removed 19 redundant places. [2021-11-19 05:40:47,866 INFO L242 Difference]: Finished difference. Result has 648 places, 707 transitions, 5416 flow [2021-11-19 05:40:47,867 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=4464, PETRI_DIFFERENCE_MINUEND_PLACES=583, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=5416, PETRI_PLACES=648, PETRI_TRANSITIONS=707} [2021-11-19 05:40:47,868 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 438 predicate places. [2021-11-19 05:40:47,868 INFO L470 AbstractCegarLoop]: Abstraction has has 648 places, 707 transitions, 5416 flow [2021-11-19 05:40:47,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 211.48837209302326) internal successors, (9094), 43 states have internal predecessors, (9094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:40:47,869 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-19 05:40:47,870 INFO L254 CegarLoopForPetriNet]: 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, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 05:40:47,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-19 05:40:48,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-19 05:40:48,072 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)] === [2021-11-19 05:40:48,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:40:48,079 INFO L85 PathProgramCache]: Analyzing trace with hash 632076644, now seen corresponding path program 3 times [2021-11-19 05:40:48,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:40:48,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292130887] [2021-11-19 05:40:48,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:40:48,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:40:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:40:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5910 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 5529 trivial. 0 not checked. [2021-11-19 05:40:53,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:40:53,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292130887] [2021-11-19 05:40:53,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292130887] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:40:53,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:40:53,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-19 05:40:53,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490933243] [2021-11-19 05:40:53,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:40:53,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-19 05:40:53,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:40:53,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-19 05:40:53,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-11-19 05:40:53,062 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 228 [2021-11-19 05:40:53,065 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 707 transitions, 5416 flow. Second operand has 18 states, 18 states have (on average 150.0) internal successors, (2700), 18 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:40:53,065 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-19 05:40:53,065 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 228 [2021-11-19 05:40:53,065 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-19 05:41:12,221 INFO L129 PetriNetUnfolder]: 5997/24103 cut-off events. [2021-11-19 05:41:12,221 INFO L130 PetriNetUnfolder]: For 2053775/2055056 co-relation queries the response was YES. [2021-11-19 05:41:12,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 166571 conditions, 24103 events. 5997/24103 cut-off events. For 2053775/2055056 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 173374 event pairs, 1380 based on Foata normal form. 10/23914 useless extension candidates. Maximal degree in co-relation 166405. Up to 12893 conditions per place. [2021-11-19 05:41:13,068 INFO L132 encePairwiseOnDemand]: 209/228 looper letters, 401 selfloop transitions, 27 changer transitions 0/751 dead transitions. [2021-11-19 05:41:13,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 751 transitions, 8277 flow [2021-11-19 05:41:13,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-19 05:41:13,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-11-19 05:41:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2914 transitions. [2021-11-19 05:41:13,075 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.672668513388735 [2021-11-19 05:41:13,075 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2914 transitions. [2021-11-19 05:41:13,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2914 transitions. [2021-11-19 05:41:13,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:41:13,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2914 transitions. [2021-11-19 05:41:13,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 153.3684210526316) internal successors, (2914), 19 states have internal predecessors, (2914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:41:13,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 228.0) internal successors, (4560), 20 states have internal predecessors, (4560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:41:13,097 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 228.0) internal successors, (4560), 20 states have internal predecessors, (4560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:41:13,097 INFO L186 Difference]: Start difference. First operand has 648 places, 707 transitions, 5416 flow. Second operand 19 states and 2914 transitions. [2021-11-19 05:41:13,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 751 transitions, 8277 flow [2021-11-19 05:41:18,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 751 transitions, 7825 flow, removed 67 selfloop flow, removed 48 redundant places. [2021-11-19 05:41:18,737 INFO L242 Difference]: Finished difference. Result has 617 places, 704 transitions, 6216 flow [2021-11-19 05:41:18,739 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=4939, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=6216, PETRI_PLACES=617, PETRI_TRANSITIONS=704} [2021-11-19 05:41:18,739 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 407 predicate places. [2021-11-19 05:41:18,739 INFO L470 AbstractCegarLoop]: Abstraction has has 617 places, 704 transitions, 6216 flow [2021-11-19 05:41:18,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 150.0) internal successors, (2700), 18 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:41:18,740 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-19 05:41:18,740 INFO L254 CegarLoopForPetriNet]: 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, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 05:41:18,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-19 05:41:18,741 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)] === [2021-11-19 05:41:18,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:41:18,741 INFO L85 PathProgramCache]: Analyzing trace with hash -254569032, now seen corresponding path program 4 times [2021-11-19 05:41:18,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:41:18,741 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897418641] [2021-11-19 05:41:18,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:41:18,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:41:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:41:19,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5910 backedges. 2296 proven. 134 refuted. 0 times theorem prover too weak. 3480 trivial. 0 not checked. [2021-11-19 05:41:19,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:41:19,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897418641] [2021-11-19 05:41:19,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897418641] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 05:41:19,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933964181] [2021-11-19 05:41:19,930 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 05:41:19,930 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:41:19,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:41:19,931 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 05:41:19,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-19 05:41:38,645 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 05:41:38,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 05:41:38,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-19 05:41:38,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 05:41:38,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-19 05:41:38,743 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 05:41:38,743 INFO L388 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 11 treesize of output 11 [2021-11-19 05:41:40,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2021-11-19 05:41:40,471 INFO L354 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2021-11-19 05:41:40,472 INFO L388 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 29 treesize of output 28 [2021-11-19 05:41:40,615 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 05:41:40,622 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-19 05:41:40,622 INFO L388 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 [2021-11-19 05:41:40,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:41:40,675 INFO L388 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 [2021-11-19 05:41:40,700 INFO L388 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 [2021-11-19 05:41:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5910 backedges. 1169 proven. 459 refuted. 0 times theorem prover too weak. 4282 trivial. 0 not checked. [2021-11-19 05:41:40,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 05:41:54,442 INFO L388 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 99 treesize of output 93 [2021-11-19 05:41:55,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5910 backedges. 1067 proven. 411 refuted. 102 times theorem prover too weak. 4330 trivial. 0 not checked. [2021-11-19 05:41:55,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933964181] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 05:41:55,872 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 05:41:55,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 12] total 38 [2021-11-19 05:41:55,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852901272] [2021-11-19 05:41:55,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 05:41:55,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-19 05:41:55,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:41:55,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-19 05:41:55,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1240, Unknown=4, NotChecked=0, Total=1406 [2021-11-19 05:41:55,881 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 228 [2021-11-19 05:41:55,886 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 704 transitions, 6216 flow. Second operand has 38 states, 38 states have (on average 149.81578947368422) internal successors, (5693), 38 states have internal predecessors, (5693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:41:55,886 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-19 05:41:55,886 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 228 [2021-11-19 05:41:55,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-19 05:42:12,021 INFO L129 PetriNetUnfolder]: 5295/20523 cut-off events. [2021-11-19 05:42:12,021 INFO L130 PetriNetUnfolder]: For 2409974/2410929 co-relation queries the response was YES. [2021-11-19 05:42:12,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 185474 conditions, 20523 events. 5295/20523 cut-off events. For 2409974/2410929 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 149005 event pairs, 723 based on Foata normal form. 95/20463 useless extension candidates. Maximal degree in co-relation 185307. Up to 7700 conditions per place. [2021-11-19 05:42:12,718 INFO L132 encePairwiseOnDemand]: 210/228 looper letters, 426 selfloop transitions, 228 changer transitions 0/821 dead transitions. [2021-11-19 05:42:12,718 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 821 transitions, 9708 flow [2021-11-19 05:42:12,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-19 05:42:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-11-19 05:42:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2294 transitions. [2021-11-19 05:42:12,722 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6707602339181287 [2021-11-19 05:42:12,722 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2294 transitions. [2021-11-19 05:42:12,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2294 transitions. [2021-11-19 05:42:12,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:42:12,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2294 transitions. [2021-11-19 05:42:12,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 152.93333333333334) internal successors, (2294), 15 states have internal predecessors, (2294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:42:12,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 228.0) internal successors, (3648), 16 states have internal predecessors, (3648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:42:12,732 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 228.0) internal successors, (3648), 16 states have internal predecessors, (3648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:42:12,732 INFO L186 Difference]: Start difference. First operand has 617 places, 704 transitions, 6216 flow. Second operand 15 states and 2294 transitions. [2021-11-19 05:42:12,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 821 transitions, 9708 flow [2021-11-19 05:42:17,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 821 transitions, 8729 flow, removed 483 selfloop flow, removed 7 redundant places. [2021-11-19 05:42:17,894 INFO L242 Difference]: Finished difference. Result has 628 places, 724 transitions, 6358 flow [2021-11-19 05:42:17,895 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=5339, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6358, PETRI_PLACES=628, PETRI_TRANSITIONS=724} [2021-11-19 05:42:17,895 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 418 predicate places. [2021-11-19 05:42:17,896 INFO L470 AbstractCegarLoop]: Abstraction has has 628 places, 724 transitions, 6358 flow [2021-11-19 05:42:17,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 149.81578947368422) internal successors, (5693), 38 states have internal predecessors, (5693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:42:17,897 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-19 05:42:17,897 INFO L254 CegarLoopForPetriNet]: 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] [2021-11-19 05:42:17,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-19 05:42:18,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-19 05:42:18,110 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)] === [2021-11-19 05:42:18,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:42:18,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2112267678, now seen corresponding path program 1 times [2021-11-19 05:42:18,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:42:18,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769101947] [2021-11-19 05:42:18,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:42:18,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:42:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:42:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 1924 proven. 80 refuted. 0 times theorem prover too weak. 3886 trivial. 0 not checked. [2021-11-19 05:42:19,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:42:19,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769101947] [2021-11-19 05:42:19,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769101947] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 05:42:19,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470243569] [2021-11-19 05:42:19,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:42:19,365 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:42:19,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:42:19,371 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 05:42:19,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-19 05:42:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:42:19,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 1368 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-19 05:42:19,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 05:42:19,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-19 05:42:19,783 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 05:42:19,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2021-11-19 05:42:19,877 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-19 05:42:19,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-11-19 05:42:19,939 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-11-19 05:42:19,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-11-19 05:42:20,179 INFO L388 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 [2021-11-19 05:42:20,236 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-19 05:42:20,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2021-11-19 05:42:20,856 INFO L354 Elim1Store]: treesize reduction 72, result has 20.9 percent of original size [2021-11-19 05:42:20,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 44 [2021-11-19 05:42:20,974 INFO L354 Elim1Store]: treesize reduction 72, result has 20.9 percent of original size [2021-11-19 05:42:20,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 40 [2021-11-19 05:42:21,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:42:21,327 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 05:42:21,347 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-11-19 05:42:21,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2021-11-19 05:42:21,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:42:21,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:42:21,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 05:42:21,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2021-11-19 05:42:21,693 INFO L388 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 31 treesize of output 15 [2021-11-19 05:42:21,784 INFO L354 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2021-11-19 05:42:21,784 INFO L388 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 29 treesize of output 28 [2021-11-19 05:42:21,961 INFO L354 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2021-11-19 05:42:21,961 INFO L388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 30 [2021-11-19 05:42:22,027 INFO L354 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2021-11-19 05:42:22,027 INFO L388 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 25 treesize of output 24 [2021-11-19 05:42:22,053 INFO L388 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 [2021-11-19 05:42:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 947 proven. 20 refuted. 0 times theorem prover too weak. 4923 trivial. 0 not checked. [2021-11-19 05:42:23,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 05:42:37,412 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 20))) is different from false [2021-11-19 05:42:39,429 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 20))) is different from false [2021-11-19 05:43:00,307 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:43:49,724 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_230| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_155| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse5 (store (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_230| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (let ((.cse6 (select .cse5 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_230|) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store .cse5 .cse1 (+ .cse6 1))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_155|)) .cse3)) 20)) (= .cse6 20)))))) is different from false [2021-11-19 05:43:51,877 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_230| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_155| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_230|) (not (= 20 (select (let ((.cse3 (select (let ((.cse4 (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse2 (+ .cse0 1))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_155|)) .cse2)))))))) is different from false [2021-11-19 05:43:54,623 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_230| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|ULTIMATE.start_main_~#id2~0#1.offset| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_155| Int) (|ULTIMATE.start_main_#t~pre61#1| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) |ULTIMATE.start_main_~#id2~0#1.offset| |ULTIMATE.start_main_#t~pre61#1|)))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (select .cse5 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_230|) (not (= (select (let ((.cse2 (select (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store .cse5 .cse1 (+ .cse6 1))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_155|)) .cse1) 20)) (= .cse6 20))))))) is different from false [2021-11-19 05:43:57,056 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_230| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|ULTIMATE.start_main_#t~pre59#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|ULTIMATE.start_main_~#id1~0#1.offset| Int) (|ULTIMATE.start_main_~#id2~0#1.offset| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_155| Int) (|ULTIMATE.start_main_#t~pre61#1| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse3 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset| |ULTIMATE.start_main_#t~pre59#1|)))) (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base|) |ULTIMATE.start_main_~#id2~0#1.offset| |ULTIMATE.start_main_#t~pre61#1|))))) (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (not (= (select (let ((.cse0 (select (let ((.cse2 (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_155|)) .cse1) 20)) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_230|) (= .cse5 20))))))) is different from false [2021-11-19 05:44:00,986 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_230| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|ULTIMATE.start_main_#t~pre59#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|ULTIMATE.start_main_~#id1~0#1.offset| Int) (|ULTIMATE.start_main_~#id2~0#1.offset| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_155| Int) (|ULTIMATE.start_main_#t~pre61#1| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse4 (let ((.cse7 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) 0)))) (store .cse8 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset| |ULTIMATE.start_main_#t~pre59#1|))))) (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base|) |ULTIMATE.start_main_~#id2~0#1.offset| |ULTIMATE.start_main_#t~pre61#1|))))) (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store .cse5 .cse2 (+ .cse0 1))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_155|)) .cse2) 20)) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_230|))))))) is different from false [2021-11-19 05:44:02,491 INFO L354 Elim1Store]: treesize reduction 1820, result has 23.0 percent of original size [2021-11-19 05:44:02,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 8606 treesize of output 7670 [2021-11-19 05:44:02,751 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 05:44:02,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 8174 treesize of output 8234 [2021-11-19 05:44:02,930 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 05:44:02,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 8234 treesize of output 8010 [2021-11-19 05:44:03,184 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-19 05:44:03,184 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-19 05:44:03,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2021-11-19 05:44:03,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481753100] [2021-11-19 05:44:03,185 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-19 05:44:03,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-19 05:44:03,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:44:03,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-19 05:44:03,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=2648, Unknown=37, NotChecked=784, Total=3782 [2021-11-19 05:44:03,191 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 228 [2021-11-19 05:44:03,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 724 transitions, 6358 flow. Second operand has 19 states, 19 states have (on average 150.52631578947367) internal successors, (2860), 19 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:44:03,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-19 05:44:03,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 228 [2021-11-19 05:44:03,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-19 05:44:26,193 INFO L129 PetriNetUnfolder]: 7375/27154 cut-off events. [2021-11-19 05:44:26,193 INFO L130 PetriNetUnfolder]: For 3727366/3728252 co-relation queries the response was YES. [2021-11-19 05:44:26,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 271403 conditions, 27154 events. 7375/27154 cut-off events. For 3727366/3728252 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 209348 event pairs, 724 based on Foata normal form. 194/27175 useless extension candidates. Maximal degree in co-relation 271232. Up to 8839 conditions per place. [2021-11-19 05:44:27,212 INFO L132 encePairwiseOnDemand]: 206/228 looper letters, 557 selfloop transitions, 285 changer transitions 0/1008 dead transitions. [2021-11-19 05:44:27,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 1008 transitions, 13580 flow [2021-11-19 05:44:27,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-19 05:44:27,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2021-11-19 05:44:27,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3782 transitions. [2021-11-19 05:44:27,218 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6635087719298246 [2021-11-19 05:44:27,218 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3782 transitions. [2021-11-19 05:44:27,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3782 transitions. [2021-11-19 05:44:27,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:44:27,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3782 transitions. [2021-11-19 05:44:27,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 151.28) internal successors, (3782), 25 states have internal predecessors, (3782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:44:27,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 228.0) internal successors, (5928), 26 states have internal predecessors, (5928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:44:27,235 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 228.0) internal successors, (5928), 26 states have internal predecessors, (5928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:44:27,235 INFO L186 Difference]: Start difference. First operand has 628 places, 724 transitions, 6358 flow. Second operand 25 states and 3782 transitions. [2021-11-19 05:44:27,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 1008 transitions, 13580 flow [2021-11-19 05:44:55,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 1008 transitions, 13515 flow, removed 20 selfloop flow, removed 7 redundant places. [2021-11-19 05:44:55,033 INFO L242 Difference]: Finished difference. Result has 655 places, 792 transitions, 9215 flow [2021-11-19 05:44:55,035 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=6284, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=222, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=9215, PETRI_PLACES=655, PETRI_TRANSITIONS=792} [2021-11-19 05:44:55,035 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 445 predicate places. [2021-11-19 05:44:55,036 INFO L470 AbstractCegarLoop]: Abstraction has has 655 places, 792 transitions, 9215 flow [2021-11-19 05:44:55,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 150.52631578947367) internal successors, (2860), 19 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:44:55,036 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-19 05:44:55,037 INFO L254 CegarLoopForPetriNet]: 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, 13, 13, 13, 13, 13, 13, 13, 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] [2021-11-19 05:44:55,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-19 05:44:55,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-19 05:44:55,252 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)] === [2021-11-19 05:44:55,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:44:55,253 INFO L85 PathProgramCache]: Analyzing trace with hash -2025968619, now seen corresponding path program 2 times [2021-11-19 05:44:55,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:44:55,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713802659] [2021-11-19 05:44:55,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:44:55,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:44:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:44:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6040 backedges. 965 proven. 20 refuted. 0 times theorem prover too weak. 5055 trivial. 0 not checked. [2021-11-19 05:44:57,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:44:57,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713802659] [2021-11-19 05:44:57,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713802659] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 05:44:57,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450481149] [2021-11-19 05:44:57,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-19 05:44:57,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:44:57,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:44:57,046 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 05:44:57,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_242bcdac-5564-4962-a171-903b34c38dc8/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-19 05:44:57,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-19 05:44:57,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 05:44:57,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 1383 conjuncts, 64 conjunts are in the unsatisfiable core [2021-11-19 05:44:57,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 05:44:57,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-19 05:44:57,543 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 05:44:57,543 INFO L388 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 11 treesize of output 11 [2021-11-19 05:44:58,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2021-11-19 05:44:58,111 INFO L388 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 [2021-11-19 05:44:58,323 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 05:44:58,335 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-19 05:44:58,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2021-11-19 05:44:58,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:44:58,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2021-11-19 05:44:58,553 INFO L388 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 34 treesize of output 18 [2021-11-19 05:44:58,626 INFO L388 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 [2021-11-19 05:44:58,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 05:44:58,863 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-19 05:44:58,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2021-11-19 05:44:58,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:44:58,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2021-11-19 05:44:59,104 INFO L388 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 34 treesize of output 18 [2021-11-19 05:44:59,185 INFO L354 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2021-11-19 05:44:59,186 INFO L388 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 29 treesize of output 28 [2021-11-19 05:44:59,371 INFO L354 Elim1Store]: treesize reduction 69, result has 15.9 percent of original size [2021-11-19 05:44:59,371 INFO L388 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 [2021-11-19 05:44:59,433 INFO L354 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2021-11-19 05:44:59,433 INFO L388 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 25 treesize of output 24 [2021-11-19 05:44:59,454 INFO L388 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 [2021-11-19 05:45:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6040 backedges. 2403 proven. 136 refuted. 0 times theorem prover too weak. 3501 trivial. 0 not checked. [2021-11-19 05:45:00,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 05:45:16,827 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_~i~0#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2021-11-19 05:45:23,435 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int)) (or (< |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (forall ((|t1Thread1of1ForFork1_~i~0#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (< (select (select (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) is different from false [2021-11-19 05:45:24,929 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (or (< (select (select (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|)))) is different from false [2021-11-19 05:45:59,865 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse2 (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) .cse1) 20) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|))))) is different from false [2021-11-19 05:46:00,211 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:46:00,212 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:46:02,307 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_~value~0#1_107| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|v_t1Thread1of1ForFork1_~i~0#1_121| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store .cse2 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_121| 4)) |v_t1Thread1of1ForFork1_~value~0#1_107|))) |c_~#queue~0.base|) .cse1) 20)))))) is different from false [2021-11-19 05:46:04,850 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_~value~0#1_107| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|v_t1Thread1of1ForFork1_~i~0#1_121| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse4 (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store .cse2 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_121| 4)) |v_t1Thread1of1ForFork1_~value~0#1_107|))) |c_~#queue~0.base|) .cse1) 20)))))) is different from false [2021-11-19 05:46:07,098 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| Int)) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_~value~0#1_107| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|v_t1Thread1of1ForFork1_~i~0#1_121| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse3 (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| 1))))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select (select (let ((.cse2 (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_121| 4)) |v_t1Thread1of1ForFork1_~value~0#1_107|))) |c_~#queue~0.base|) .cse1) 20) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|)))))) (< |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147|))) is different from false [2021-11-19 05:46:09,305 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| Int) (|v_t1Thread1of1ForFork1_~value~0#1_107| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|v_t1Thread1of1ForFork1_~i~0#1_121| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (let ((.cse3 (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| 1))))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select (select (let ((.cse2 (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_121| 4)) |v_t1Thread1of1ForFork1_~value~0#1_107|))) |c_~#queue~0.base|) .cse1) 20) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|))))))) is different from false [2021-11-19 05:46:10,225 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:46:12,434 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| Int) (|v_t1Thread1of1ForFork1_~value~0#1_107| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|v_t1Thread1of1ForFork1_~i~0#1_121| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (let ((.cse6 (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| 1))))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| 1))) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select (select (let ((.cse5 (store .cse6 |c_~#queue~0.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_121| 4)) |v_t1Thread1of1ForFork1_~value~0#1_107|))) |c_~#queue~0.base|) .cse3) 20))))))) is different from false [2021-11-19 05:46:13,033 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:46:15,344 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_193| Int) (|v_t1Thread1of1ForFork1_~value~0#1_107| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|v_t1Thread1of1ForFork1_~i~0#1_121| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (let ((.cse6 (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| 1))))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_193|) (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| 1))) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select (select (let ((.cse5 (store .cse6 |c_~#queue~0.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_121| 4)) |v_t1Thread1of1ForFork1_~value~0#1_107|))) |c_~#queue~0.base|) .cse3) 20))))))) is different from false [2021-11-19 05:46:18,060 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285| Int)) (or (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_193| Int) (|v_t1Thread1of1ForFork1_~value~0#1_107| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|v_t1Thread1of1ForFork1_~i~0#1_121| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| Int)) (let ((.cse5 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (let ((.cse4 (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| 1))))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_193|) (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| 1))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select (select (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_121| 4)) |v_t1Thread1of1ForFork1_~value~0#1_107|))) |c_~#queue~0.base|) .cse1) 20) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147|))))))))) is different from false [2021-11-19 05:46:21,318 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_193| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|v_t1Thread1of1ForFork1_~i~0#1_121| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_~value~0#1_107| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse5 (store (store .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (let ((.cse7 (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store .cse5 .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| 1))))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_193|) (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| 1))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285|) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147|) (< (select (select (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_121| 4)) |v_t1Thread1of1ForFork1_~value~0#1_107|))) |c_~#queue~0.base|) .cse1) 20)))))))) is different from false [2021-11-19 05:46:24,986 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_193| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|v_t1Thread1of1ForFork1_~i~0#1_121| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_~value~0#1_107| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse7 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (let ((.cse8 (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| 1))))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))))) (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_193|) .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| 1)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285|) (< (select (select (let ((.cse2 (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_121| 4)) |v_t1Thread1of1ForFork1_~value~0#1_107|))) |c_~#queue~0.base|) .cse1) 20) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|)))))))) is different from false [2021-11-19 05:46:29,061 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:46:29,061 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 05:46:31,806 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_193| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|v_t1Thread1of1ForFork1_~i~0#1_121| Int) (|v_t1Thread1of1ForFork1_~i~0#1_123| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_~value~0#1_109| Int) (|v_t1Thread1of1ForFork1_~value~0#1_107| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| Int)) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse7 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store .cse6 .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| 1))))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_123| 4)) |v_t1Thread1of1ForFork1_~value~0#1_109|))))) (let ((.cse4 (select .cse1 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_193|) .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| 1)))) (or (< (select (select (let ((.cse0 (store .cse1 |c_~#queue~0.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_121| 4)) |v_t1Thread1of1ForFork1_~value~0#1_107|))) |c_~#queue~0.base|) .cse3) 20) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285|) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147|))))))))) is different from false [2021-11-19 05:46:36,217 INFO L354 Elim1Store]: treesize reduction 753, result has 30.3 percent of original size [2021-11-19 05:46:36,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 446 treesize of output 543 [2021-11-19 05:46:36,265 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 05:46:36,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 551 treesize of output 561 [2021-11-19 05:46:36,308 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 05:46:36,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 561 treesize of output 573 [2021-11-19 05:46:36,678 INFO L388 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 [2021-11-19 05:46:36,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 05:46:36,885 INFO L388 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 39 treesize of output 31 [2021-11-19 05:46:36,968 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 05:46:36,986 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-11-19 05:46:36,986 INFO L388 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 47 treesize of output 38 [2021-11-19 05:46:37,388 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 05:46:37,420 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 05:46:37,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 261 treesize of output 273 [2021-11-19 05:46:41,648 INFO L388 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 [2021-11-19 05:46:45,467 INFO L388 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 81 treesize of output 73 [2021-11-19 05:46:45,513 INFO L388 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 [2021-11-19 05:46:45,538 INFO L388 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 [2021-11-19 05:46:45,551 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-11-19 05:46:45,551 INFO L388 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 128 treesize of output 111 [2021-11-19 05:46:46,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6040 backedges. 2287 proven. 74 refuted. 0 times theorem prover too weak. 3501 trivial. 178 not checked. [2021-11-19 05:46:46,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450481149] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 05:46:46,032 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 05:46:46,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 30] total 74 [2021-11-19 05:46:46,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398427960] [2021-11-19 05:46:46,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 05:46:46,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2021-11-19 05:46:46,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:46:46,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2021-11-19 05:46:46,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=429, Invalid=3138, Unknown=29, NotChecked=1806, Total=5402 [2021-11-19 05:46:46,047 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 228 [2021-11-19 05:46:46,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 792 transitions, 9215 flow. Second operand has 74 states, 74 states have (on average 138.01351351351352) internal successors, (10213), 74 states have internal predecessors, (10213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:46:46,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-19 05:46:46,055 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 228 [2021-11-19 05:46:46,055 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-19 05:46:59,777 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_~#queue~0.base|)) (.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (and (= .cse0 1) (not (= .cse0 0)) (forall ((|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (or (< (select (select (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|)))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= (select .cse4 .cse5) 3) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse8 (store (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse7 (+ 84 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (or (< (select .cse6 .cse7) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select .cse8 .cse7) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store .cse8 .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))))) (<= (select .cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) 3) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|t1Thread1of1ForFork1_~i~0#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse4 (+ 84 |c_~#queue~0.offset|)) 3) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int)) (or (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse10 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse11 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (or (< (select .cse10 .cse11) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse10 .cse11 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse5))) (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (= (select |c_#valid| |c_~#stored_elements~0.base|) 1))) is different from false [2021-11-19 05:47:01,869 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_~#queue~0.base|)) (.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (and (= .cse0 1) (not (= .cse0 0)) (forall ((|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (or (< (select (select (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|)))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= (select .cse4 .cse5) 3) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse8 (store (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse7 (+ 84 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (or (< (select .cse6 .cse7) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select .cse8 .cse7) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store .cse8 .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))))) (<= (select .cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) 3) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse4 (+ 84 |c_~#queue~0.offset|)) 3) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int)) (or (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse10 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse11 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (or (< (select .cse10 .cse11) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse10 .cse11 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse5))) (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (= (select |c_#valid| |c_~#stored_elements~0.base|) 1))) is different from false [2021-11-19 05:47:04,217 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse2 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store .cse2 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))))) (<= (select .cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) 3) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select .cse4 (+ 84 |c_~#queue~0.offset|)) 3) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) is different from false [2021-11-19 05:47:06,237 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)) 3) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int)) (or (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|)) is different from false [2021-11-19 05:47:08,261 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse2 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store .cse2 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) 3) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) is different from false [2021-11-19 05:47:10,513 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)) (.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (or (< (select (select (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|)))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse3 .cse4) 3) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse4)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse3 (+ 84 |c_~#queue~0.offset|)) 3) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int)) (or (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse5 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (or (< (select .cse5 .cse6) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse9 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (or (< (select (select (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse9 .cse10 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (select .cse9 .cse10) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|)))))) is different from false [2021-11-19 05:47:12,548 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (or (< (select (select (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|)))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)) 3) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse3 (+ 84 |c_~#queue~0.offset|)) 3) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int)) (or (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse4 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (or (< (select .cse4 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|))) is different from false [2021-11-19 05:47:14,949 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (or (< (select (select (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|)))) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 3) (forall ((|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (or (< (select (select (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|)))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)) 3) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse6 (+ 84 |c_~#queue~0.offset|)) 3) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int)) (or (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse7 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (or (< (select .cse7 .cse8) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|))) is different from false [2021-11-19 05:47:20,697 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_193| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|v_t1Thread1of1ForFork1_~i~0#1_121| Int) (|v_t1Thread1of1ForFork1_~i~0#1_123| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_~value~0#1_109| Int) (|v_t1Thread1of1ForFork1_~value~0#1_107| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| Int)) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse7 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store .cse6 .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| 1))))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_123| 4)) |v_t1Thread1of1ForFork1_~value~0#1_109|))))) (let ((.cse4 (select .cse1 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_193|) .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| 1)))) (or (< (select (select (let ((.cse0 (store .cse1 |c_~#queue~0.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_121| 4)) |v_t1Thread1of1ForFork1_~value~0#1_107|))) |c_~#queue~0.base|) .cse3) 20) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285|) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147|))))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) is different from false [2021-11-19 05:47:22,838 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_193| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|v_t1Thread1of1ForFork1_~i~0#1_121| Int) (|v_t1Thread1of1ForFork1_~i~0#1_123| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_~value~0#1_109| Int) (|v_t1Thread1of1ForFork1_~value~0#1_107| Int) (|~#stored_elements~0.offset| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| Int)) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse7 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store .cse6 .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| 1))))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_123| 4)) |v_t1Thread1of1ForFork1_~value~0#1_109|))))) (let ((.cse4 (select .cse1 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_193|) .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| 1)))) (or (< (select (select (let ((.cse0 (store .cse1 |c_~#queue~0.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ |~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_121| 4)) |v_t1Thread1of1ForFork1_~value~0#1_107|))) |c_~#queue~0.base|) .cse3) 20) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285|) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147|))))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1)) is different from false [2021-11-19 05:47:25,192 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_193| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|v_t1Thread1of1ForFork1_~i~0#1_121| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_~value~0#1_107| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse7 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (let ((.cse8 (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| 1))))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))))) (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_193|) .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| 1)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285|) (< (select (select (let ((.cse2 (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_121| 4)) |v_t1Thread1of1ForFork1_~value~0#1_107|))) |c_~#queue~0.base|) .cse1) 20) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|)))))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1)) is different from false [2021-11-19 05:47:27,463 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_193| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|v_t1Thread1of1ForFork1_~i~0#1_121| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_~value~0#1_107| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse5 (store (store .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (let ((.cse7 (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store .cse5 .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| 1))))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_193|) (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| 1))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285|) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147|) (< (select (select (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_121| 4)) |v_t1Thread1of1ForFork1_~value~0#1_107|))) |c_~#queue~0.base|) .cse1) 20)))))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) is different from false [2021-11-19 05:47:29,595 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285| Int)) (or (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_193| Int) (|v_t1Thread1of1ForFork1_~value~0#1_107| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|v_t1Thread1of1ForFork1_~i~0#1_121| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| Int)) (let ((.cse5 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_285| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (let ((.cse4 (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147| 1))))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_193|) (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_285| 1))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select (select (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_121| 4)) |v_t1Thread1of1ForFork1_~value~0#1_107|))) |c_~#queue~0.base|) .cse1) 20) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_147|))))))))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1)) is different from false [2021-11-19 05:47:37,357 WARN L227 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 68 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 05:47:39,484 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|t1Thread1of1ForFork1_~i~0#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 2) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_~value~0#1_107| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|v_t1Thread1of1ForFork1_~i~0#1_121| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store .cse2 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_121| 4)) |v_t1Thread1of1ForFork1_~value~0#1_107|))) |c_~#queue~0.base|) .cse1) 20))))))) is different from false [2021-11-19 05:47:41,565 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|t1Thread1of1ForFork1_~i~0#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 2) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_~value~0#1_107| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|v_t1Thread1of1ForFork1_~i~0#1_121| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store .cse2 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork1_~i~0#1_121| 4)) |v_t1Thread1of1ForFork1_~value~0#1_107|))) |c_~#queue~0.base|) .cse1) 20))))))) is different from false [2021-11-19 05:47:44,011 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse2 (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) .cse1) 20) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 2)) is different from false [2021-11-19 05:47:49,519 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (or (< (select (select (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|)))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)) 3) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse6 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (or (< (select .cse4 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store .cse6 .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))))) (<= (select .cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) 3) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|t1Thread1of1ForFork1_~i~0#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|)) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse3 (+ 84 |c_~#queue~0.offset|)) 3) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int)) (or (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse8 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (or (< (select .cse8 .cse9) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) is different from false [2021-11-19 05:47:51,694 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (or (< (select (select (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|)))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)) 3) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse6 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (or (< (select .cse4 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store .cse6 .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))))) (<= (select .cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) 3) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse3 (+ 84 |c_~#queue~0.offset|)) 3) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| Int)) (or (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_~i~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse8 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_282| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 84))) (or (< (select .cse8 .cse9) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144|) (< (select (select (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_144| 1))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |t1Thread1of1ForFork1_~i~0#1| 4)) |t1Thread1of1ForFork1_~value~0#1|))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) is different from false