./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 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 20:20:26,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 20:20:26,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 20:20:26,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 20:20:26,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 20:20:26,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 20:20:26,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 20:20:26,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 20:20:26,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 20:20:26,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 20:20:26,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 20:20:26,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 20:20:26,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 20:20:26,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 20:20:26,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 20:20:26,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 20:20:26,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 20:20:26,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 20:20:26,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 20:20:26,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 20:20:26,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 20:20:26,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 20:20:26,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 20:20:26,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 20:20:26,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 20:20:26,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 20:20:26,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 20:20:26,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 20:20:26,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 20:20:26,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 20:20:26,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 20:20:26,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 20:20:26,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 20:20:26,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 20:20:26,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 20:20:26,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 20:20:26,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 20:20:26,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 20:20:26,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 20:20:26,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 20:20:26,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 20:20:26,691 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 20:20:26,716 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 20:20:26,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 20:20:26,717 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 20:20:26,718 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 20:20:26,718 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 20:20:26,718 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 20:20:26,719 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 20:20:26,719 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 20:20:26,719 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 20:20:26,719 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 20:20:26,720 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 20:20:26,720 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 20:20:26,720 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 20:20:26,720 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 20:20:26,721 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 20:20:26,721 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 20:20:26,721 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 20:20:26,721 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 20:20:26,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 20:20:26,722 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 20:20:26,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 20:20:26,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 20:20:26,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 20:20:26,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 20:20:26,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 20:20:26,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 20:20:26,724 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 20:20:26,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 20:20:26,724 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 20:20:26,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 20:20:26,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 20:20:26,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 20:20:26,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:20:26,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 20:20:26,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 20:20:26,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 20:20:26,726 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 20:20:26,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 20:20:26,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 20:20:26,727 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 20:20:26,727 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 20:20:26,727 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/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_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7 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 -> Taipan 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-25 20:20:26,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 20:20:27,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 20:20:27,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 20:20:27,022 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 20:20:27,023 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 20:20:27,024 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/pthread/queue_ok.i [2021-11-25 20:20:27,088 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/data/1c104f263/9c51568b0b6949ed9a278ea925d90242/FLAG9a588464a [2021-11-25 20:20:27,642 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 20:20:27,643 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/sv-benchmarks/c/pthread/queue_ok.i [2021-11-25 20:20:27,666 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/data/1c104f263/9c51568b0b6949ed9a278ea925d90242/FLAG9a588464a [2021-11-25 20:20:28,085 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/data/1c104f263/9c51568b0b6949ed9a278ea925d90242 [2021-11-25 20:20:28,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 20:20:28,089 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 20:20:28,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 20:20:28,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 20:20:28,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 20:20:28,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:20:28" (1/1) ... [2021-11-25 20:20:28,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dcc5e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:20:28, skipping insertion in model container [2021-11-25 20:20:28,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:20:28" (1/1) ... [2021-11-25 20:20:28,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 20:20:28,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 20:20:28,640 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_206acbbe-0c5a-41a1-9b65-556809558ee0/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2021-11-25 20:20:28,645 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_206acbbe-0c5a-41a1-9b65-556809558ee0/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2021-11-25 20:20:28,649 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:20:28,660 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 20:20:28,709 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_206acbbe-0c5a-41a1-9b65-556809558ee0/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2021-11-25 20:20:28,712 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_206acbbe-0c5a-41a1-9b65-556809558ee0/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2021-11-25 20:20:28,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:20:28,779 INFO L208 MainTranslator]: Completed translation [2021-11-25 20:20:28,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:20:28 WrapperNode [2021-11-25 20:20:28,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 20:20:28,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 20:20:28,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 20:20:28,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 20:20:28,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:20:28" (1/1) ... [2021-11-25 20:20:28,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:20:28" (1/1) ... [2021-11-25 20:20:28,841 INFO L137 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2021-11-25 20:20:28,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 20:20:28,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 20:20:28,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 20:20:28,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 20:20:28,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:20:28" (1/1) ... [2021-11-25 20:20:28,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:20:28" (1/1) ... [2021-11-25 20:20:28,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:20:28" (1/1) ... [2021-11-25 20:20:28,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:20:28" (1/1) ... [2021-11-25 20:20:28,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:20:28" (1/1) ... [2021-11-25 20:20:28,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:20:28" (1/1) ... [2021-11-25 20:20:28,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:20:28" (1/1) ... [2021-11-25 20:20:28,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 20:20:28,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 20:20:28,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 20:20:28,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 20:20:28,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:20:28" (1/1) ... [2021-11-25 20:20:28,894 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:20:28,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:20:28,926 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 20:20:28,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 20:20:28,992 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-11-25 20:20:28,992 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-11-25 20:20:28,993 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-11-25 20:20:28,993 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-11-25 20:20:28,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 20:20:28,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 20:20:28,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 20:20:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 20:20:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-25 20:20:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 20:20:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 20:20:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 20:20:28,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 20:20:28,996 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 20:20:29,199 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 20:20:29,201 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 20:20:29,558 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 20:20:29,572 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 20:20:29,572 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-25 20:20:29,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:20:29 BoogieIcfgContainer [2021-11-25 20:20:29,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 20:20:29,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 20:20:29,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 20:20:29,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 20:20:29,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:20:28" (1/3) ... [2021-11-25 20:20:29,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b1a0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:20:29, skipping insertion in model container [2021-11-25 20:20:29,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:20:28" (2/3) ... [2021-11-25 20:20:29,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b1a0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:20:29, skipping insertion in model container [2021-11-25 20:20:29,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:20:29" (3/3) ... [2021-11-25 20:20:29,596 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2021-11-25 20:20:29,601 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 20:20:29,601 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 20:20:29,601 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-25 20:20:29,601 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 20:20:29,675 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,675 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,676 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,676 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,677 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,677 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,677 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,678 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,678 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,678 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,679 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,680 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,680 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,680 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,681 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,681 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,682 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,682 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,683 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,685 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,688 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,688 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,688 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,689 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,689 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,689 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,689 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,689 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,690 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,690 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,690 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,690 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,691 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,691 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,691 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,691 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,691 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,692 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,692 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,692 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,692 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,692 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,692 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,692 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,693 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,693 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,693 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,693 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,693 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,693 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,693 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,693 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,693 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,694 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,694 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,694 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,694 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,694 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,694 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,694 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,694 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,695 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,695 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,695 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,695 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,695 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,695 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,695 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,695 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,696 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,696 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,696 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,696 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,696 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,697 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,697 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,697 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,697 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,697 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,697 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,698 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,698 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,698 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,698 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,700 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,700 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,700 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,700 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,700 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,701 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,701 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,701 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,701 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,701 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,702 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,702 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,702 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,702 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,702 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,703 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,703 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,703 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,703 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,704 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,704 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,704 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,704 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,704 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,704 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,705 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,705 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,705 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,705 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,706 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,706 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,706 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,706 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,706 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,707 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,707 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,707 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,707 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,708 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,708 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,708 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,708 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,708 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,709 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,709 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,709 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,709 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,709 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,710 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,710 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,710 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,710 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,710 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,710 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,711 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,711 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,711 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,711 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,711 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,712 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,712 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,712 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,712 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,713 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,713 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,713 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,713 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,713 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,714 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,714 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,714 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,714 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,714 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,715 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,715 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,715 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,715 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,716 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,716 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,716 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,716 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,716 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,717 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,717 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,718 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,718 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,718 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,718 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,719 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,719 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,719 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,719 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,719 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,720 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,720 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,720 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,720 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,720 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,723 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,723 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,723 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,723 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,724 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,724 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,724 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,724 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,724 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,724 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,725 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,725 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,725 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,725 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,725 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,725 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,725 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,726 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,726 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,726 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,726 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,726 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,726 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,727 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,727 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,727 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,727 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,727 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,727 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,728 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,728 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,728 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,728 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,728 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,729 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,729 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,729 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,729 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,729 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,729 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,730 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,730 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,730 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,730 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,730 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,730 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,731 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,731 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,731 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,731 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,731 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,731 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,732 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,732 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,732 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,732 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,732 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,733 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,733 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,733 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,733 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,733 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,733 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,734 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,734 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,734 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,734 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,734 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,735 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,735 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,735 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,735 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,735 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,735 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,736 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,736 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,736 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,736 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,736 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,737 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,737 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,737 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,737 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,737 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,737 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,738 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,738 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,738 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,738 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,738 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,738 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,739 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,739 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,739 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,739 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,739 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,739 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,740 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,740 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,740 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,740 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,740 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,740 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,740 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,741 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,741 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,741 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,741 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,741 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,741 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,742 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,742 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,742 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,742 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,742 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,742 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,742 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,743 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,743 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,743 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,743 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,743 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,743 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,744 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,744 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,744 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,744 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,744 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,744 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,745 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,745 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,745 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,745 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,745 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,745 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,746 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,746 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,746 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,746 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,746 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,747 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,747 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,747 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,747 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,747 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,747 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,748 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,748 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,748 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,748 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,748 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,748 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,749 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,749 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,749 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,749 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,749 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,749 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,750 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,750 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,750 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,750 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,750 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,750 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,751 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,751 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,751 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,751 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,751 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,751 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,752 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,752 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,752 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,752 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,752 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,752 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,753 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,753 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,753 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,753 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,753 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,753 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,754 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,754 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,754 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,754 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,754 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,754 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,755 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,755 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,755 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,755 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,755 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,755 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,756 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,756 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,756 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,756 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,756 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,756 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,757 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,757 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,757 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,757 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,757 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,757 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,758 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,758 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,758 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,758 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,758 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,758 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,759 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,759 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,759 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,759 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,759 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,759 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,760 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,760 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,760 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,760 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,760 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,760 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,761 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,761 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,761 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,761 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,761 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,761 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,764 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,766 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,766 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,766 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,766 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,767 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,767 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,767 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,767 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,767 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,767 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,768 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,768 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,768 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,768 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,768 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,768 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,769 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,769 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,771 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,772 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,772 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,772 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,772 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,772 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,772 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,773 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,773 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,773 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,773 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,773 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,773 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,774 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,774 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,774 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,774 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,774 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,774 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,775 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,775 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,775 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,775 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,775 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,775 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,776 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,776 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,776 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,776 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,776 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,776 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:20:29,779 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-11-25 20:20:29,852 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 20:20:29,859 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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-25 20:20:29,859 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-25 20:20:29,874 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 20:20:29,888 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 231 transitions, 478 flow [2021-11-25 20:20:29,891 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 231 transitions, 478 flow [2021-11-25 20:20:29,892 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 225 places, 231 transitions, 478 flow [2021-11-25 20:20:30,013 INFO L129 PetriNetUnfolder]: 13/229 cut-off events. [2021-11-25 20:20:30,013 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-11-25 20:20:30,022 INFO L84 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 229 events. 13/229 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 369 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 146. Up to 3 conditions per place. [2021-11-25 20:20:30,034 INFO L116 LiptonReduction]: Number of co-enabled transitions 10630 [2021-11-25 20:20:38,771 INFO L131 LiptonReduction]: Checked pairs total: 21764 [2021-11-25 20:20:38,772 INFO L133 LiptonReduction]: Total number of compositions: 219 [2021-11-25 20:20:38,791 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 51 transitions, 118 flow [2021-11-25 20:20:38,842 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 511 states, 509 states have (on average 2.6935166994106092) internal successors, (1371), 510 states have internal predecessors, (1371), 0 states have call successors, (0), 0 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-25 20:20:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 511 states, 509 states have (on average 2.6935166994106092) internal successors, (1371), 510 states have internal predecessors, (1371), 0 states have call successors, (0), 0 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-25 20:20:38,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-11-25 20:20:38,852 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:20:38,853 INFO L514 BasicCegarLoop]: trace histogram [1] [2021-11-25 20:20:38,853 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-25 20:20:38,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:20:38,858 INFO L85 PathProgramCache]: Analyzing trace with hash 908, now seen corresponding path program 1 times [2021-11-25 20:20:38,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:20:38,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221525519] [2021-11-25 20:20:38,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:20:38,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:20:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:20:38,981 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-25 20:20:38,982 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:20:38,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221525519] [2021-11-25 20:20:38,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221525519] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:20:38,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:20:38,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-11-25 20:20:38,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940491504] [2021-11-25 20:20:38,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:20:38,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-25 20:20:38,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:20:39,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-25 20:20:39,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 20:20:39,014 INFO L87 Difference]: Start difference. First operand has 511 states, 509 states have (on average 2.6935166994106092) internal successors, (1371), 510 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 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-25 20:20:39,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:20:39,125 INFO L93 Difference]: Finished difference Result 510 states and 1370 transitions. [2021-11-25 20:20:39,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-25 20:20:39,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2021-11-25 20:20:39,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:20:39,150 INFO L225 Difference]: With dead ends: 510 [2021-11-25 20:20:39,150 INFO L226 Difference]: Without dead ends: 510 [2021-11-25 20:20:39,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 20:20:39,154 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:20:39,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:20:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-11-25 20:20:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2021-11-25 20:20:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 2.6915520628683693) internal successors, (1370), 509 states have internal predecessors, (1370), 0 states have call successors, (0), 0 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-25 20:20:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1370 transitions. [2021-11-25 20:20:39,249 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1370 transitions. Word has length 1 [2021-11-25 20:20:39,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:20:39,249 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 1370 transitions. [2021-11-25 20:20:39,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 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-25 20:20:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1370 transitions. [2021-11-25 20:20:39,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 20:20:39,253 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:20:39,254 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:20:39,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 20:20:39,254 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-25 20:20:39,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:20:39,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2036548527, now seen corresponding path program 1 times [2021-11-25 20:20:39,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:20:39,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163219761] [2021-11-25 20:20:39,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:20:39,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:20:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:20:39,449 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-25 20:20:39,449 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:20:39,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163219761] [2021-11-25 20:20:39,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163219761] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:20:39,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:20:39,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 20:20:39,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398790374] [2021-11-25 20:20:39,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:20:39,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:20:39,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:20:39,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:20:39,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:20:39,453 INFO L87 Difference]: Start difference. First operand 510 states and 1370 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-25 20:20:39,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:20:39,515 INFO L93 Difference]: Finished difference Result 220 states and 476 transitions. [2021-11-25 20:20:39,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:20:39,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 20:20:39,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:20:39,517 INFO L225 Difference]: With dead ends: 220 [2021-11-25 20:20:39,517 INFO L226 Difference]: Without dead ends: 198 [2021-11-25 20:20:39,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:20:39,519 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:20:39,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 6 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:20:39,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-25 20:20:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-11-25 20:20:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.203045685279188) internal successors, (434), 197 states have internal predecessors, (434), 0 states have call successors, (0), 0 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-25 20:20:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 434 transitions. [2021-11-25 20:20:39,533 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 434 transitions. Word has length 15 [2021-11-25 20:20:39,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:20:39,533 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 434 transitions. [2021-11-25 20:20:39,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-25 20:20:39,534 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 434 transitions. [2021-11-25 20:20:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 20:20:39,536 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:20:39,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:20:39,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 20:20:39,537 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-25 20:20:39,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:20:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1851270233, now seen corresponding path program 1 times [2021-11-25 20:20:39,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:20:39,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71841653] [2021-11-25 20:20:39,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:20:39,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:20:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:20:39,640 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-25 20:20:39,640 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:20:39,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71841653] [2021-11-25 20:20:39,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71841653] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:20:39,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:20:39,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:20:39,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061385426] [2021-11-25 20:20:39,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:20:39,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:20:39,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:20:39,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:20:39,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:20:39,644 INFO L87 Difference]: Start difference. First operand 198 states and 434 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-25 20:20:39,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:20:39,724 INFO L93 Difference]: Finished difference Result 258 states and 560 transitions. [2021-11-25 20:20:39,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:20:39,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 20:20:39,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:20:39,727 INFO L225 Difference]: With dead ends: 258 [2021-11-25 20:20:39,727 INFO L226 Difference]: Without dead ends: 258 [2021-11-25 20:20:39,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:20:39,729 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:20:39,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 8 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:20:39,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-25 20:20:39,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 204. [2021-11-25 20:20:39,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.1970443349753697) internal successors, (446), 203 states have internal predecessors, (446), 0 states have call successors, (0), 0 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-25 20:20:39,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 446 transitions. [2021-11-25 20:20:39,742 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 446 transitions. Word has length 19 [2021-11-25 20:20:39,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:20:39,742 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 446 transitions. [2021-11-25 20:20:39,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-25 20:20:39,743 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 446 transitions. [2021-11-25 20:20:39,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 20:20:39,752 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:20:39,752 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:20:39,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 20:20:39,752 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-25 20:20:39,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:20:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1917374764, now seen corresponding path program 1 times [2021-11-25 20:20:39,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:20:39,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184429746] [2021-11-25 20:20:39,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:20:39,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:20:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:20:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:20:39,903 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:20:39,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184429746] [2021-11-25 20:20:39,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184429746] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:20:39,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:20:39,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:20:39,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032534421] [2021-11-25 20:20:39,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:20:39,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:20:39,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:20:39,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:20:39,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:20:39,905 INFO L87 Difference]: Start difference. First operand 204 states and 446 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-25 20:20:39,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:20:39,973 INFO L93 Difference]: Finished difference Result 152 states and 304 transitions. [2021-11-25 20:20:39,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:20:39,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-25 20:20:39,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:20:39,975 INFO L225 Difference]: With dead ends: 152 [2021-11-25 20:20:39,976 INFO L226 Difference]: Without dead ends: 150 [2021-11-25 20:20:39,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:20:39,983 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:20:39,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 3 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:20:39,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-11-25 20:20:39,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-11-25 20:20:39,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.0201342281879193) internal successors, (301), 149 states have internal predecessors, (301), 0 states have call successors, (0), 0 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-25 20:20:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 301 transitions. [2021-11-25 20:20:39,994 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 301 transitions. Word has length 26 [2021-11-25 20:20:39,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:20:39,994 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 301 transitions. [2021-11-25 20:20:39,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-25 20:20:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 301 transitions. [2021-11-25 20:20:39,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 20:20:39,996 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:20:39,996 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:20:39,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 20:20:39,997 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-25 20:20:39,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:20:39,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1649277712, now seen corresponding path program 1 times [2021-11-25 20:20:39,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:20:39,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809565110] [2021-11-25 20:20:39,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:20:39,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:20:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:20:40,112 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-25 20:20:40,113 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:20:40,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809565110] [2021-11-25 20:20:40,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809565110] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:20:40,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12302959] [2021-11-25 20:20:40,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:20:40,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:20:40,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:20:40,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:20:40,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 20:20:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:20:40,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 20:20:40,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:20:40,393 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-25 20:20:40,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:20:40,471 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-25 20:20:40,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12302959] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:20:40,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1045589384] [2021-11-25 20:20:40,479 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:20:40,481 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:20:40,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-25 20:20:40,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081742529] [2021-11-25 20:20:40,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:20:40,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 20:20:40,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:20:40,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 20:20:40,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-25 20:20:40,484 INFO L87 Difference]: Start difference. First operand 150 states and 301 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 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-25 20:20:40,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:20:40,631 INFO L93 Difference]: Finished difference Result 270 states and 523 transitions. [2021-11-25 20:20:40,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:20:40,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 20:20:40,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:20:40,634 INFO L225 Difference]: With dead ends: 270 [2021-11-25 20:20:40,634 INFO L226 Difference]: Without dead ends: 270 [2021-11-25 20:20:40,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-25 20:20:40,635 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:20:40,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 16 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:20:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-11-25 20:20:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-11-25 20:20:40,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.9442379182156133) internal successors, (523), 269 states have internal predecessors, (523), 0 states have call successors, (0), 0 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-25 20:20:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 523 transitions. [2021-11-25 20:20:40,653 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 523 transitions. Word has length 27 [2021-11-25 20:20:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:20:40,653 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 523 transitions. [2021-11-25 20:20:40,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 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-25 20:20:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 523 transitions. [2021-11-25 20:20:40,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-25 20:20:40,665 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:20:40,665 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:20:40,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 20:20:40,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:20:40,892 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-25 20:20:40,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:20:40,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2065031247, now seen corresponding path program 2 times [2021-11-25 20:20:40,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:20:40,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088509655] [2021-11-25 20:20:40,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:20:40,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:20:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:20:41,052 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:20:41,052 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:20:41,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088509655] [2021-11-25 20:20:41,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088509655] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:20:41,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284095774] [2021-11-25 20:20:41,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:20:41,053 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:20:41,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:20:41,054 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:20:41,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 20:20:42,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 20:20:42,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:20:42,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-25 20:20:42,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:20:42,280 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-25 20:20:42,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:20:42,333 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 16 treesize of output 18 [2021-11-25 20:20:42,431 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:20:42,442 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-25 20:20:42,443 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-25 20:20:42,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:20:42,515 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 23 treesize of output 22 [2021-11-25 20:20:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-25 20:20:42,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:20:46,560 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_343 Int) (v_ArrVal_342 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_342) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_343) .cse1) 20)))) is different from false [2021-11-25 20:20:46,577 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:20:46,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 42 [2021-11-25 20:20:46,588 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:20:46,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 77 [2021-11-25 20:20:46,597 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 48 treesize of output 40 [2021-11-25 20:20:46,971 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-25 20:20:46,987 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:20:46,988 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 62 treesize of output 62 [2021-11-25 20:20:47,210 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2021-11-25 20:20:47,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284095774] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:20:47,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [393093374] [2021-11-25 20:20:47,211 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:20:47,212 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:20:47,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2021-11-25 20:20:47,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587496503] [2021-11-25 20:20:47,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:20:47,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 20:20:47,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:20:47,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 20:20:47,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=240, Unknown=6, NotChecked=32, Total=342 [2021-11-25 20:20:47,216 INFO L87 Difference]: Start difference. First operand 270 states and 523 transitions. Second operand has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-25 20:20:47,818 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_343 Int) (v_ArrVal_342 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_342) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_343) .cse1) 20)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= 0 |c_t1Thread1of1ForFork0_~i~0#1|) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:20:48,687 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_343 Int) (v_ArrVal_342 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_342) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_343) .cse1) 20)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:20:49,308 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_343 Int) (v_ArrVal_342 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_342) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_343) .cse1) 20)))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:20:49,758 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_343 Int) (v_ArrVal_342 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_342) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_343) .cse1) 20)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:20:50,427 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_343 Int) (v_ArrVal_342 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_342) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_343) .cse1) 20)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:20:51,073 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_343 Int) (v_ArrVal_342 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_342) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_343) .cse1) 20)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:20:51,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:20:51,281 INFO L93 Difference]: Finished difference Result 797 states and 1491 transitions. [2021-11-25 20:20:51,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 20:20:51,288 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-25 20:20:51,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:20:51,295 INFO L225 Difference]: With dead ends: 797 [2021-11-25 20:20:51,295 INFO L226 Difference]: Without dead ends: 797 [2021-11-25 20:20:51,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=480, Invalid=1258, Unknown=12, NotChecked=602, Total=2352 [2021-11-25 20:20:51,298 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 350 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 318 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:20:51,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 58 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 839 Invalid, 0 Unknown, 318 Unchecked, 0.6s Time] [2021-11-25 20:20:51,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2021-11-25 20:20:51,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 452. [2021-11-25 20:20:51,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 1.8492239467849223) internal successors, (834), 451 states have internal predecessors, (834), 0 states have call successors, (0), 0 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-25 20:20:51,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 834 transitions. [2021-11-25 20:20:51,323 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 834 transitions. Word has length 48 [2021-11-25 20:20:51,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:20:51,323 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 834 transitions. [2021-11-25 20:20:51,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-25 20:20:51,324 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 834 transitions. [2021-11-25 20:20:51,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-25 20:20:51,325 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:20:51,326 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:20:51,364 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-25 20:20:51,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-25 20:20:51,540 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-25 20:20:51,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:20:51,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1225844482, now seen corresponding path program 1 times [2021-11-25 20:20:51,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:20:51,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074503775] [2021-11-25 20:20:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:20:51,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:20:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:20:51,692 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:20:51,692 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:20:51,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074503775] [2021-11-25 20:20:51,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074503775] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:20:51,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85423094] [2021-11-25 20:20:51,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:20:51,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:20:51,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:20:51,694 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:20:51,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 20:20:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:20:51,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 20:20:51,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:20:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:20:51,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:20:52,131 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:20:52,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85423094] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:20:52,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1020772808] [2021-11-25 20:20:52,132 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:20:52,135 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:20:52,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-11-25 20:20:52,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353603925] [2021-11-25 20:20:52,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:20:52,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 20:20:52,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:20:52,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 20:20:52,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:20:52,141 INFO L87 Difference]: Start difference. First operand 452 states and 834 transitions. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 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-25 20:20:52,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:20:52,434 INFO L93 Difference]: Finished difference Result 897 states and 1586 transitions. [2021-11-25 20:20:52,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 20:20:52,435 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-11-25 20:20:52,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:20:52,441 INFO L225 Difference]: With dead ends: 897 [2021-11-25 20:20:52,441 INFO L226 Difference]: Without dead ends: 897 [2021-11-25 20:20:52,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:20:52,442 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 174 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:20:52,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 29 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:20:52,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-11-25 20:20:52,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 816. [2021-11-25 20:20:52,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 815 states have (on average 1.7730061349693251) internal successors, (1445), 815 states have internal predecessors, (1445), 0 states have call successors, (0), 0 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-25 20:20:52,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1445 transitions. [2021-11-25 20:20:52,470 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1445 transitions. Word has length 49 [2021-11-25 20:20:52,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:20:52,471 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1445 transitions. [2021-11-25 20:20:52,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 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-25 20:20:52,471 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1445 transitions. [2021-11-25 20:20:52,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-25 20:20:52,474 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:20:52,474 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 20:20:52,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 20:20:52,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-25 20:20:52,688 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-25 20:20:52,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:20:52,689 INFO L85 PathProgramCache]: Analyzing trace with hash 521226462, now seen corresponding path program 2 times [2021-11-25 20:20:52,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:20:52,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243112283] [2021-11-25 20:20:52,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:20:52,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:20:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:20:52,921 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:20:52,921 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:20:52,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243112283] [2021-11-25 20:20:52,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243112283] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:20:52,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517021734] [2021-11-25 20:20:52,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:20:52,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:20:52,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:20:52,923 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:20:52,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 20:20:53,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 20:20:53,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:20:53,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 49 conjunts are in the unsatisfiable core [2021-11-25 20:20:53,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:20:54,050 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-25 20:20:54,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:20:54,089 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 16 treesize of output 18 [2021-11-25 20:20:54,164 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:20:54,172 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-25 20:20:54,173 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 2 case distinctions, treesize of input 31 treesize of output 27 [2021-11-25 20:20:54,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:20:54,246 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 23 treesize of output 22 [2021-11-25 20:20:54,277 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2021-11-25 20:20:54,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:20:54,585 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_724 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_724)) .cse1)) 20)) is different from false [2021-11-25 20:20:54,597 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:20:54,598 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 39 [2021-11-25 20:20:54,608 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:20:54,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 62 [2021-11-25 20:20:54,617 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 44 treesize of output 32 [2021-11-25 20:20:54,627 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-25 20:20:54,653 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:20:54,654 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 54 [2021-11-25 20:20:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 40 proven. 72 refuted. 0 times theorem prover too weak. 204 trivial. 9 not checked. [2021-11-25 20:20:54,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517021734] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:20:54,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [68332186] [2021-11-25 20:20:54,922 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:20:54,924 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:20:54,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 9] total 27 [2021-11-25 20:20:54,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747954290] [2021-11-25 20:20:54,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:20:54,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-25 20:20:54,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:20:54,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-25 20:20:54,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=479, Unknown=1, NotChecked=48, Total=702 [2021-11-25 20:20:54,927 INFO L87 Difference]: Start difference. First operand 816 states and 1445 transitions. Second operand has 27 states, 27 states have (on average 5.518518518518518) internal successors, (149), 27 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-25 20:20:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:20:57,114 INFO L93 Difference]: Finished difference Result 1416 states and 2411 transitions. [2021-11-25 20:20:57,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-25 20:20:57,114 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.518518518518518) internal successors, (149), 27 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-11-25 20:20:57,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:20:57,123 INFO L225 Difference]: With dead ends: 1416 [2021-11-25 20:20:57,123 INFO L226 Difference]: Without dead ends: 1416 [2021-11-25 20:20:57,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 167 SyntacticMatches, 14 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1458 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1372, Invalid=2921, Unknown=1, NotChecked=128, Total=4422 [2021-11-25 20:20:57,126 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 993 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:20:57,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [993 Valid, 24 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 471 Invalid, 0 Unknown, 172 Unchecked, 0.7s Time] [2021-11-25 20:20:57,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2021-11-25 20:20:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 913. [2021-11-25 20:20:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 912 states have (on average 1.8475877192982457) internal successors, (1685), 912 states have internal predecessors, (1685), 0 states have call successors, (0), 0 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-25 20:20:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1685 transitions. [2021-11-25 20:20:57,161 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1685 transitions. Word has length 91 [2021-11-25 20:20:57,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:20:57,161 INFO L470 AbstractCegarLoop]: Abstraction has 913 states and 1685 transitions. [2021-11-25 20:20:57,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.518518518518518) internal successors, (149), 27 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-25 20:20:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1685 transitions. [2021-11-25 20:20:57,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-25 20:20:57,165 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:20:57,165 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:20:57,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 20:20:57,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-25 20:20:57,384 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-25 20:20:57,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:20:57,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1320485840, now seen corresponding path program 1 times [2021-11-25 20:20:57,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:20:57,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964237378] [2021-11-25 20:20:57,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:20:57,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:20:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:20:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 0 proven. 490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:20:57,660 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:20:57,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964237378] [2021-11-25 20:20:57,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964237378] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:20:57,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155661783] [2021-11-25 20:20:57,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:20:57,660 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:20:57,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:20:57,661 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:20:57,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 20:20:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:20:57,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-25 20:20:57,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:20:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 0 proven. 490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:20:58,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:20:58,486 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 0 proven. 490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:20:58,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155661783] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:20:58,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [632294611] [2021-11-25 20:20:58,488 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:20:58,489 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:20:58,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 23 [2021-11-25 20:20:58,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594221245] [2021-11-25 20:20:58,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:20:58,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-25 20:20:58,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:20:58,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-25 20:20:58,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2021-11-25 20:20:58,492 INFO L87 Difference]: Start difference. First operand 913 states and 1685 transitions. Second operand has 23 states, 23 states have (on average 7.6521739130434785) internal successors, (176), 23 states have internal predecessors, (176), 0 states have call successors, (0), 0 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-25 20:20:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:20:58,909 INFO L93 Difference]: Finished difference Result 1354 states and 2483 transitions. [2021-11-25 20:20:58,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 20:20:58,910 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.6521739130434785) internal successors, (176), 23 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2021-11-25 20:20:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:20:58,921 INFO L225 Difference]: With dead ends: 1354 [2021-11-25 20:20:58,921 INFO L226 Difference]: Without dead ends: 1354 [2021-11-25 20:20:58,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 226 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2021-11-25 20:20:58,923 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 421 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:20:58,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 32 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 20:20:58,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2021-11-25 20:20:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1354. [2021-11-25 20:20:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1353 states have (on average 1.8351810790835181) internal successors, (2483), 1353 states have internal predecessors, (2483), 0 states have call successors, (0), 0 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-25 20:20:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 2483 transitions. [2021-11-25 20:20:58,998 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 2483 transitions. Word has length 117 [2021-11-25 20:20:58,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:20:59,000 INFO L470 AbstractCegarLoop]: Abstraction has 1354 states and 2483 transitions. [2021-11-25 20:20:59,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.6521739130434785) internal successors, (176), 23 states have internal predecessors, (176), 0 states have call successors, (0), 0 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-25 20:20:59,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 2483 transitions. [2021-11-25 20:20:59,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-25 20:20:59,005 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:20:59,005 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 11, 11, 11, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:20:59,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 20:20:59,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:20:59,232 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-25 20:20:59,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:20:59,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1118243168, now seen corresponding path program 2 times [2021-11-25 20:20:59,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:20:59,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765355238] [2021-11-25 20:20:59,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:20:59,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:20:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:20:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2021-11-25 20:20:59,937 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:20:59,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765355238] [2021-11-25 20:20:59,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765355238] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:20:59,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:20:59,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:20:59,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119413515] [2021-11-25 20:20:59,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:20:59,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:20:59,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:20:59,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:20:59,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:20:59,940 INFO L87 Difference]: Start difference. First operand 1354 states and 2483 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-25 20:21:00,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:21:00,064 INFO L93 Difference]: Finished difference Result 1344 states and 2463 transitions. [2021-11-25 20:21:00,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:21:00,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2021-11-25 20:21:00,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:21:00,074 INFO L225 Difference]: With dead ends: 1344 [2021-11-25 20:21:00,074 INFO L226 Difference]: Without dead ends: 1344 [2021-11-25 20:21:00,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:21:00,075 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:21:00,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 9 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:21:00,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2021-11-25 20:21:00,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1344. [2021-11-25 20:21:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1343 states have (on average 1.8339538346984363) internal successors, (2463), 1343 states have internal predecessors, (2463), 0 states have call successors, (0), 0 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-25 20:21:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2463 transitions. [2021-11-25 20:21:00,149 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2463 transitions. Word has length 169 [2021-11-25 20:21:00,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:21:00,150 INFO L470 AbstractCegarLoop]: Abstraction has 1344 states and 2463 transitions. [2021-11-25 20:21:00,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-25 20:21:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2463 transitions. [2021-11-25 20:21:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-11-25 20:21:00,155 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:21:00,155 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 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] [2021-11-25 20:21:00,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-25 20:21:00,155 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-25 20:21:00,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:21:00,156 INFO L85 PathProgramCache]: Analyzing trace with hash -188513169, now seen corresponding path program 3 times [2021-11-25 20:21:00,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:21:00,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221688983] [2021-11-25 20:21:00,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:21:00,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:21:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:21:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 661 proven. 77 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2021-11-25 20:21:01,110 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:21:01,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221688983] [2021-11-25 20:21:01,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221688983] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:21:01,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113354468] [2021-11-25 20:21:01,110 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:21:01,111 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:21:01,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:21:01,116 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:21:01,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 20:23:43,922 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:23:43,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:23:44,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 73 conjunts are in the unsatisfiable core [2021-11-25 20:23:44,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:23:45,049 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-25 20:23:45,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:23:45,087 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 16 treesize of output 18 [2021-11-25 20:23:45,171 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:23:45,181 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-25 20:23:45,182 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 2 case distinctions, treesize of input 31 treesize of output 27 [2021-11-25 20:23:45,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:23:45,250 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 23 treesize of output 22 [2021-11-25 20:23:45,348 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-11-25 20:23:45,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:23:45,390 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 16 treesize of output 18 [2021-11-25 20:23:45,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:23:45,489 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-25 20:23:45,489 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-25 20:23:45,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:23:45,560 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 23 treesize of output 22 [2021-11-25 20:23:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 703 proven. 5 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2021-11-25 20:23:45,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:23:50,146 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1610 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162| Int) (v_ArrVal_1612 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1610) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162| 4) |c_~#queue~0.offset|) v_ArrVal_1612) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162|)))) is different from false [2021-11-25 20:23:50,162 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1610 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162| Int) (v_ArrVal_1612 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1610) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162| 4) |c_~#queue~0.offset|) v_ArrVal_1612) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162|)))) is different from false [2021-11-25 20:23:50,182 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1610 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162| Int) (v_ArrVal_1612 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1610) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162| 4) |c_~#queue~0.offset|) v_ArrVal_1612) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162|)))) is different from false [2021-11-25 20:23:50,219 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1606 Int) (v_ArrVal_1610 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162| Int) (v_ArrVal_1612 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1606)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1610) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162| 4) |c_~#queue~0.offset|) v_ArrVal_1612) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162|)))) is different from false [2021-11-25 20:23:50,256 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1606 Int) (v_ArrVal_1605 Int) (v_ArrVal_1610 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162| Int) (v_ArrVal_1612 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1605) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1606)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1610) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162| 4) |c_~#queue~0.offset|) v_ArrVal_1612) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162|)))) is different from false [2021-11-25 20:23:50,279 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1606 Int) (v_ArrVal_1605 Int) (v_ArrVal_1610 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162| Int) (v_ArrVal_1612 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (store (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1605)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1606))) (store .cse2 .cse1 (+ (select .cse2 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1610) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162| 4) |c_~#queue~0.offset|) v_ArrVal_1612) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162|))))) is different from false [2021-11-25 20:23:50,302 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1606 Int) (v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1605 Int) (v_ArrVal_1610 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162| Int) (v_ArrVal_1612 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1603))) (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store (let ((.cse4 (select .cse2 |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1605)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1606))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1610) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162| 4) |c_~#queue~0.offset|) v_ArrVal_1612) .cse1) 20)))))) is different from false [2021-11-25 20:23:50,317 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:23:50,318 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 181 [2021-11-25 20:23:50,329 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:23:50,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 292 treesize of output 286 [2021-11-25 20:23:50,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:23:50,341 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 256 treesize of output 232 [2021-11-25 20:23:50,349 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 317 treesize of output 301 [2021-11-25 20:23:50,735 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-25 20:23:50,760 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:23:50,760 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 330 treesize of output 314 [2021-11-25 20:23:51,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 549 proven. 65 refuted. 0 times theorem prover too weak. 487 trivial. 94 not checked. [2021-11-25 20:23:51,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113354468] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:23:51,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1599554174] [2021-11-25 20:23:51,236 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:23:51,237 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:23:51,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 32 [2021-11-25 20:23:51,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691156544] [2021-11-25 20:23:51,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:23:51,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-25 20:23:51,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:51,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-25 20:23:51,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=487, Unknown=14, NotChecked=378, Total=1056 [2021-11-25 20:23:51,244 INFO L87 Difference]: Start difference. First operand 1344 states and 2463 transitions. Second operand has 33 states, 33 states have (on average 4.121212121212121) internal successors, (136), 32 states have internal predecessors, (136), 0 states have call successors, (0), 0 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-25 20:23:52,151 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1610 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162| Int) (v_ArrVal_1612 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1610) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162| 4) |c_~#queue~0.offset|) v_ArrVal_1612) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_162|)))) (= 6 |c_~#stored_elements~0.base|) (not (= |c_~#queue~0.base| 6)) (= 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) (= 2 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:23:52,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:52,821 INFO L93 Difference]: Finished difference Result 3058 states and 5345 transitions. [2021-11-25 20:23:52,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 20:23:52,822 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.121212121212121) internal successors, (136), 32 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2021-11-25 20:23:52,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:52,841 INFO L225 Difference]: With dead ends: 3058 [2021-11-25 20:23:52,841 INFO L226 Difference]: Without dead ends: 3058 [2021-11-25 20:23:52,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 323 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=359, Invalid=990, Unknown=15, NotChecked=616, Total=1980 [2021-11-25 20:23:52,843 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 323 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1142 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:52,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 95 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 958 Invalid, 0 Unknown, 1142 Unchecked, 0.6s Time] [2021-11-25 20:23:52,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2021-11-25 20:23:52,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2268. [2021-11-25 20:23:52,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2268 states, 2267 states have (on average 1.7287163652404058) internal successors, (3919), 2267 states have internal predecessors, (3919), 0 states have call successors, (0), 0 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-25 20:23:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 3919 transitions. [2021-11-25 20:23:52,946 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 3919 transitions. Word has length 170 [2021-11-25 20:23:52,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:52,946 INFO L470 AbstractCegarLoop]: Abstraction has 2268 states and 3919 transitions. [2021-11-25 20:23:52,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.121212121212121) internal successors, (136), 32 states have internal predecessors, (136), 0 states have call successors, (0), 0 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-25 20:23:52,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 3919 transitions. [2021-11-25 20:23:52,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-11-25 20:23:52,954 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:52,954 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 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] [2021-11-25 20:23:53,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 20:23:53,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:23:53,168 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-25 20:23:53,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:53,169 INFO L85 PathProgramCache]: Analyzing trace with hash 874017146, now seen corresponding path program 1 times [2021-11-25 20:23:53,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:53,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136669043] [2021-11-25 20:23:53,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:53,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 304 proven. 14 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2021-11-25 20:23:53,733 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:53,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136669043] [2021-11-25 20:23:53,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136669043] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:23:53,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856201602] [2021-11-25 20:23:53,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:53,734 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:23:53,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:23:53,735 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:23:53,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 20:23:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:54,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 1205 conjuncts, 63 conjunts are in the unsatisfiable core [2021-11-25 20:23:54,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:23:54,770 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-25 20:23:54,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:23:54,800 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 16 treesize of output 18 [2021-11-25 20:23:54,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:23:54,872 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-25 20:23:54,873 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-25 20:23:54,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:23:54,927 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 23 treesize of output 22 [2021-11-25 20:23:55,002 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-11-25 20:23:55,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:23:55,035 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 16 treesize of output 18 [2021-11-25 20:23:55,101 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:23:55,109 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-25 20:23:55,109 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-25 20:23:55,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:23:55,148 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 23 treesize of output 22 [2021-11-25 20:23:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 518 proven. 80 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2021-11-25 20:23:55,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:24:01,814 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2023) .cse1) 20))))) is different from false [2021-11-25 20:24:01,833 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2023) .cse1) 20))))) is different from false [2021-11-25 20:24:01,852 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2023) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201|)))) is different from false [2021-11-25 20:24:01,887 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2018 Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2018)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2023) .cse1) 20))))) is different from false [2021-11-25 20:24:01,939 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2016 Int) (v_ArrVal_2018 Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_2016) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2018)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2023) .cse1) 20))))) is different from false [2021-11-25 20:24:01,980 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2016 Int) (v_ArrVal_2018 Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2016) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2018))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201|) (not (= 20 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2023) .cse1))))))) is different from false [2021-11-25 20:24:02,019 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2014 (Array Int Int)) (v_ArrVal_2016 Int) (v_ArrVal_2018 Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2014))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2016) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2018))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2023) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|)))))) is different from false [2021-11-25 20:24:02,038 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:24:02,038 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 217 treesize of output 157 [2021-11-25 20:24:02,049 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:24:02,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 287 treesize of output 285 [2021-11-25 20:24:02,066 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 284 treesize of output 268 [2021-11-25 20:24:02,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:24:02,107 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 295 treesize of output 283 [2021-11-25 20:24:02,717 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-25 20:24:02,740 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:24:02,740 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 322 treesize of output 318 [2021-11-25 20:24:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 415 proven. 75 refuted. 0 times theorem prover too weak. 597 trivial. 108 not checked. [2021-11-25 20:24:03,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856201602] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:24:03,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1063407977] [2021-11-25 20:24:03,207 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:24:03,208 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:24:03,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 33 [2021-11-25 20:24:03,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730708042] [2021-11-25 20:24:03,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:24:03,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-25 20:24:03,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:24:03,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-25 20:24:03,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=569, Unknown=18, NotChecked=392, Total=1122 [2021-11-25 20:24:03,214 INFO L87 Difference]: Start difference. First operand 2268 states and 3919 transitions. Second operand has 34 states, 34 states have (on average 3.764705882352941) internal successors, (128), 33 states have internal predecessors, (128), 0 states have call successors, (0), 0 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-25 20:24:03,957 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_2023 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2014 (Array Int Int)) (v_ArrVal_2016 Int) (v_ArrVal_2018 Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2014))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2016) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2018))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2023) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|)))))) (= 6 |c_~#stored_elements~0.base|) (not (= |c_~#queue~0.base| 6)) (= (select .cse5 84) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (= 7 |c_~#queue~0.base|) (= (select .cse5 (+ 84 |c_~#queue~0.offset|)) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2021-11-25 20:24:04,447 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= 6 |c_~#stored_elements~0.base|) (not (= |c_~#queue~0.base| 6)) (= (select .cse0 84) 1) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (forall ((v_ArrVal_2023 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2016 Int) (v_ArrVal_2018 Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (store (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2016) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2018))) (store .cse4 .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201|) (not (= 20 (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2023) .cse2))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2021-11-25 20:24:05,376 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84)))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_~#queue~0.base| 6)) (= 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) (= 2 (select .cse0 (+ 84 |c_~#queue~0.offset|))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_2023 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201|) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2023) .cse2) 20))))) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (<= (* 4 (select .cse0 84)) 8) (= 7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= .cse3 2) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= .cse3 20)) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2021-11-25 20:24:06,182 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2023 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2014 (Array Int Int)) (v_ArrVal_2016 Int) (v_ArrVal_2018 Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2014))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2016) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2018))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2023) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|)))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:24:06,810 WARN L838 $PredicateComparison]: unable to prove that (and (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (forall ((v_ArrVal_2023 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2016 Int) (v_ArrVal_2018 Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2016) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2018))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201|) (not (= 20 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2023) .cse1))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:24:07,454 WARN L838 $PredicateComparison]: unable to prove that (and (= 2 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2023 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2021 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2023) .cse1) 20))))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= 7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84)) 2) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:24:08,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:24:08,224 INFO L93 Difference]: Finished difference Result 7183 states and 11776 transitions. [2021-11-25 20:24:08,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-25 20:24:08,225 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.764705882352941) internal successors, (128), 33 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2021-11-25 20:24:08,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:24:08,266 INFO L225 Difference]: With dead ends: 7183 [2021-11-25 20:24:08,266 INFO L226 Difference]: Without dead ends: 7183 [2021-11-25 20:24:08,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 325 SyntacticMatches, 11 SemanticMatches, 58 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=453, Invalid=1737, Unknown=24, NotChecked=1326, Total=3540 [2021-11-25 20:24:08,268 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 349 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 1817 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 3372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1487 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:24:08,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 171 Invalid, 3372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1817 Invalid, 0 Unknown, 1487 Unchecked, 1.0s Time] [2021-11-25 20:24:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7183 states. [2021-11-25 20:24:08,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7183 to 3060. [2021-11-25 20:24:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 3059 states have (on average 1.8993135011441649) internal successors, (5810), 3059 states have internal predecessors, (5810), 0 states have call successors, (0), 0 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-25 20:24:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 5810 transitions. [2021-11-25 20:24:08,443 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 5810 transitions. Word has length 171 [2021-11-25 20:24:08,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:24:08,444 INFO L470 AbstractCegarLoop]: Abstraction has 3060 states and 5810 transitions. [2021-11-25 20:24:08,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.764705882352941) internal successors, (128), 33 states have internal predecessors, (128), 0 states have call successors, (0), 0 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-25 20:24:08,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 5810 transitions. [2021-11-25 20:24:08,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-11-25 20:24:08,453 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:24:08,453 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 12, 12, 12, 12, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:24:08,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-25 20:24:08,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:24:08,675 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-25 20:24:08,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:24:08,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1974402343, now seen corresponding path program 4 times [2021-11-25 20:24:08,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:24:08,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294303006] [2021-11-25 20:24:08,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:24:08,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:24:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:24:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1224 backedges. 215 proven. 5 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2021-11-25 20:24:09,329 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:24:09,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294303006] [2021-11-25 20:24:09,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294303006] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:24:09,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024054445] [2021-11-25 20:24:09,330 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:24:09,330 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:24:09,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:24:09,330 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:24:09,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 20:24:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:24:09,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 1205 conjuncts, 52 conjunts are in the unsatisfiable core [2021-11-25 20:24:09,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:24:09,763 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-25 20:24:09,763 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 20 treesize of output 22 [2021-11-25 20:24:09,945 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-25 20:24:09,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:24:09,978 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 16 treesize of output 18 [2021-11-25 20:24:10,047 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 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-25 20:24:10,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:24:10,088 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-25 20:24:10,089 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-25 20:24:10,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:24:10,126 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 23 treesize of output 22 [2021-11-25 20:24:10,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1224 backedges. 309 proven. 10 refuted. 0 times theorem prover too weak. 905 trivial. 0 not checked. [2021-11-25 20:24:10,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:24:10,605 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2425 (Array Int Int)) (v_ArrVal_2427 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2425) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_2427) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84)) 20))) is different from false [2021-11-25 20:24:10,621 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2425 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_271| Int) (v_ArrVal_2427 Int)) (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2425) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_271| 4) |c_~#queue~0.offset|) v_ArrVal_2427) .cse0) 20)) (< (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_271|)))) is different from false [2021-11-25 20:24:10,637 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2425 (Array Int Int)) (v_ArrVal_2424 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_271| Int) (v_ArrVal_2427 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2424)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2425) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_271| 4) |c_~#queue~0.offset|) v_ArrVal_2427) .cse1) 20)) (< (select (select .cse0 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_271|)))) is different from false [2021-11-25 20:24:10,650 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:24:10,650 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 46 [2021-11-25 20:24:10,660 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:24:10,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 230 [2021-11-25 20:24:10,668 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 266 treesize of output 250 [2021-11-25 20:24:10,679 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 300 treesize of output 288 [2021-11-25 20:24:10,694 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-25 20:24:10,719 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:24:10,720 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 343 treesize of output 339 [2021-11-25 20:24:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1224 backedges. 309 proven. 8 refuted. 0 times theorem prover too weak. 905 trivial. 2 not checked. [2021-11-25 20:24:11,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024054445] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:24:11,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1576272275] [2021-11-25 20:24:11,031 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:24:11,032 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:24:11,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2021-11-25 20:24:11,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217415966] [2021-11-25 20:24:11,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:24:11,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 20:24:11,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:24:11,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 20:24:11,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=349, Unknown=3, NotChecked=120, Total=552 [2021-11-25 20:24:11,036 INFO L87 Difference]: Start difference. First operand 3060 states and 5810 transitions. Second operand has 24 states, 24 states have (on average 3.9166666666666665) internal successors, (94), 23 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:24:11,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:24:11,853 INFO L93 Difference]: Finished difference Result 3501 states and 6598 transitions. [2021-11-25 20:24:11,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 20:24:11,853 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.9166666666666665) internal successors, (94), 23 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2021-11-25 20:24:11,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:24:11,868 INFO L225 Difference]: With dead ends: 3501 [2021-11-25 20:24:11,868 INFO L226 Difference]: Without dead ends: 3501 [2021-11-25 20:24:11,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 335 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=221, Invalid=718, Unknown=3, NotChecked=180, Total=1122 [2021-11-25 20:24:11,869 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 232 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:24:11,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 26 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 562 Invalid, 0 Unknown, 259 Unchecked, 0.4s Time] [2021-11-25 20:24:11,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2021-11-25 20:24:11,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 2951. [2021-11-25 20:24:11,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2951 states, 2950 states have (on average 1.9006779661016948) internal successors, (5607), 2950 states have internal predecessors, (5607), 0 states have call successors, (0), 0 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-25 20:24:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 5607 transitions. [2021-11-25 20:24:11,956 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 5607 transitions. Word has length 172 [2021-11-25 20:24:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:24:11,956 INFO L470 AbstractCegarLoop]: Abstraction has 2951 states and 5607 transitions. [2021-11-25 20:24:11,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.9166666666666665) internal successors, (94), 23 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:24:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 5607 transitions. [2021-11-25 20:24:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-11-25 20:24:11,965 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:24:11,966 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 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] [2021-11-25 20:24:12,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-11-25 20:24:12,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-25 20:24:12,192 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-25 20:24:12,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:24:12,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1251530480, now seen corresponding path program 5 times [2021-11-25 20:24:12,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:24:12,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76986219] [2021-11-25 20:24:12,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:24:12,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:24:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:24:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 685 proven. 72 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2021-11-25 20:24:13,484 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:24:13,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76986219] [2021-11-25 20:24:13,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76986219] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:24:13,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066094793] [2021-11-25 20:24:13,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:24:13,485 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:24:13,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:24:13,488 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:24:13,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 20:24:16,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-11-25 20:24:16,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:24:16,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 83 conjunts are in the unsatisfiable core [2021-11-25 20:24:16,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:24:17,315 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-25 20:24:17,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:24:17,339 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 16 treesize of output 18 [2021-11-25 20:24:17,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:24:17,397 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-25 20:24:17,397 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-25 20:24:17,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:24:17,444 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 23 treesize of output 22 [2021-11-25 20:24:17,503 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 0 case distinctions, treesize of input 34 treesize of output 18 [2021-11-25 20:24:17,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:24:17,528 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 16 treesize of output 18 [2021-11-25 20:24:17,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:24:17,590 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-25 20:24:17,590 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-25 20:24:17,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:24:17,632 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 23 treesize of output 22 [2021-11-25 20:24:17,695 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-11-25 20:24:17,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:24:17,727 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 16 treesize of output 18 [2021-11-25 20:24:17,781 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:24:17,796 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-25 20:24:17,796 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 2 case distinctions, treesize of input 31 treesize of output 27 [2021-11-25 20:24:17,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:24:17,840 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 23 treesize of output 22 [2021-11-25 20:24:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 342 proven. 103 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2021-11-25 20:24:17,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:24:18,010 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2841 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2841)) .cse1)) 20))) is different from false [2021-11-25 20:24:18,016 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2841 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2841)) .cse1)) 20))) is different from false [2021-11-25 20:24:18,023 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2841 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2841)) .cse1))))) is different from false [2021-11-25 20:24:18,032 WARN L838 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84)) 20) (forall ((v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2841 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2841)) .cse1)))))) is different from false [2021-11-25 20:24:18,059 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2837 Int) (v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2841 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2837)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse0 (select .cse3 .cse4))) (or (= 20 .cse0) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_2841)) .cse2)) 20)))))) is different from false [2021-11-25 20:24:18,095 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2837 Int) (v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2841 Int) (v_ArrVal_2835 Int)) (let ((.cse3 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_2835) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2837)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (not (= 20 (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2841)) .cse2)))))))) is different from false [2021-11-25 20:24:18,129 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2837 Int) (v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| Int) (v_ArrVal_2835 Int)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| 4) |c_~#queue~0.offset|) v_ArrVal_2835) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2837)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283|) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2841)) .cse2) 20))))))) is different from false [2021-11-25 20:24:18,165 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2837 Int) (v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| Int) (v_ArrVal_2835 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2833))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| 4) |c_~#queue~0.offset|) v_ArrVal_2835) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2837)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2841)) .cse1))) (= 20 .cse4) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283|))))))) is different from false [2021-11-25 20:24:18,242 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2837 Int) (v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2841 Int) (v_ArrVal_2832 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| Int) (v_ArrVal_2835 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) v_ArrVal_2832)) |c_~#stored_elements~0.base| v_ArrVal_2833))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| 4) |c_~#queue~0.offset|) v_ArrVal_2835) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2837)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2841)) .cse1))) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_2832) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283|) (= .cse4 20))))))) is different from false [2021-11-25 20:24:18,322 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2837 Int) (v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2841 Int) (v_ArrVal_2832 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| Int) (v_ArrVal_2835 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_2832)) |c_~#stored_elements~0.base| v_ArrVal_2833))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| 4) |c_~#queue~0.offset|) v_ArrVal_2835) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2837)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2841)) .cse1))) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283|) (= .cse4 20) (< (+ (select .cse6 .cse7) 1) v_ArrVal_2832)))))))) is different from false [2021-11-25 20:24:18,486 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2837 Int) (v_ArrVal_2829 Int) (v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2841 Int) (v_ArrVal_2832 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| Int) (v_ArrVal_2835 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2829)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_2832)) |c_~#stored_elements~0.base| v_ArrVal_2833))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| 4) |c_~#queue~0.offset|) v_ArrVal_2835) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2837)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse7 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283|) (= 20 .cse2) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2832) (not (= (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2841)) .cse1) 20))))))))) is different from false [2021-11-25 20:24:18,721 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2827 Int) (v_ArrVal_2837 Int) (v_ArrVal_2829 Int) (v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2841 Int) (v_ArrVal_2832 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| Int) (v_ArrVal_2835 Int)) (let ((.cse1 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_2827) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2829)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_2832)) |c_~#stored_elements~0.base| v_ArrVal_2833))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| 4) |c_~#queue~0.offset|) v_ArrVal_2835) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2837)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse7 .cse4))) (or (= .cse0 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2832) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283|) (not (= (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2841)) .cse4) 20))))))))) is different from false [2021-11-25 20:24:18,876 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2827 Int) (v_ArrVal_2837 Int) (v_ArrVal_2829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2841 Int) (v_ArrVal_2832 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| Int) (v_ArrVal_2835 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse3 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) v_ArrVal_2827) .cse8 v_ArrVal_2829)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse3 .cse1 v_ArrVal_2832)) |c_~#stored_elements~0.base| v_ArrVal_2833))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| 4) |c_~#queue~0.offset|) v_ArrVal_2835) .cse8 v_ArrVal_2837))) (let ((.cse7 (select .cse6 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2832) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2841)) .cse1) 20)) (= .cse7 20))))))))) is different from false [2021-11-25 20:24:19,032 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2827 Int) (v_ArrVal_2837 Int) (v_ArrVal_2829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2841 Int) (v_ArrVal_2832 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| Int) (v_ArrVal_2826 (Array Int Int)) (v_ArrVal_2835 Int)) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2826))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) v_ArrVal_2827) .cse8 v_ArrVal_2829)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (store .cse6 .cse1 v_ArrVal_2832)) |c_~#stored_elements~0.base| v_ArrVal_2833))) (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| 4) |c_~#queue~0.offset|) v_ArrVal_2835) .cse8 v_ArrVal_2837))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2841)) .cse1) 20)) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2832) (= .cse5 20) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283|)))))))))) is different from false [2021-11-25 20:24:19,064 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:24:19,065 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 610 treesize of output 440 [2021-11-25 20:24:19,087 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:24:19,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 800 treesize of output 794 [2021-11-25 20:24:19,098 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:24:19,105 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 637 treesize of output 629 [2021-11-25 20:24:19,122 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 616 treesize of output 568 [2021-11-25 20:24:19,134 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:24:19,140 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 845 treesize of output 805 [2021-11-25 20:24:31,378 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 7 treesize of output 3 [2021-11-25 20:24:31,413 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:24:31,414 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 586 treesize of output 582 [2021-11-25 20:24:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 101 proven. 85 refuted. 0 times theorem prover too weak. 801 trivial. 259 not checked. [2021-11-25 20:24:32,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066094793] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:24:32,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [440460087] [2021-11-25 20:24:32,010 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:24:32,011 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:24:32,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 20] total 48 [2021-11-25 20:24:32,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470949791] [2021-11-25 20:24:32,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:24:32,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-11-25 20:24:32,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:24:32,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-11-25 20:24:32,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=960, Unknown=14, NotChecked=1106, Total=2352 [2021-11-25 20:24:32,015 INFO L87 Difference]: Start difference. First operand 2951 states and 5607 transitions. Second operand has 49 states, 49 states have (on average 3.2653061224489797) internal successors, (160), 48 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-25 20:24:33,441 WARN L838 $PredicateComparison]: unable to prove that (and (= 6 |c_~#stored_elements~0.base|) (forall ((v_ArrVal_2827 Int) (v_ArrVal_2837 Int) (v_ArrVal_2829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2841 Int) (v_ArrVal_2832 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| Int) (v_ArrVal_2826 (Array Int Int)) (v_ArrVal_2835 Int)) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2826))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) v_ArrVal_2827) .cse8 v_ArrVal_2829)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (store .cse6 .cse1 v_ArrVal_2832)) |c_~#stored_elements~0.base| v_ArrVal_2833))) (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| 4) |c_~#queue~0.offset|) v_ArrVal_2835) .cse8 v_ArrVal_2837))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2841)) .cse1) 20)) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2832) (= .cse5 20) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283|)))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84)) 1) (<= |c_~#stored_elements~0.base| 6) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1)) is different from false [2021-11-25 20:24:34,117 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_2827 Int) (v_ArrVal_2837 Int) (v_ArrVal_2829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| Int) (v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2841 Int) (v_ArrVal_2832 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| Int) (v_ArrVal_2835 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse3 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285| 4) |c_~#queue~0.offset|) v_ArrVal_2827) .cse8 v_ArrVal_2829)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse3 .cse1 v_ArrVal_2832)) |c_~#stored_elements~0.base| v_ArrVal_2833))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| 4) |c_~#queue~0.offset|) v_ArrVal_2835) .cse8 v_ArrVal_2837))) (let ((.cse7 (select .cse6 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_285|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2832) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2841)) .cse1) 20)) (= .cse7 20))))))))) (= 6 |c_~#stored_elements~0.base|) (not (= |c_~#queue~0.base| 6)) (= (select .cse9 84) 1) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse9 (+ 84 |c_~#queue~0.offset|)) 1))) is different from false [2021-11-25 20:24:34,984 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= 6 |c_~#stored_elements~0.base|) (not (= |c_~#queue~0.base| 6)) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 2) (= 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) (forall ((v_ArrVal_2837 Int) (v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| Int) (v_ArrVal_2835 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2833))) (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| 4) |c_~#queue~0.offset|) v_ArrVal_2835) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2837)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse2))) (or (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2841)) .cse2))) (= 20 .cse5) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283|))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (<= (* 4 (select .cse0 84)) 8) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84)) 20)) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2021-11-25 20:24:35,594 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= 6 |c_~#stored_elements~0.base|) (not (= |c_~#queue~0.base| 6)) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 2) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_2837 Int) (v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| Int) (v_ArrVal_2835 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283| 4) |c_~#queue~0.offset|) v_ArrVal_2835) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2837)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse1 20) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_283|) (not (= (select (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2841)) .cse3) 20))))))) (<= (* 4 (select .cse0 84)) 8) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2021-11-25 20:24:35,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:24:35,834 INFO L93 Difference]: Finished difference Result 4986 states and 8746 transitions. [2021-11-25 20:24:35,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 20:24:35,834 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.2653061224489797) internal successors, (160), 48 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2021-11-25 20:24:35,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:24:35,855 INFO L225 Difference]: With dead ends: 4986 [2021-11-25 20:24:35,856 INFO L226 Difference]: Without dead ends: 4986 [2021-11-25 20:24:35,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 320 SyntacticMatches, 9 SemanticMatches, 71 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=769, Invalid=2255, Unknown=18, NotChecked=2214, Total=5256 [2021-11-25 20:24:35,858 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 163 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1365 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:24:35,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 57 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 718 Invalid, 0 Unknown, 1365 Unchecked, 0.4s Time] [2021-11-25 20:24:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4986 states. [2021-11-25 20:24:35,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4986 to 3988. [2021-11-25 20:24:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3988 states, 3987 states have (on average 1.7985954351642839) internal successors, (7171), 3987 states have internal predecessors, (7171), 0 states have call successors, (0), 0 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-25 20:24:35,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3988 states to 3988 states and 7171 transitions. [2021-11-25 20:24:35,998 INFO L78 Accepts]: Start accepts. Automaton has 3988 states and 7171 transitions. Word has length 173 [2021-11-25 20:24:35,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:24:35,999 INFO L470 AbstractCegarLoop]: Abstraction has 3988 states and 7171 transitions. [2021-11-25 20:24:35,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.2653061224489797) internal successors, (160), 48 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-25 20:24:35,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3988 states and 7171 transitions. [2021-11-25 20:24:36,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-11-25 20:24:36,011 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:24:36,011 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 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] [2021-11-25 20:24:36,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-25 20:24:36,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-25 20:24:36,232 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-25 20:24:36,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:24:36,233 INFO L85 PathProgramCache]: Analyzing trace with hash -891895737, now seen corresponding path program 2 times [2021-11-25 20:24:36,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:24:36,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274110432] [2021-11-25 20:24:36,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:24:36,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:24:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:24:36,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 596 proven. 39 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2021-11-25 20:24:36,923 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:24:36,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274110432] [2021-11-25 20:24:36,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274110432] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:24:36,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57054651] [2021-11-25 20:24:36,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:24:36,924 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:24:36,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:24:36,925 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:24:36,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-25 20:24:39,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-11-25 20:24:39,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:24:39,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 87 conjunts are in the unsatisfiable core [2021-11-25 20:24:39,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:24:40,618 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-25 20:24:40,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:24:40,647 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 16 treesize of output 18 [2021-11-25 20:24:40,699 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:24:40,706 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-25 20:24:40,707 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-25 20:24:40,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:24:40,756 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 23 treesize of output 22 [2021-11-25 20:24:40,832 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 0 case distinctions, treesize of input 34 treesize of output 18 [2021-11-25 20:24:40,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:24:40,857 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 16 treesize of output 18 [2021-11-25 20:24:40,928 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:24:40,937 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-25 20:24:40,937 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-25 20:24:40,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:24:40,983 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 23 treesize of output 22 [2021-11-25 20:24:41,044 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-11-25 20:24:41,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:24:41,069 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 16 treesize of output 18 [2021-11-25 20:24:41,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:24:41,145 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-25 20:24:41,146 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 2 case distinctions, treesize of input 31 treesize of output 27 [2021-11-25 20:24:41,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:24:41,190 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 23 treesize of output 22 [2021-11-25 20:24:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 342 proven. 103 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2021-11-25 20:24:41,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:24:41,348 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3255 (Array Int Int)) (v_ArrVal_3257 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_3257)) .cse1)) 20))) is different from false [2021-11-25 20:24:41,354 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3255 (Array Int Int)) (v_ArrVal_3257 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3257)) .cse1)) 20))) is different from false [2021-11-25 20:24:41,360 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3255 (Array Int Int)) (v_ArrVal_3257 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_3257)) .cse1)) 20))) is different from false [2021-11-25 20:24:41,370 WARN L838 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84)) 20) (forall ((v_ArrVal_3255 (Array Int Int)) (v_ArrVal_3257 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_3257)) .cse1)) 20)))) is different from false [2021-11-25 20:24:41,384 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3255 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3251 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3251)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3257)) .cse1)) 20)) (= .cse4 20))))) is different from false [2021-11-25 20:24:41,430 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3249 Int) (v_ArrVal_3255 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3251 Int)) (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_3249) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3251)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_3257)) .cse1)) 20)) (= 20 .cse4))))) is different from false [2021-11-25 20:24:41,464 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3249 Int) (v_ArrVal_3255 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| Int) (v_ArrVal_3257 Int) (v_ArrVal_3251 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| 4)) v_ArrVal_3249) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3251)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select .cse2 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3257)) .cse1) 20)) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327|) (= .cse3 20)))))) is different from false [2021-11-25 20:24:41,498 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3249 Int) (v_ArrVal_3255 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| Int) (v_ArrVal_3248 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3251 Int)) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3248))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| 4)) v_ArrVal_3249) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3251)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327|) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse2) 4)) v_ArrVal_3257)) .cse2) 20)))))))) is different from false [2021-11-25 20:24:41,569 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3249 Int) (v_ArrVal_3255 (Array Int Int)) (v_ArrVal_3247 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| Int) (v_ArrVal_3248 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3251 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) v_ArrVal_3247)) |c_~#stored_elements~0.base| v_ArrVal_3248))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| 4)) v_ArrVal_3249) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3251)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse5 .cse2))) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_3247) (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327|) (not (= 20 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_3257)) .cse2))))))))) is different from false [2021-11-25 20:24:41,628 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3249 Int) (v_ArrVal_3255 (Array Int Int)) (v_ArrVal_3247 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| Int) (v_ArrVal_3248 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3251 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_3247)) |c_~#stored_elements~0.base| v_ArrVal_3248))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| 4)) v_ArrVal_3249) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3251)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse7 .cse4))) (or (= .cse0 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_3247) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327|) (not (= 20 (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_3257)) .cse4)))))))))) is different from false [2021-11-25 20:24:41,818 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3249 Int) (v_ArrVal_3255 (Array Int Int)) (v_ArrVal_3247 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| Int) (v_ArrVal_3248 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3244 Int) (v_ArrVal_3251 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3244)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_3247)) |c_~#stored_elements~0.base| v_ArrVal_3248))) (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| 4)) v_ArrVal_3249) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3251)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse6 .cse4))) (or (= .cse0 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_3247) (not (= (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_3257)) .cse4) 20)) (< (select .cse7 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327|)))))))) is different from false [2021-11-25 20:24:41,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3249 Int) (v_ArrVal_3255 (Array Int Int)) (v_ArrVal_3247 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| Int) (v_ArrVal_3248 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3244 Int) (v_ArrVal_3242 Int) (v_ArrVal_3251 Int)) (let ((.cse6 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_3242) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3244)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_3247)) |c_~#stored_elements~0.base| v_ArrVal_3248))) (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| 4)) v_ArrVal_3249) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3251)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_3257)) .cse2) 20)) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327|) (< (+ 1 (select .cse6 .cse7)) v_ArrVal_3247)))))))) is different from false [2021-11-25 20:24:42,085 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3249 Int) (v_ArrVal_3255 (Array Int Int)) (v_ArrVal_3247 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| Int) (v_ArrVal_3248 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3244 Int) (v_ArrVal_3242 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_329| Int) (v_ArrVal_3251 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_329| 4) |c_~#queue~0.offset|) v_ArrVal_3242) .cse8 v_ArrVal_3244)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 v_ArrVal_3247)) |c_~#stored_elements~0.base| v_ArrVal_3248))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| 4)) v_ArrVal_3249) .cse8 v_ArrVal_3251))) (let ((.cse2 (select .cse6 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327|) (= .cse2 20) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_329|) (not (= 20 (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) v_ArrVal_3257)) .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_3247))))))))) is different from false [2021-11-25 20:24:42,240 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3241 (Array Int Int)) (v_ArrVal_3249 Int) (v_ArrVal_3255 (Array Int Int)) (v_ArrVal_3247 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| Int) (v_ArrVal_3248 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3244 Int) (v_ArrVal_3242 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_329| Int) (v_ArrVal_3251 Int)) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3241))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_329| 4) |c_~#queue~0.offset|) v_ArrVal_3242) .cse8 v_ArrVal_3244)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_3247)) |c_~#stored_elements~0.base| v_ArrVal_3248))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| 4)) v_ArrVal_3249) .cse8 v_ArrVal_3251))) (let ((.cse3 (select .cse7 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_329|) (< (+ 1 (select .cse2 .cse1)) v_ArrVal_3247) (= .cse3 20) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327|) (not (= (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3257)) .cse1) 20))))))))))) is different from false [2021-11-25 20:24:42,260 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:24:42,261 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 610 treesize of output 440 [2021-11-25 20:24:42,274 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:24:42,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 800 treesize of output 794 [2021-11-25 20:24:42,295 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 608 treesize of output 560 [2021-11-25 20:24:42,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:24:42,316 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 645 treesize of output 637 [2021-11-25 20:24:42,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:24:42,332 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 881 treesize of output 841 [2021-11-25 20:24:42,594 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 7 treesize of output 3 [2021-11-25 20:24:46,449 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:24:46,449 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 713 treesize of output 713 [2021-11-25 20:24:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 101 proven. 85 refuted. 0 times theorem prover too weak. 801 trivial. 259 not checked. [2021-11-25 20:24:46,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57054651] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:24:46,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [981629941] [2021-11-25 20:24:46,939 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:24:46,940 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:24:46,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 20] total 50 [2021-11-25 20:24:46,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851676630] [2021-11-25 20:24:46,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:24:46,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-11-25 20:24:46,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:24:46,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-11-25 20:24:46,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1071, Unknown=14, NotChecked=1162, Total=2550 [2021-11-25 20:24:46,944 INFO L87 Difference]: Start difference. First operand 3988 states and 7171 transitions. Second operand has 51 states, 51 states have (on average 3.2745098039215685) internal successors, (167), 50 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-25 20:24:47,799 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3241 (Array Int Int)) (v_ArrVal_3249 Int) (v_ArrVal_3255 (Array Int Int)) (v_ArrVal_3247 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| Int) (v_ArrVal_3248 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3244 Int) (v_ArrVal_3242 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_329| Int) (v_ArrVal_3251 Int)) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3241))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_329| 4) |c_~#queue~0.offset|) v_ArrVal_3242) .cse8 v_ArrVal_3244)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_3247)) |c_~#stored_elements~0.base| v_ArrVal_3248))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| 4)) v_ArrVal_3249) .cse8 v_ArrVal_3251))) (let ((.cse3 (select .cse7 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_329|) (< (+ 1 (select .cse2 .cse1)) v_ArrVal_3247) (= .cse3 20) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327|) (not (= (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3257)) .cse1) 20))))))))))) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84)) 1) (<= |c_~#stored_elements~0.base| 6) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1)) is different from false [2021-11-25 20:24:48,493 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_3249 Int) (v_ArrVal_3255 (Array Int Int)) (v_ArrVal_3247 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| Int) (v_ArrVal_3248 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3244 Int) (v_ArrVal_3242 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_329| Int) (v_ArrVal_3251 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_329| 4) |c_~#queue~0.offset|) v_ArrVal_3242) .cse8 v_ArrVal_3244)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 v_ArrVal_3247)) |c_~#stored_elements~0.base| v_ArrVal_3248))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| 4)) v_ArrVal_3249) .cse8 v_ArrVal_3251))) (let ((.cse2 (select .cse6 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327|) (= .cse2 20) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_329|) (not (= 20 (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) v_ArrVal_3257)) .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_3247))))))))) (= (select .cse9 84) 1) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse9 (+ 84 |c_~#queue~0.offset|)) 1))) is different from false [2021-11-25 20:24:49,306 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3249 Int) (v_ArrVal_3255 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| Int) (v_ArrVal_3248 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3251 Int)) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3248))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| 4)) v_ArrVal_3249) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3251)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327|) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse2) 4)) v_ArrVal_3257)) .cse2) 20)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 2) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84)) 2) (= 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:24:49,929 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 2) (= |c_~#queue~0.offset| 0) (<= (* 4 (select .cse0 84)) 8) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_3249 Int) (v_ArrVal_3255 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| Int) (v_ArrVal_3257 Int) (v_ArrVal_3251 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| 4)) v_ArrVal_3249) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3251)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse3 .cse2))) (or (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse3 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_3257)) .cse2) 20)) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327|) (= .cse4 20)))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2021-11-25 20:24:50,989 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_3241 (Array Int Int)) (v_ArrVal_3249 Int) (v_ArrVal_3255 (Array Int Int)) (v_ArrVal_3247 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| Int) (v_ArrVal_3248 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3244 Int) (v_ArrVal_3242 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_329| Int) (v_ArrVal_3251 Int)) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3241))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_329| 4) |c_~#queue~0.offset|) v_ArrVal_3242) .cse8 v_ArrVal_3244)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_3247)) |c_~#stored_elements~0.base| v_ArrVal_3248))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| 4)) v_ArrVal_3249) .cse8 v_ArrVal_3251))) (let ((.cse3 (select .cse7 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_329|) (< (+ 1 (select .cse2 .cse1)) v_ArrVal_3247) (= .cse3 20) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327|) (not (= (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3257)) .cse1) 20))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1)) is different from false [2021-11-25 20:24:51,891 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3249 Int) (v_ArrVal_3255 (Array Int Int)) (v_ArrVal_3247 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| Int) (v_ArrVal_3248 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3244 Int) (v_ArrVal_3242 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_329| Int) (v_ArrVal_3251 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_329| 4) |c_~#queue~0.offset|) v_ArrVal_3242) .cse8 v_ArrVal_3244)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 v_ArrVal_3247)) |c_~#stored_elements~0.base| v_ArrVal_3248))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| 4)) v_ArrVal_3249) .cse8 v_ArrVal_3251))) (let ((.cse2 (select .cse6 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327|) (= .cse2 20) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_329|) (not (= 20 (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) v_ArrVal_3257)) .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_3247))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1)) is different from false [2021-11-25 20:24:52,804 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_3249 Int) (v_ArrVal_3255 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| Int) (v_ArrVal_3248 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3251 Int)) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3248))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| 4)) v_ArrVal_3249) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3251)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327|) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse2) 4)) v_ArrVal_3257)) .cse2) 20)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 2) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:24:53,472 WARN L838 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 2) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_3249 Int) (v_ArrVal_3255 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| Int) (v_ArrVal_3257 Int) (v_ArrVal_3251 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| 4)) v_ArrVal_3249) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3251)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select .cse2 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_3255) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3257)) .cse1) 20)) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327|) (= .cse3 20)))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:24:54,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:24:54,307 INFO L93 Difference]: Finished difference Result 8622 states and 14854 transitions. [2021-11-25 20:24:54,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-25 20:24:54,308 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.2745098039215685) internal successors, (167), 50 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2021-11-25 20:24:54,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:24:54,329 INFO L225 Difference]: With dead ends: 8622 [2021-11-25 20:24:54,329 INFO L226 Difference]: Without dead ends: 8622 [2021-11-25 20:24:54,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 329 SyntacticMatches, 43 SemanticMatches, 81 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 2271 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=900, Invalid=2826, Unknown=22, NotChecked=3058, Total=6806 [2021-11-25 20:24:54,332 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 729 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 4668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3157 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:24:54,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [729 Valid, 150 Invalid, 4668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1456 Invalid, 0 Unknown, 3157 Unchecked, 0.7s Time] [2021-11-25 20:24:54,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8622 states. [2021-11-25 20:24:54,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8622 to 4217. [2021-11-25 20:24:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4217 states, 4216 states have (on average 1.8991935483870968) internal successors, (8007), 4216 states have internal predecessors, (8007), 0 states have call successors, (0), 0 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-25 20:24:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4217 states to 4217 states and 8007 transitions. [2021-11-25 20:24:54,533 INFO L78 Accepts]: Start accepts. Automaton has 4217 states and 8007 transitions. Word has length 174 [2021-11-25 20:24:54,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:24:54,534 INFO L470 AbstractCegarLoop]: Abstraction has 4217 states and 8007 transitions. [2021-11-25 20:24:54,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.2745098039215685) internal successors, (167), 50 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-25 20:24:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 4217 states and 8007 transitions. [2021-11-25 20:24:54,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-11-25 20:24:54,547 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:24:54,547 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 14, 14, 14, 14, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:24:54,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-25 20:24:54,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-25 20:24:54,760 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-25 20:24:54,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:24:54,761 INFO L85 PathProgramCache]: Analyzing trace with hash 775008031, now seen corresponding path program 6 times [2021-11-25 20:24:54,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:24:54,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185347468] [2021-11-25 20:24:54,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:24:54,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:24:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:24:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 423 proven. 39 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2021-11-25 20:24:55,634 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:24:55,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185347468] [2021-11-25 20:24:55,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185347468] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:24:55,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866374061] [2021-11-25 20:24:55,635 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:24:55,635 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:24:55,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:24:55,640 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:24:55,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-25 20:26:45,420 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:26:45,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:26:45,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 107 conjunts are in the unsatisfiable core [2021-11-25 20:26:45,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:26:45,927 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-25 20:26:45,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:26:45,951 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 16 treesize of output 18 [2021-11-25 20:26:45,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:26:46,006 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-25 20:26:46,007 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-25 20:26:46,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:26:46,060 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 23 treesize of output 22 [2021-11-25 20:26:46,139 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-11-25 20:26:46,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:26:46,175 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 16 treesize of output 18 [2021-11-25 20:26:46,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:26:46,249 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-25 20:26:46,249 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-25 20:26:46,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:26:46,308 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 23 treesize of output 22 [2021-11-25 20:26:46,391 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-11-25 20:26:46,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:26:46,427 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 16 treesize of output 18 [2021-11-25 20:26:46,490 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:26:46,497 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-25 20:26:46,497 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-25 20:26:46,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:26:46,545 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 23 treesize of output 22 [2021-11-25 20:26:46,606 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-11-25 20:26:46,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:26:46,637 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 16 treesize of output 18 [2021-11-25 20:26:46,698 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:26:46,707 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-25 20:26:46,707 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-25 20:26:46,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:26:46,743 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 23 treesize of output 22 [2021-11-25 20:26:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 753 proven. 99 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2021-11-25 20:26:46,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:26:57,047 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| Int) (v_ArrVal_3679 Int) (v_ArrVal_3677 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3677) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_3679) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378|)))) is different from false [2021-11-25 20:26:57,060 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| Int) (v_ArrVal_3679 Int) (v_ArrVal_3677 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_3677) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_3679) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378|)))) is different from false [2021-11-25 20:26:57,073 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| Int) (v_ArrVal_3679 Int) (v_ArrVal_3677 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3677) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_3679) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378|)))) is different from false [2021-11-25 20:26:57,107 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| Int) (v_ArrVal_3679 Int) (v_ArrVal_3677 (Array Int Int)) (v_ArrVal_3673 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3673)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3677) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_3679) .cse1) 20))))) is different from false [2021-11-25 20:26:57,139 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| Int) (v_ArrVal_3679 Int) (v_ArrVal_3677 (Array Int Int)) (v_ArrVal_3672 Int) (v_ArrVal_3673 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_3672) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3673)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse2 .cse3 (+ 1 (select .cse2 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_3677) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_3679) .cse1) 20))))) is different from false [2021-11-25 20:26:57,165 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| Int) (v_ArrVal_3679 Int) (v_ArrVal_3677 (Array Int Int)) (v_ArrVal_3672 Int) (v_ArrVal_3673 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| 4) |c_~#queue~0.offset|) v_ArrVal_3672) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3673))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3677) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378|) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_3679) .cse1) 20)))))) is different from false [2021-11-25 20:26:57,193 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3670 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| Int) (v_ArrVal_3679 Int) (v_ArrVal_3677 (Array Int Int)) (v_ArrVal_3672 Int) (v_ArrVal_3673 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3670))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| 4) |c_~#queue~0.offset|) v_ArrVal_3672) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3673))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3677) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380|) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_3679) .cse1)))))))) is different from false [2021-11-25 20:26:57,274 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3670 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| Int) (v_ArrVal_3679 Int) (v_ArrVal_3677 (Array Int Int)) (v_ArrVal_3672 Int) (v_ArrVal_3673 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_3670))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| 4) |c_~#queue~0.offset|) v_ArrVal_3672) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3673))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3677) |c_~#queue~0.base|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_3679) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380|)))))) is different from false [2021-11-25 20:26:57,308 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3670 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| Int) (v_ArrVal_3679 Int) (v_ArrVal_3677 (Array Int Int)) (v_ArrVal_3672 Int) (v_ArrVal_3673 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3670))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| 4) |c_~#queue~0.offset|) v_ArrVal_3672) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3673))) (store .cse4 .cse1 (+ 1 (select .cse4 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_3677) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378|) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_3679) .cse1) 20))))))) is different from false [2021-11-25 20:26:57,372 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3667 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| Int) (v_ArrVal_3679 Int) (v_ArrVal_3677 (Array Int Int)) (v_ArrVal_3672 Int) (v_ArrVal_3673 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3667)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3670))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| 4) |c_~#queue~0.offset|) v_ArrVal_3672) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3673))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3677) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_3679) .cse1) 20))))))) is different from false [2021-11-25 20:26:57,454 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3667 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| Int) (v_ArrVal_3679 Int) (v_ArrVal_3665 Int) (v_ArrVal_3677 (Array Int Int)) (v_ArrVal_3672 Int) (v_ArrVal_3673 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_3665) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3667)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3670))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| 4) |c_~#queue~0.offset|) v_ArrVal_3672) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3673))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3677) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_3679) .cse1) 20)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380|) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378|)))))) is different from false [2021-11-25 20:26:57,512 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3667 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| Int) (v_ArrVal_3679 Int) (v_ArrVal_3665 Int) (v_ArrVal_3677 (Array Int Int)) (v_ArrVal_3672 Int) (v_ArrVal_3673 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382| 4)) v_ArrVal_3665) .cse6 v_ArrVal_3667))) (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3670))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| 4) |c_~#queue~0.offset|) v_ArrVal_3672) .cse6 v_ArrVal_3673))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3677) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378|) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_3679) .cse1) 20)) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380|))))))) is different from false [2021-11-25 20:26:57,594 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3667 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| Int) (v_ArrVal_3679 Int) (v_ArrVal_3663 (Array Int Int)) (v_ArrVal_3665 Int) (v_ArrVal_3677 (Array Int Int)) (v_ArrVal_3672 Int) (v_ArrVal_3673 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3663))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382| 4)) v_ArrVal_3665) .cse6 v_ArrVal_3667))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3670))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| 4) |c_~#queue~0.offset|) v_ArrVal_3672) .cse6 v_ArrVal_3673))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3677) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382|) (not (= (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_3679) .cse1) 20)) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378|)))))))) is different from false [2021-11-25 20:26:57,698 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3667 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| Int) (v_ArrVal_3679 Int) (v_ArrVal_3663 (Array Int Int)) (v_ArrVal_3665 Int) (v_ArrVal_3677 (Array Int Int)) (v_ArrVal_3672 Int) (v_ArrVal_3673 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_3663))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382| 4)) v_ArrVal_3665) .cse6 v_ArrVal_3667))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3670))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| 4) |c_~#queue~0.offset|) v_ArrVal_3672) .cse6 v_ArrVal_3673))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3677) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378|) (not (= (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_3679) .cse1) 20))))))))) is different from false [2021-11-25 20:26:57,784 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3667 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| Int) (v_ArrVal_3679 Int) (v_ArrVal_3663 (Array Int Int)) (v_ArrVal_3665 Int) (v_ArrVal_3677 (Array Int Int)) (v_ArrVal_3672 Int) (v_ArrVal_3673 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3663))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382| 4)) v_ArrVal_3665) .cse6 v_ArrVal_3667))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3670))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| 4) |c_~#queue~0.offset|) v_ArrVal_3672) .cse6 v_ArrVal_3673))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3677) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_3679) .cse1) 20)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382|)))))))) is different from false [2021-11-25 20:26:57,985 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3667 Int) (v_ArrVal_3679 Int) (v_ArrVal_3665 Int) (v_ArrVal_3672 Int) (v_ArrVal_3673 Int) (v_ArrVal_3660 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| Int) (v_ArrVal_3670 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| Int) (v_ArrVal_3663 (Array Int Int)) (v_ArrVal_3677 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3660)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3663))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382| 4)) v_ArrVal_3665) .cse6 v_ArrVal_3667))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3670))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| 4) |c_~#queue~0.offset|) v_ArrVal_3672) .cse6 v_ArrVal_3673))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3677) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_3679) .cse1) 20)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380|) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378|)))))))) is different from false [2021-11-25 20:26:58,241 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3658 Int) (v_ArrVal_3667 Int) (v_ArrVal_3679 Int) (v_ArrVal_3665 Int) (v_ArrVal_3672 Int) (v_ArrVal_3673 Int) (v_ArrVal_3660 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| Int) (v_ArrVal_3670 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| Int) (v_ArrVal_3663 (Array Int Int)) (v_ArrVal_3677 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_3658) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3660)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3663))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382| 4)) v_ArrVal_3665) .cse6 v_ArrVal_3667))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3670))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| 4) |c_~#queue~0.offset|) v_ArrVal_3672) .cse6 v_ArrVal_3673))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3677) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_3679) .cse1) 20)) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380|)))))))) is different from false [2021-11-25 20:26:58,450 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3658 Int) (v_ArrVal_3667 Int) (v_ArrVal_3679 Int) (v_ArrVal_3665 Int) (v_ArrVal_3672 Int) (v_ArrVal_3673 Int) (v_ArrVal_3660 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| Int) (v_ArrVal_3670 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_384| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| Int) (v_ArrVal_3663 (Array Int Int)) (v_ArrVal_3677 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_384| 4) |c_~#queue~0.offset|) v_ArrVal_3658) .cse7 v_ArrVal_3660))) (store .cse10 .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3663))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382| 4)) v_ArrVal_3665) .cse7 v_ArrVal_3667))) (store .cse9 .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3670))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| 4) |c_~#queue~0.offset|) v_ArrVal_3672) .cse7 v_ArrVal_3673))) (store .cse6 .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3677) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382|) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_3679) .cse1) 20)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_384|))))))))) is different from false [2021-11-25 20:26:58,600 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3658 Int) (v_ArrVal_3667 Int) (v_ArrVal_3679 Int) (v_ArrVal_3665 Int) (v_ArrVal_3672 Int) (v_ArrVal_3673 Int) (v_ArrVal_3660 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| Int) (v_ArrVal_3670 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_384| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| Int) (v_ArrVal_3663 (Array Int Int)) (v_ArrVal_3677 (Array Int Int)) (v_ArrVal_3656 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3656))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select .cse10 |c_~#queue~0.base|)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_384| 4) |c_~#queue~0.offset|) v_ArrVal_3658) .cse7 v_ArrVal_3660))) (store .cse11 .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3663))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382| 4)) v_ArrVal_3665) .cse7 v_ArrVal_3667))) (store .cse9 .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3670))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380| 4) |c_~#queue~0.offset|) v_ArrVal_3672) .cse7 v_ArrVal_3673))) (store .cse6 .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3677) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_382|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378|) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_3679) .cse1) 20)) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_384|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_380|)))))))))) is different from false [2021-11-25 20:26:58,629 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:26:58,629 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 2320 treesize of output 1660 [2021-11-25 20:26:58,654 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:26:58,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2285 treesize of output 2259 [2021-11-25 20:26:58,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:26:58,679 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 1714 treesize of output 1694 [2021-11-25 20:26:58,699 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 1985 treesize of output 1921 [2021-11-25 20:26:58,715 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:26:58,720 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 2395 treesize of output 2347 [2021-11-25 20:26:58,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:26:58,754 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 2483 treesize of output 2451 [2021-11-25 20:27:23,326 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-25 20:27:23,396 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:27:23,397 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 33998 treesize of output 33946 [2021-11-25 20:27:23,489 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-25 20:27:23,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1623719070] [2021-11-25 20:27:23,490 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:27:23,491 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-25 20:27:23,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-11-25 20:27:23,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308534317] [2021-11-25 20:27:23,492 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-25 20:27:23,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 20:27:23,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:27:23,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 20:27:23,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1268, Unknown=29, NotChecked=1748, Total=3306 [2021-11-25 20:27:23,494 INFO L87 Difference]: Start difference. First operand 4217 states and 8007 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:27:25,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:27:25,244 INFO L93 Difference]: Finished difference Result 4188 states and 7917 transitions. [2021-11-25 20:27:25,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 20:27:25,245 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2021-11-25 20:27:25,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:27:25,255 INFO L225 Difference]: With dead ends: 4188 [2021-11-25 20:27:25,255 INFO L226 Difference]: Without dead ends: 4188 [2021-11-25 20:27:25,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=434, Invalid=2061, Unknown=31, NotChecked=2166, Total=4692 [2021-11-25 20:27:25,258 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 85 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:27:25,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 19 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:27:25,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2021-11-25 20:27:25,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 4149. [2021-11-25 20:27:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4149 states, 4148 states have (on average 1.892960462873674) internal successors, (7852), 4148 states have internal predecessors, (7852), 0 states have call successors, (0), 0 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-25 20:27:25,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4149 states to 4149 states and 7852 transitions. [2021-11-25 20:27:25,341 INFO L78 Accepts]: Start accepts. Automaton has 4149 states and 7852 transitions. Word has length 174 [2021-11-25 20:27:25,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:27:25,342 INFO L470 AbstractCegarLoop]: Abstraction has 4149 states and 7852 transitions. [2021-11-25 20:27:25,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:27:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 4149 states and 7852 transitions. [2021-11-25 20:27:25,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-25 20:27:25,354 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:27:25,354 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 15, 15, 15, 15, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:27:25,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-25 20:27:25,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-25 20:27:25,568 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-25 20:27:25,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:27:25,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1636260676, now seen corresponding path program 7 times [2021-11-25 20:27:25,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:27:25,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448915534] [2021-11-25 20:27:25,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:27:25,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:27:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 673 proven. 72 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2021-11-25 20:27:26,418 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:27:26,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448915534] [2021-11-25 20:27:26,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448915534] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:27:26,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390138915] [2021-11-25 20:27:26,418 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:27:26,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:27:26,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:27:26,419 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:27:26,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-25 20:27:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:26,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 112 conjunts are in the unsatisfiable core [2021-11-25 20:27:26,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:27:27,040 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-25 20:27:27,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:27:27,070 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 16 treesize of output 18 [2021-11-25 20:27:27,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:27:27,145 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-25 20:27:27,146 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-25 20:27:27,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:27:27,195 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 23 treesize of output 22 [2021-11-25 20:27:27,270 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-11-25 20:27:27,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:27:27,302 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 16 treesize of output 18 [2021-11-25 20:27:27,351 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:27:27,357 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-25 20:27:27,358 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 2 case distinctions, treesize of input 31 treesize of output 27 [2021-11-25 20:27:27,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:27:27,407 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 23 treesize of output 22 [2021-11-25 20:27:27,495 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-11-25 20:27:27,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:27:27,527 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 16 treesize of output 18 [2021-11-25 20:27:27,581 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:27:27,587 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-25 20:27:27,588 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 2 case distinctions, treesize of input 31 treesize of output 27 [2021-11-25 20:27:27,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:27:27,633 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 23 treesize of output 22 [2021-11-25 20:27:27,702 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-11-25 20:27:27,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:27:27,728 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 16 treesize of output 18 [2021-11-25 20:27:27,790 INFO L354 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2021-11-25 20:27:27,790 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-25 20:27:27,822 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-25 20:27:27,823 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 23 treesize of output 22 [2021-11-25 20:27:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 691 proven. 54 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2021-11-25 20:27:27,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:27:28,219 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4100 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_4100)) .cse1)) 20))) is different from false [2021-11-25 20:27:28,225 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4100 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4100)) .cse1)) 20))) is different from false [2021-11-25 20:27:28,231 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4100 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4100)) .cse1)) 20))) is different from false [2021-11-25 20:27:28,239 WARN L838 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84)) 20) (forall ((v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4100 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4100)) .cse1)) 20)))) is different from false [2021-11-25 20:27:28,260 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4096 Int) (v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4100 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4096)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4100)) .cse1)))) (= .cse4 20))))) is different from false [2021-11-25 20:27:28,287 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4096 Int) (v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4094 Int) (v_ArrVal_4100 Int)) (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_4094) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4096)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4100)) .cse1)) 20)) (= .cse4 20))))) is different from false [2021-11-25 20:27:28,300 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4096 Int) (v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4094 Int) (v_ArrVal_4100 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (store (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4094)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4096))) (let ((.cse0 (select .cse3 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse3 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_4100)) .cse2) 20))))))) is different from false [2021-11-25 20:27:28,314 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4096 Int) (v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4094 Int) (v_ArrVal_4092 (Array Int Int)) (v_ArrVal_4100 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4092))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4094)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4096))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4100)) .cse1) 20)) (= 20 .cse4)))))) is different from false [2021-11-25 20:27:28,329 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4096 Int) (v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4094 Int) (v_ArrVal_4092 (Array Int Int)) (v_ArrVal_4100 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_4092))) (let ((.cse4 (store (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4094)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4096))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_4100)) .cse2) 20))))))) is different from false [2021-11-25 20:27:28,345 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4096 Int) (v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4094 Int) (v_ArrVal_4092 (Array Int Int)) (v_ArrVal_4100 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4092))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4094)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4096))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4100)) .cse1) 20)) (= 20 .cse4)))))) is different from false [2021-11-25 20:27:28,364 WARN L838 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84)) 20) (forall ((v_ArrVal_4096 Int) (v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4094 Int) (v_ArrVal_4092 (Array Int Int)) (v_ArrVal_4100 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4092))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4094)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4096))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4100)) .cse1) 20)) (= 20 .cse4))))))) is different from false [2021-11-25 20:27:28,396 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4096 Int) (v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4094 Int) (v_ArrVal_4092 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4100 Int)) (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4088)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse0 (select .cse7 .cse8))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4092))) (let ((.cse5 (store (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4094)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4096))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse0 20) (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4100)) .cse3) 20))))))))) is different from false [2021-11-25 20:27:28,464 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4096 Int) (v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4094 Int) (v_ArrVal_4092 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4100 Int) (v_ArrVal_4086 Int)) (let ((.cse7 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_4086) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4088)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse5 (select .cse7 .cse8))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_4092))) (let ((.cse3 (store (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4094)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4096))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4100)) .cse1))) (= .cse5 20) (= 20 .cse4)))))))) is different from false [2021-11-25 20:27:28,529 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4096 Int) (v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4094 Int) (v_ArrVal_4092 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4100 Int) (v_ArrVal_4086 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse8 (store (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4086)) .cse7 v_ArrVal_4088))) (let ((.cse0 (select .cse8 .cse2))) (let ((.cse3 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4092))) (let ((.cse4 (store (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4094)) .cse7 v_ArrVal_4096))) (let ((.cse5 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_4100)) .cse2) 20)) (= .cse5 20))))))))) is different from false [2021-11-25 20:27:28,562 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4096 Int) (v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4094 Int) (v_ArrVal_4092 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4100 Int) (v_ArrVal_4086 Int) (v_ArrVal_4085 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4085)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4086)) .cse7 v_ArrVal_4088))) (let ((.cse0 (select .cse9 .cse2))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store .cse9 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4092))) (let ((.cse4 (store (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4094)) .cse7 v_ArrVal_4096))) (let ((.cse5 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4100)) .cse2) 20)) (= .cse5 20))))))))) is different from false [2021-11-25 20:27:28,602 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4096 Int) (v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4094 Int) (v_ArrVal_4092 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4100 Int) (v_ArrVal_4086 Int) (v_ArrVal_4085 (Array Int Int))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_4085)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) v_ArrVal_4086)) .cse7 v_ArrVal_4088))) (let ((.cse0 (select .cse9 .cse3))) (let ((.cse4 (store (store .cse8 |c_~#queue~0.base| (store .cse9 .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4092))) (let ((.cse5 (store (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4094)) .cse7 v_ArrVal_4096))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse0 20) (= 20 .cse1) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4100)) .cse3) 20)))))))))) is different from false [2021-11-25 20:27:28,639 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4096 Int) (v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4094 Int) (v_ArrVal_4092 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4100 Int) (v_ArrVal_4086 Int) (v_ArrVal_4085 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4085)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4086)) .cse7 v_ArrVal_4088))) (let ((.cse5 (select .cse9 .cse1))) (let ((.cse2 (store (store .cse8 |c_~#queue~0.base| (store .cse9 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_4092))) (let ((.cse3 (store (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4094)) .cse7 v_ArrVal_4096))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4100)) .cse1))) (= 20 .cse4) (= .cse5 20))))))))) is different from false [2021-11-25 20:27:28,676 WARN L838 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84)) 20) (forall ((v_ArrVal_4096 Int) (v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4094 Int) (v_ArrVal_4092 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4100 Int) (v_ArrVal_4086 Int) (v_ArrVal_4085 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4085)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4086)) .cse7 v_ArrVal_4088))) (let ((.cse5 (select .cse9 .cse1))) (let ((.cse2 (store (store .cse8 |c_~#queue~0.base| (store .cse9 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_4092))) (let ((.cse3 (store (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4094)) .cse7 v_ArrVal_4096))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4100)) .cse1))) (= 20 .cse4) (= .cse5 20)))))))))) is different from false [2021-11-25 20:27:28,751 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4096 Int) (v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4094 Int) (v_ArrVal_4081 Int) (v_ArrVal_4092 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4100 Int) (v_ArrVal_4086 Int) (v_ArrVal_4085 (Array Int Int))) (let ((.cse12 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4081)) (.cse13 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse1 (select .cse12 .cse13))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse12 .cse13 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_4085)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse10 (store (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4086)) .cse8 v_ArrVal_4088))) (let ((.cse0 (select .cse10 .cse3))) (let ((.cse4 (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4092))) (let ((.cse5 (store (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) v_ArrVal_4094)) .cse8 v_ArrVal_4096))) (let ((.cse6 (select .cse5 .cse3))) (or (= .cse0 20) (= 20 .cse1) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse3 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4100)) .cse3) 20)) (= 20 .cse6))))))))))) is different from false [2021-11-25 20:27:28,908 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4096 Int) (v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4094 Int) (v_ArrVal_4081 Int) (v_ArrVal_4079 Int) (v_ArrVal_4092 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4100 Int) (v_ArrVal_4086 Int) (v_ArrVal_4085 (Array Int Int))) (let ((.cse12 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_4079) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4081)) (.cse13 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse6 (select .cse12 .cse13))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse12 .cse13 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_4085)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse10 (store (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse3) 4)) v_ArrVal_4086)) .cse8 v_ArrVal_4088))) (let ((.cse0 (select .cse10 .cse3))) (let ((.cse4 (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4092))) (let ((.cse5 (store (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4094)) .cse8 v_ArrVal_4096))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse0 20) (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4100)) .cse3) 20)) (= .cse6 20))))))))))) is different from false [2021-11-25 20:27:29,064 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4096 Int) (v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4094 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_422| Int) (v_ArrVal_4081 Int) (v_ArrVal_4079 Int) (v_ArrVal_4092 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4100 Int) (v_ArrVal_4086 Int) (v_ArrVal_4085 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse9 (+ 88 |c_~#queue~0.offset|))) (let ((.cse13 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_422| 4)) v_ArrVal_4079) .cse9 v_ArrVal_4081)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse13 .cse1))) (let ((.cse10 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse13 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_4085))) (let ((.cse11 (store (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4086)) .cse9 v_ArrVal_4088))) (let ((.cse3 (select .cse11 .cse1))) (let ((.cse6 (store (store .cse10 |c_~#queue~0.base| (store .cse11 .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_4092))) (let ((.cse7 (store (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) v_ArrVal_4094)) .cse9 v_ArrVal_4096))) (let ((.cse4 (select .cse7 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_422|) (= .cse2 20) (= .cse3 20) (= 20 .cse4) (not (= 20 (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4100)) .cse1)))))))))))))) is different from false [2021-11-25 20:27:29,234 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4079 Int) (v_ArrVal_4092 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4100 Int) (v_ArrVal_4086 Int) (v_ArrVal_4085 (Array Int Int)) (v_ArrVal_4096 Int) (v_ArrVal_4099 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4094 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_422| Int) (v_ArrVal_4081 Int)) (let ((.cse13 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4078))) (let ((.cse7 (select .cse13 |c_~#queue~0.base|)) (.cse9 (+ 88 |c_~#queue~0.offset|))) (let ((.cse14 (store (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_422| 4)) v_ArrVal_4079) .cse9 v_ArrVal_4081)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse14 .cse1))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store .cse14 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_4085))) (let ((.cse11 (store (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse1) 4)) v_ArrVal_4086)) .cse9 v_ArrVal_4088))) (let ((.cse6 (select .cse11 .cse1))) (let ((.cse2 (store (store .cse10 |c_~#queue~0.base| (store .cse11 .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_4092))) (let ((.cse3 (store (let ((.cse8 (select .cse2 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4094)) .cse9 v_ArrVal_4096))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4099) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4100)) .cse1))) (= .cse5 20) (= 20 .cse6) (= .cse4 20) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_422|))))))))))))) is different from false [2021-11-25 20:27:29,257 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:27:29,257 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 6140 treesize of output 4270 [2021-11-25 20:27:29,281 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:27:29,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3678 treesize of output 3602 [2021-11-25 20:27:29,298 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 2702 treesize of output 2606 [2021-11-25 20:27:29,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:27:29,316 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 3615 treesize of output 3451 [2021-11-25 20:27:29,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:27:29,412 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 3166 treesize of output 3038 [2021-11-25 20:27:29,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:27:29,444 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 3418 treesize of output 3234 [2021-11-25 20:27:44,613 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 15569 treesize of output 15245 [2021-11-25 20:27:44,652 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-25 20:27:44,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1399933613] [2021-11-25 20:27:44,653 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:27:44,653 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-25 20:27:44,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2021-11-25 20:27:44,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169300084] [2021-11-25 20:27:44,654 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-25 20:27:44,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 20:27:44,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:27:44,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 20:27:44,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1359, Unknown=22, NotChecked=2178, Total=3906 [2021-11-25 20:27:44,656 INFO L87 Difference]: Start difference. First operand 4149 states and 7852 transitions. Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:27:45,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:27:45,488 INFO L93 Difference]: Finished difference Result 6653 states and 12108 transitions. [2021-11-25 20:27:45,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-25 20:27:45,489 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2021-11-25 20:27:45,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:27:45,505 INFO L225 Difference]: With dead ends: 6653 [2021-11-25 20:27:45,506 INFO L226 Difference]: Without dead ends: 6653 [2021-11-25 20:27:45,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=573, Invalid=2355, Unknown=22, NotChecked=2750, Total=5700 [2021-11-25 20:27:45,508 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 341 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:27:45,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 32 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 20:27:45,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6653 states. [2021-11-25 20:27:45,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6653 to 2796. [2021-11-25 20:27:45,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2796 states, 2795 states have (on average 1.784257602862254) internal successors, (4987), 2795 states have internal predecessors, (4987), 0 states have call successors, (0), 0 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-25 20:27:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 4987 transitions. [2021-11-25 20:27:45,588 INFO L78 Accepts]: Start accepts. Automaton has 2796 states and 4987 transitions. Word has length 175 [2021-11-25 20:27:45,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:27:45,589 INFO L470 AbstractCegarLoop]: Abstraction has 2796 states and 4987 transitions. [2021-11-25 20:27:45,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:27:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 4987 transitions. [2021-11-25 20:27:45,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-11-25 20:27:45,596 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:27:45,597 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 16, 16, 16, 16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:27:45,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-11-25 20:27:45,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-25 20:27:45,812 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-25 20:27:45,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:27:45,813 INFO L85 PathProgramCache]: Analyzing trace with hash 749709391, now seen corresponding path program 8 times [2021-11-25 20:27:45,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:27:45,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236427813] [2021-11-25 20:27:45,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:27:45,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:27:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:47,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 777 proven. 72 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2021-11-25 20:27:47,500 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:27:47,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236427813] [2021-11-25 20:27:47,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236427813] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:27:47,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240834217] [2021-11-25 20:27:47,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:27:47,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:27:47,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:27:47,510 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:27:47,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-25 20:28:25,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-11-25 20:28:25,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:28:25,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 168 conjunts are in the unsatisfiable core [2021-11-25 20:28:25,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:28:25,874 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-25 20:28:25,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:25,899 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 16 treesize of output 18 [2021-11-25 20:28:25,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:28:25,958 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-25 20:28:25,958 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 2 case distinctions, treesize of input 31 treesize of output 27 [2021-11-25 20:28:26,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:26,008 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 23 treesize of output 22 [2021-11-25 20:28:26,077 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-11-25 20:28:26,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:26,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 16 treesize of output 18 [2021-11-25 20:28:26,151 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:28:26,159 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-25 20:28:26,159 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 2 case distinctions, treesize of input 31 treesize of output 27 [2021-11-25 20:28:26,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:26,215 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 23 treesize of output 22 [2021-11-25 20:28:26,279 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 0 case distinctions, treesize of input 34 treesize of output 18 [2021-11-25 20:28:26,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:26,312 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 16 treesize of output 18 [2021-11-25 20:28:26,368 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:28:26,375 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-25 20:28:26,375 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 2 case distinctions, treesize of input 31 treesize of output 27 [2021-11-25 20:28:26,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:26,425 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 23 treesize of output 22 [2021-11-25 20:28:26,496 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-11-25 20:28:26,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:26,520 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 16 treesize of output 18 [2021-11-25 20:28:26,581 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:28:26,588 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-25 20:28:26,588 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 2 case distinctions, treesize of input 31 treesize of output 27 [2021-11-25 20:28:26,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:26,674 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 23 treesize of output 22 [2021-11-25 20:28:26,739 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-11-25 20:28:26,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:26,764 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 16 treesize of output 18 [2021-11-25 20:28:26,816 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:28:26,823 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-25 20:28:26,823 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 2 case distinctions, treesize of input 31 treesize of output 27 [2021-11-25 20:28:26,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:26,870 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 23 treesize of output 22 [2021-11-25 20:28:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 785 proven. 68 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2021-11-25 20:28:26,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:28:27,084 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4530 Int) (v_ArrVal_4528 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4530)) .cse1)) 20))) is different from false [2021-11-25 20:28:27,090 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4530 Int) (v_ArrVal_4528 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4530)) .cse1))))) is different from false [2021-11-25 20:28:27,097 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4530 Int) (v_ArrVal_4528 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4530)) .cse1)) 20))) is different from false [2021-11-25 20:28:27,105 WARN L838 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84)) 20) (forall ((v_ArrVal_4530 Int) (v_ArrVal_4528 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4530)) .cse1)) 20)))) is different from false [2021-11-25 20:28:27,118 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4525 Int) (v_ArrVal_4530 Int) (v_ArrVal_4528 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4525)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4530)) .cse2)) 20)))))) is different from false [2021-11-25 20:28:27,142 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4525 Int) (v_ArrVal_4522 Int) (v_ArrVal_4530 Int) (v_ArrVal_4528 (Array Int Int))) (let ((.cse3 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_4522) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4525)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_4530)) .cse2)) 20)))))) is different from false [2021-11-25 20:28:27,156 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4525 Int) (v_ArrVal_4522 Int) (v_ArrVal_4530 Int) (v_ArrVal_4528 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (store (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4522)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4525))) (let ((.cse0 (select .cse3 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse3 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4530)) .cse2) 20))))))) is different from false [2021-11-25 20:28:27,170 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4525 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4522 Int) (v_ArrVal_4530 Int) (v_ArrVal_4528 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse4 (store (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4522)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4525))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_4530)) .cse2)))))))) is different from false [2021-11-25 20:28:27,185 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4525 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4522 Int) (v_ArrVal_4530 Int) (v_ArrVal_4528 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4522)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4525))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4530)) .cse1))) (= .cse4 20)))))) is different from false [2021-11-25 20:28:27,201 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4525 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4522 Int) (v_ArrVal_4530 Int) (v_ArrVal_4528 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse4 (store (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4522)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4525))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_4530)) .cse2) 20))))))) is different from false [2021-11-25 20:28:27,230 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4518 Int) (v_ArrVal_4525 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4522 Int) (v_ArrVal_4530 Int) (v_ArrVal_4528 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4518)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse4 (store (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4522)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4525))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4530)) .cse2) 20))))))) is different from false [2021-11-25 20:28:27,264 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4518 Int) (v_ArrVal_4516 Int) (v_ArrVal_4525 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4522 Int) (v_ArrVal_4530 Int) (v_ArrVal_4528 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_4516) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4518)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse4 (store (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4522)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4525))) (let ((.cse0 (select .cse4 .cse2))) (or (= 20 .cse0) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4530)) .cse2) 20))))))) is different from false [2021-11-25 20:28:27,282 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4518 Int) (v_ArrVal_4516 Int) (v_ArrVal_4525 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4522 Int) (v_ArrVal_4530 Int) (v_ArrVal_4528 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4516)) .cse6 v_ArrVal_4518))) (store .cse7 .cse2 (+ (select .cse7 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse4 (store (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4522)) .cse6 v_ArrVal_4525))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_4530)) .cse2) 20)))))))) is different from false [2021-11-25 20:28:27,301 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4518 Int) (v_ArrVal_4516 Int) (v_ArrVal_4525 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4522 Int) (v_ArrVal_4514 (Array Int Int)) (v_ArrVal_4530 Int) (v_ArrVal_4528 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (store (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4514))) (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4516)) .cse6 v_ArrVal_4518))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4522)) .cse6 v_ArrVal_4525))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_4530)) .cse1))) (= .cse4 20))))))) is different from false [2021-11-25 20:28:27,339 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4518 Int) (v_ArrVal_4516 Int) (v_ArrVal_4525 Int) (v_ArrVal_4512 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4522 Int) (v_ArrVal_4514 (Array Int Int)) (v_ArrVal_4530 Int) (v_ArrVal_4528 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (store (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) v_ArrVal_4512)) |c_~#stored_elements~0.base| v_ArrVal_4514))) (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4516)) .cse6 v_ArrVal_4518))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4522)) .cse6 v_ArrVal_4525))) (let ((.cse4 (select .cse3 .cse1))) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_4512) (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_4530)) .cse1) 20)) (= 20 .cse4))))))) is different from false [2021-11-25 20:28:27,374 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4518 Int) (v_ArrVal_4516 Int) (v_ArrVal_4525 Int) (v_ArrVal_4512 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4522 Int) (v_ArrVal_4514 (Array Int Int)) (v_ArrVal_4530 Int) (v_ArrVal_4528 (Array Int Int))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse4 (store (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_4512)) |c_~#stored_elements~0.base| v_ArrVal_4514))) (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4516)) .cse8 v_ArrVal_4518))) (store .cse10 .cse3 (+ (select .cse10 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse5 (store (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4522)) .cse8 v_ArrVal_4525))) (let ((.cse6 (select .cse5 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_4512) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse3 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_4530)) .cse3) 20)) (= 20 .cse6))))))) is different from false [2021-11-25 20:28:27,448 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4518 Int) (v_ArrVal_4516 Int) (v_ArrVal_4525 Int) (v_ArrVal_4512 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4511 Int) (v_ArrVal_4522 Int) (v_ArrVal_4514 (Array Int Int)) (v_ArrVal_4530 Int) (v_ArrVal_4528 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4511)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse2 (store (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_4512)) |c_~#stored_elements~0.base| v_ArrVal_4514))) (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4516)) .cse8 v_ArrVal_4518))) (store .cse10 .cse1 (+ (select .cse10 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse3 (store (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) v_ArrVal_4522)) .cse8 v_ArrVal_4525))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4530)) .cse1) 20)) (= .cse4 20) (< (+ (select .cse5 .cse6) 1) v_ArrVal_4512))))))) is different from false [2021-11-25 20:28:27,533 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4518 Int) (v_ArrVal_4516 Int) (v_ArrVal_4525 Int) (v_ArrVal_4512 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4511 Int) (v_ArrVal_4522 Int) (v_ArrVal_4514 (Array Int Int)) (v_ArrVal_4530 Int) (v_ArrVal_4528 (Array Int Int)) (v_ArrVal_4509 Int)) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_4509) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4511)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse5 (store (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_4512)) |c_~#stored_elements~0.base| v_ArrVal_4514))) (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_4516)) .cse8 v_ArrVal_4518))) (store .cse10 .cse4 (+ (select .cse10 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse6 (store (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse4) 4)) v_ArrVal_4522)) .cse8 v_ArrVal_4525))) (let ((.cse2 (select .cse6 .cse4))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_4512) (= .cse2 20) (not (= 20 (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_4530)) .cse4))))))))) is different from false [2021-11-25 20:28:27,585 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4518 Int) (v_ArrVal_4516 Int) (v_ArrVal_4525 Int) (v_ArrVal_4512 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4511 Int) (v_ArrVal_4522 Int) (v_ArrVal_4514 (Array Int Int)) (v_ArrVal_4530 Int) (v_ArrVal_4528 (Array Int Int)) (v_ArrVal_4509 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (store (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4509)) .cse7 v_ArrVal_4511))) (let ((.cse4 (store (let ((.cse8 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_4512)) |c_~#stored_elements~0.base| v_ArrVal_4514))) (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4516)) .cse7 v_ArrVal_4518))) (store .cse9 .cse1 (+ (select .cse9 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse5 (store (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4522)) .cse7 v_ArrVal_4525))) (let ((.cse2 (select .cse5 .cse1))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_4512) (= 20 .cse2) (not (= 20 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_4530)) .cse1)))))))))) is different from false [2021-11-25 20:28:27,624 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4518 Int) (v_ArrVal_4516 Int) (v_ArrVal_4525 Int) (v_ArrVal_4512 Int) (v_ArrVal_4511 Int) (v_ArrVal_4522 Int) (v_ArrVal_4530 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4514 (Array Int Int)) (v_ArrVal_4528 (Array Int Int)) (v_ArrVal_4507 (Array Int Int)) (v_ArrVal_4509 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse11 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4507)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (store (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4509)) .cse7 v_ArrVal_4511))) (let ((.cse2 (store (let ((.cse8 (store (store .cse11 |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_4512)) |c_~#stored_elements~0.base| v_ArrVal_4514))) (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4516)) .cse7 v_ArrVal_4518))) (store .cse9 .cse1 (+ (select .cse9 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse3 (store (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4522)) .cse7 v_ArrVal_4525))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4530)) .cse1) 20)) (= 20 .cse4) (< (+ (select .cse5 .cse1) 1) v_ArrVal_4512)))))))) is different from false [2021-11-25 20:28:27,667 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4518 Int) (v_ArrVal_4516 Int) (v_ArrVal_4525 Int) (v_ArrVal_4512 Int) (v_ArrVal_4511 Int) (v_ArrVal_4522 Int) (v_ArrVal_4530 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4514 (Array Int Int)) (v_ArrVal_4528 (Array Int Int)) (v_ArrVal_4507 (Array Int Int)) (v_ArrVal_4509 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_4507)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (store (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4509)) .cse7 v_ArrVal_4511))) (let ((.cse2 (store (let ((.cse8 (store (store .cse11 |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_4512)) |c_~#stored_elements~0.base| v_ArrVal_4514))) (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4516)) .cse7 v_ArrVal_4518))) (store .cse9 .cse1 (+ (select .cse9 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse3 (store (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4522)) .cse7 v_ArrVal_4525))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4530)) .cse1) 20)) (< (+ (select .cse5 .cse1) 1) v_ArrVal_4512) (= .cse4 20)))))))) is different from false [2021-11-25 20:28:27,711 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4518 Int) (v_ArrVal_4516 Int) (v_ArrVal_4525 Int) (v_ArrVal_4512 Int) (v_ArrVal_4511 Int) (v_ArrVal_4522 Int) (v_ArrVal_4530 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4514 (Array Int Int)) (v_ArrVal_4528 (Array Int Int)) (v_ArrVal_4507 (Array Int Int)) (v_ArrVal_4509 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse13 .cse14 (+ (select .cse13 .cse14) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4507)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (store (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4509)) .cse7 v_ArrVal_4511))) (let ((.cse4 (store (let ((.cse8 (store (store .cse11 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_4512)) |c_~#stored_elements~0.base| v_ArrVal_4514))) (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4516)) .cse7 v_ArrVal_4518))) (store .cse9 .cse1 (+ (select .cse9 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse5 (store (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4522)) .cse7 v_ArrVal_4525))) (let ((.cse2 (select .cse5 .cse1))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_4512) (= .cse2 20) (not (= 20 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4530)) .cse1)))))))))) is different from false [2021-11-25 20:28:27,758 WARN L838 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84)) 20) (forall ((v_ArrVal_4518 Int) (v_ArrVal_4516 Int) (v_ArrVal_4525 Int) (v_ArrVal_4512 Int) (v_ArrVal_4511 Int) (v_ArrVal_4522 Int) (v_ArrVal_4530 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4514 (Array Int Int)) (v_ArrVal_4528 (Array Int Int)) (v_ArrVal_4507 (Array Int Int)) (v_ArrVal_4509 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse13 .cse14 (+ (select .cse13 .cse14) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4507)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (store (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4509)) .cse7 v_ArrVal_4511))) (let ((.cse4 (store (let ((.cse8 (store (store .cse11 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_4512)) |c_~#stored_elements~0.base| v_ArrVal_4514))) (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4516)) .cse7 v_ArrVal_4518))) (store .cse9 .cse1 (+ (select .cse9 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse5 (store (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4522)) .cse7 v_ArrVal_4525))) (let ((.cse2 (select .cse5 .cse1))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_4512) (= .cse2 20) (not (= 20 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4530)) .cse1))))))))))) is different from false [2021-11-25 20:28:27,845 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4518 Int) (v_ArrVal_4516 Int) (v_ArrVal_4503 Int) (v_ArrVal_4525 Int) (v_ArrVal_4512 Int) (v_ArrVal_4511 Int) (v_ArrVal_4522 Int) (v_ArrVal_4530 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4514 (Array Int Int)) (v_ArrVal_4528 (Array Int Int)) (v_ArrVal_4507 (Array Int Int)) (v_ArrVal_4509 Int)) (let ((.cse14 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4503)) (.cse15 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse0 (select .cse14 .cse15))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse14 .cse15 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4507)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4509)) .cse8 v_ArrVal_4511))) (let ((.cse3 (store (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store .cse6 .cse2 v_ArrVal_4512)) |c_~#stored_elements~0.base| v_ArrVal_4514))) (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4516)) .cse8 v_ArrVal_4518))) (store .cse10 .cse2 (+ (select .cse10 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse4 (store (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4522)) .cse8 v_ArrVal_4525))) (let ((.cse5 (select .cse4 .cse2))) (or (= 20 .cse0) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4530)) .cse2) 20)) (= .cse5 20) (< (+ (select .cse6 .cse2) 1) v_ArrVal_4512)))))))))) is different from false [2021-11-25 20:28:28,048 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4518 Int) (v_ArrVal_4516 Int) (v_ArrVal_4503 Int) (v_ArrVal_4525 Int) (v_ArrVal_4512 Int) (v_ArrVal_4502 Int) (v_ArrVal_4511 Int) (v_ArrVal_4522 Int) (v_ArrVal_4530 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4514 (Array Int Int)) (v_ArrVal_4528 (Array Int Int)) (v_ArrVal_4507 (Array Int Int)) (v_ArrVal_4509 Int)) (let ((.cse14 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_4502) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4503)) (.cse15 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse0 (select .cse14 .cse15))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse14 .cse15 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4507)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse1 (store (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4509)) .cse8 v_ArrVal_4511))) (let ((.cse4 (store (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_4512)) |c_~#stored_elements~0.base| v_ArrVal_4514))) (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4516)) .cse8 v_ArrVal_4518))) (store .cse10 .cse2 (+ (select .cse10 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse5 (store (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4522)) .cse8 v_ArrVal_4525))) (let ((.cse6 (select .cse5 .cse2))) (or (= .cse0 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_4512) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse2) 4)) v_ArrVal_4530)) .cse2) 20)) (= 20 .cse6)))))))))) is different from false [2021-11-25 20:28:28,132 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4518 Int) (v_ArrVal_4516 Int) (v_ArrVal_4503 Int) (v_ArrVal_4525 Int) (v_ArrVal_4512 Int) (v_ArrVal_4502 Int) (v_ArrVal_4511 Int) (v_ArrVal_4522 Int) (v_ArrVal_4530 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4514 (Array Int Int)) (v_ArrVal_4528 (Array Int Int)) (v_ArrVal_4507 (Array Int Int)) (v_ArrVal_4509 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse14 (store (let ((.cse15 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4502)) .cse8 v_ArrVal_4503))) (let ((.cse6 (select .cse14 .cse2))) (let ((.cse12 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse14 .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_4507))) (let ((.cse5 (store (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4509)) .cse8 v_ArrVal_4511))) (let ((.cse3 (store (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store .cse5 .cse2 v_ArrVal_4512)) |c_~#stored_elements~0.base| v_ArrVal_4514))) (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse2) 4)) v_ArrVal_4516)) .cse8 v_ArrVal_4518))) (store .cse10 .cse2 (+ (select .cse10 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse4 (store (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)) v_ArrVal_4522)) .cse8 v_ArrVal_4525))) (let ((.cse0 (select .cse4 .cse2))) (or (= 20 .cse0) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_4530)) .cse2) 20)) (< (+ (select .cse5 .cse2) 1) v_ArrVal_4512) (= .cse6 20))))))))))) is different from false [2021-11-25 20:28:28,221 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4518 Int) (v_ArrVal_4516 Int) (v_ArrVal_4503 Int) (v_ArrVal_4525 Int) (v_ArrVal_4512 Int) (v_ArrVal_4502 Int) (v_ArrVal_4511 Int) (v_ArrVal_4522 Int) (v_ArrVal_4530 Int) (v_ArrVal_4521 (Array Int Int)) (v_ArrVal_4500 (Array Int Int)) (v_ArrVal_4514 (Array Int Int)) (v_ArrVal_4528 (Array Int Int)) (v_ArrVal_4507 (Array Int Int)) (v_ArrVal_4509 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse14 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4500)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse15 (store (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4502)) .cse8 v_ArrVal_4503))) (let ((.cse0 (select .cse15 .cse2))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store .cse15 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4507))) (let ((.cse6 (store (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4509)) .cse8 v_ArrVal_4511))) (let ((.cse3 (store (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store .cse6 .cse2 v_ArrVal_4512)) |c_~#stored_elements~0.base| v_ArrVal_4514))) (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse2) 4)) v_ArrVal_4516)) .cse8 v_ArrVal_4518))) (store .cse10 .cse2 (+ (select .cse10 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_4521))) (let ((.cse4 (store (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4522)) .cse8 v_ArrVal_4525))) (let ((.cse5 (select .cse4 .cse2))) (or (= 20 .cse0) (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_4528) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4530)) .cse2))) (= 20 .cse5) (< (+ (select .cse6 .cse2) 1) v_ArrVal_4512))))))))))) is different from false [2021-11-25 20:28:28,244 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:28:28,244 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24995 treesize of output 15885 [2021-11-25 20:28:28,297 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:28:28,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7045 treesize of output 6891 [2021-11-25 20:28:28,317 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 5378 treesize of output 5186 [2021-11-25 20:28:28,332 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:28:28,339 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 7132 treesize of output 6876 [2021-11-25 20:28:28,354 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:28:28,370 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 5444 treesize of output 5396 [2021-11-25 20:28:28,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:28:28,431 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 6747 treesize of output 6171 [2021-11-25 20:28:28,584 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:28:28,594 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 5007 treesize of output 4983 [2021-11-25 20:28:30,779 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 7 treesize of output 3 [2021-11-25 20:28:30,816 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:28:30,816 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 5318 treesize of output 5102 [2021-11-25 20:28:31,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 188 proven. 189 refuted. 0 times theorem prover too weak. 479 trivial. 486 not checked. [2021-11-25 20:28:31,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240834217] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:28:31,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [899108181] [2021-11-25 20:28:31,418 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:28:31,418 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:28:31,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 36] total 78 [2021-11-25 20:28:31,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634064367] [2021-11-25 20:28:31,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:28:31,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2021-11-25 20:28:31,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:28:31,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2021-11-25 20:28:31,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=2186, Unknown=27, NotChecked=3402, Total=6162 [2021-11-25 20:28:31,423 INFO L87 Difference]: Start difference. First operand 2796 states and 4987 transitions. Second operand has 79 states, 79 states have (on average 2.721518987341772) internal successors, (215), 78 states have internal predecessors, (215), 0 states have call successors, (0), 0 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-25 20:28:34,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:28:34,645 INFO L93 Difference]: Finished difference Result 4285 states and 7609 transitions. [2021-11-25 20:28:34,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-11-25 20:28:34,646 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 2.721518987341772) internal successors, (215), 78 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2021-11-25 20:28:34,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:28:34,656 INFO L225 Difference]: With dead ends: 4285 [2021-11-25 20:28:34,657 INFO L226 Difference]: Without dead ends: 4285 [2021-11-25 20:28:34,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 317 SyntacticMatches, 14 SemanticMatches, 125 ConstructedPredicates, 27 IntricatePredicates, 0 DeprecatedPredicates, 4025 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2070, Invalid=7911, Unknown=27, NotChecked=5994, Total=16002 [2021-11-25 20:28:34,662 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 803 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 6282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4341 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:28:34,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [803 Valid, 74 Invalid, 6282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1702 Invalid, 0 Unknown, 4341 Unchecked, 0.9s Time] [2021-11-25 20:28:34,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4285 states. [2021-11-25 20:28:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4285 to 3239. [2021-11-25 20:28:34,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3239 states, 3238 states have (on average 1.7745521927115504) internal successors, (5746), 3238 states have internal predecessors, (5746), 0 states have call successors, (0), 0 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-25 20:28:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3239 states to 3239 states and 5746 transitions. [2021-11-25 20:28:34,730 INFO L78 Accepts]: Start accepts. Automaton has 3239 states and 5746 transitions. Word has length 176 [2021-11-25 20:28:34,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:28:34,730 INFO L470 AbstractCegarLoop]: Abstraction has 3239 states and 5746 transitions. [2021-11-25 20:28:34,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 2.721518987341772) internal successors, (215), 78 states have internal predecessors, (215), 0 states have call successors, (0), 0 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-25 20:28:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 3239 states and 5746 transitions. [2021-11-25 20:28:34,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-11-25 20:28:34,759 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:28:34,760 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 16, 16, 16, 16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:28:34,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-25 20:28:34,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-25 20:28:34,960 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-25 20:28:34,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:28:34,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1312428867, now seen corresponding path program 9 times [2021-11-25 20:28:34,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:28:34,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809697987] [2021-11-25 20:28:34,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:28:34,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:28:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 591 proven. 105 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2021-11-25 20:28:35,867 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:28:35,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809697987] [2021-11-25 20:28:35,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809697987] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:28:35,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810462528] [2021-11-25 20:28:35,868 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:28:35,868 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:28:35,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:28:35,870 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:28:35,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206acbbe-0c5a-41a1-9b65-556809558ee0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-25 20:31:02,251 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:31:02,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:31:02,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 149 conjunts are in the unsatisfiable core [2021-11-25 20:31:02,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:31:02,881 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-25 20:31:02,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:02,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 16 treesize of output 18 [2021-11-25 20:31:02,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:31:02,972 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-25 20:31:02,972 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-25 20:31:03,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:03,018 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 23 treesize of output 22 [2021-11-25 20:31:03,081 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 0 case distinctions, treesize of input 34 treesize of output 18 [2021-11-25 20:31:03,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:03,147 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 16 treesize of output 18 [2021-11-25 20:31:03,197 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:31:03,204 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-25 20:31:03,204 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-25 20:31:03,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:03,249 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 23 treesize of output 22 [2021-11-25 20:31:03,315 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-11-25 20:31:03,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:03,342 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 16 treesize of output 18 [2021-11-25 20:31:03,391 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:31:03,398 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-25 20:31:03,398 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 2 case distinctions, treesize of input 31 treesize of output 27 [2021-11-25 20:31:03,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:03,447 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 23 treesize of output 22 [2021-11-25 20:31:03,509 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-11-25 20:31:03,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:03,536 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 16 treesize of output 18 [2021-11-25 20:31:03,587 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:31:03,594 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-25 20:31:03,594 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 2 case distinctions, treesize of input 31 treesize of output 27 [2021-11-25 20:31:03,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:03,647 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 23 treesize of output 22 [2021-11-25 20:31:03,711 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-11-25 20:31:03,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:03,739 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 16 treesize of output 18 [2021-11-25 20:31:03,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:31:03,799 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-25 20:31:03,800 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 2 case distinctions, treesize of input 31 treesize of output 27 [2021-11-25 20:31:03,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:03,852 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 23 treesize of output 22 [2021-11-25 20:31:03,917 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-11-25 20:31:03,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:03,946 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 16 treesize of output 18 [2021-11-25 20:31:04,007 INFO L354 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2021-11-25 20:31:04,007 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-25 20:31:04,057 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-25 20:31:04,058 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 23 treesize of output 22 [2021-11-25 20:31:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 597 proven. 175 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2021-11-25 20:31:04,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:31:04,293 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4968 Int) (v_ArrVal_4967 (Array Int Int))) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse1)) 20)) is different from false [2021-11-25 20:31:04,301 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4968 Int) (v_ArrVal_4967 (Array Int Int))) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse1)) 20)) is different from false [2021-11-25 20:31:04,309 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4968 Int) (v_ArrVal_4967 (Array Int Int))) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse1)) 20)) is different from false [2021-11-25 20:31:04,320 WARN L838 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84)) 20) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4967 (Array Int Int))) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse1)) 20))) is different from false [2021-11-25 20:31:04,337 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4968 Int) (v_ArrVal_4964 Int) (v_ArrVal_4967 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4964)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse4 (select .cse2 .cse3))) (or (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse1)) 20) (= .cse4 20))))) is different from false [2021-11-25 20:31:04,366 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4968 Int) (v_ArrVal_4964 Int) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int))) (let ((.cse3 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_4962) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4964)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (< (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_4968)) .cse2)) 20))))) is different from false [2021-11-25 20:31:04,380 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4968 Int) (v_ArrVal_4964 Int) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (store (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4962)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4964))) (let ((.cse3 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse1) 20) (= 20 .cse3)))))) is different from false [2021-11-25 20:31:04,394 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4968 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4964 Int) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4962)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4964))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse1) 20) (= 20 .cse4)))))) is different from false [2021-11-25 20:31:04,409 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4968 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4964 Int) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse4 (store (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4962)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4964))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_4968)) .cse2) 20)))))) is different from false [2021-11-25 20:31:04,430 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4968 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4964 Int) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4962)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4964))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_4968)) .cse1) 20) (= 20 .cse4)))))) is different from false [2021-11-25 20:31:04,448 WARN L838 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84)) 20) (forall ((v_ArrVal_4968 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4964 Int) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4962)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4964))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_4968)) .cse1) 20) (= 20 .cse4))))))) is different from false [2021-11-25 20:31:04,481 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4964 Int) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int))) (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4956)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse0 (select .cse7 .cse8))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse5 (store (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4962)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4964))) (let ((.cse1 (select .cse5 .cse3))) (or (= 20 .cse0) (= .cse1 20) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse3) 20)))))))) is different from false [2021-11-25 20:31:04,548 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4954 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4964 Int) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int))) (let ((.cse7 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_4954) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4956)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse0 (select .cse7 .cse8))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse4 (store (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse2) 4)) v_ArrVal_4962)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_4964))) (let ((.cse5 (select .cse4 .cse2))) (or (= .cse0 20) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse2) 20) (= .cse5 20)))))))) is different from false [2021-11-25 20:31:04,585 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4954 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4964 Int) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse8 (store (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4954)) .cse7 v_ArrVal_4956))) (let ((.cse5 (select .cse8 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse8 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse3 (store (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4962)) .cse7 v_ArrVal_4964))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse1) 20) (= .cse5 20) (= 20 .cse4))))))))) is different from false [2021-11-25 20:31:04,618 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4954 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4964 Int) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4953)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse1) 4)) v_ArrVal_4954)) .cse7 v_ArrVal_4956))) (let ((.cse5 (select .cse9 .cse1))) (let ((.cse2 (store (store .cse8 |c_~#queue~0.base| (store .cse9 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse3 (store (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4962)) .cse7 v_ArrVal_4964))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_4968)) .cse1) 20) (= .cse4 20) (= .cse5 20))))))))) is different from false [2021-11-25 20:31:04,655 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4954 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4964 Int) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_4953)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse2) 4)) v_ArrVal_4954)) .cse7 v_ArrVal_4956))) (let ((.cse0 (select .cse9 .cse2))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store .cse9 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse4 (store (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse2) 4)) v_ArrVal_4962)) .cse7 v_ArrVal_4964))) (let ((.cse5 (select .cse4 .cse2))) (or (= .cse0 20) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse2) 20) (= .cse5 20))))))))) is different from false [2021-11-25 20:31:04,694 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4954 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4964 Int) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4953)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4954)) .cse7 v_ArrVal_4956))) (let ((.cse0 (select .cse9 .cse3))) (let ((.cse4 (store (store .cse8 |c_~#queue~0.base| (store .cse9 .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse5 (store (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse3) 4)) v_ArrVal_4962)) .cse7 v_ArrVal_4964))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse0 20) (= .cse1 20) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse3) 20))))))))) is different from false [2021-11-25 20:31:04,736 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4954 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4964 Int) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4953)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4954)) .cse7 v_ArrVal_4956))) (let ((.cse0 (select .cse9 .cse3))) (let ((.cse4 (store (store .cse8 |c_~#queue~0.base| (store .cse9 .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse5 (store (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse3) 4)) v_ArrVal_4962)) .cse7 v_ArrVal_4964))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse0 20) (= .cse1 20) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse3) 20))))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84)) 20)) is different from false [2021-11-25 20:31:04,816 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4954 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4964 Int) (v_ArrVal_4950 Int) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int))) (let ((.cse12 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4950)) (.cse13 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse0 (select .cse12 .cse13))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse12 .cse13 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4953)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse10 (store (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4954)) .cse8 v_ArrVal_4956))) (let ((.cse6 (select .cse10 .cse2))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse4 (store (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4962)) .cse8 v_ArrVal_4964))) (let ((.cse5 (select .cse4 .cse2))) (or (= .cse0 20) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse2) 20) (= 20 .cse6) (= 20 .cse5))))))))))) is different from false [2021-11-25 20:31:05,005 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4948 Int) (v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4954 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4964 Int) (v_ArrVal_4950 Int) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int))) (let ((.cse12 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_4948) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4950)) (.cse13 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse5 (select .cse12 .cse13))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse12 .cse13 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_4953)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse10 (store (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4954)) .cse8 v_ArrVal_4956))) (let ((.cse6 (select .cse10 .cse1))) (let ((.cse2 (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse3 (store (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) v_ArrVal_4962)) .cse8 v_ArrVal_4964))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse1) 20) (= .cse4 20) (= .cse5 20) (= .cse6 20))))))))))) is different from false [2021-11-25 20:31:05,077 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4948 Int) (v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4954 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4964 Int) (v_ArrVal_4950 Int) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse12 (store (let ((.cse13 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4948)) .cse8 v_ArrVal_4950))) (let ((.cse6 (select .cse12 .cse2))) (let ((.cse9 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse12 .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_4953))) (let ((.cse10 (store (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4954)) .cse8 v_ArrVal_4956))) (let ((.cse5 (select .cse10 .cse2))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse4 (store (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4962)) .cse8 v_ArrVal_4964))) (let ((.cse0 (select .cse4 .cse2))) (or (= 20 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_4968)) .cse2) 20) (= .cse5 20) (= .cse6 20)))))))))))) is different from false [2021-11-25 20:31:05,152 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4948 Int) (v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4954 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4964 Int) (v_ArrVal_4950 Int) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int)) (v_ArrVal_4946 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse12 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4946)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse13 (store (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse2) 4)) v_ArrVal_4948)) .cse8 v_ArrVal_4950))) (let ((.cse6 (select .cse13 .cse2))) (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store .cse13 .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_4953))) (let ((.cse10 (store (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4954)) .cse8 v_ArrVal_4956))) (let ((.cse0 (select .cse10 .cse2))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse4 (store (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4962)) .cse8 v_ArrVal_4964))) (let ((.cse5 (select .cse4 .cse2))) (or (= .cse0 20) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ 1 .cse5))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse2) 20) (= 20 .cse5) (= .cse6 20)))))))))))) is different from false [2021-11-25 20:31:05,234 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4948 Int) (v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4954 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4964 Int) (v_ArrVal_4950 Int) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int)) (v_ArrVal_4946 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_4946)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse13 (store (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4948)) .cse8 v_ArrVal_4950))) (let ((.cse6 (select .cse13 .cse2))) (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store .cse13 .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_4953))) (let ((.cse10 (store (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse2) 4)) v_ArrVal_4954)) .cse8 v_ArrVal_4956))) (let ((.cse0 (select .cse10 .cse2))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse4 (store (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)) v_ArrVal_4962)) .cse8 v_ArrVal_4964))) (let ((.cse5 (select .cse4 .cse2))) (or (= .cse0 20) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_4968)) .cse2) 20) (= .cse5 20) (= .cse6 20)))))))))))) is different from false [2021-11-25 20:31:05,321 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4948 Int) (v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4954 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4964 Int) (v_ArrVal_4950 Int) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int)) (v_ArrVal_4946 (Array Int Int))) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse16 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse15 .cse16 (+ (select .cse15 .cse16) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4946)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse13 (store (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_4948)) .cse8 v_ArrVal_4950))) (let ((.cse2 (select .cse13 .cse4))) (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store .cse13 .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_4953))) (let ((.cse10 (store (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_4954)) .cse8 v_ArrVal_4956))) (let ((.cse0 (select .cse10 .cse4))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse6 (store (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_4962)) .cse8 v_ArrVal_4964))) (let ((.cse1 (select .cse6 .cse4))) (or (= 20 .cse0) (= .cse1 20) (= 20 .cse2) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse4 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_4968)) .cse4) 20)))))))))))) is different from false [2021-11-25 20:31:05,408 WARN L838 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84)) 20) (forall ((v_ArrVal_4948 Int) (v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4954 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4964 Int) (v_ArrVal_4950 Int) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4962 Int) (v_ArrVal_4967 (Array Int Int)) (v_ArrVal_4946 (Array Int Int))) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse16 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (store .cse15 .cse16 (+ (select .cse15 .cse16) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4946)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse13 (store (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_4948)) .cse8 v_ArrVal_4950))) (let ((.cse2 (select .cse13 .cse4))) (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store .cse13 .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_4953))) (let ((.cse10 (store (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_4954)) .cse8 v_ArrVal_4956))) (let ((.cse0 (select .cse10 .cse4))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse6 (store (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_4962)) .cse8 v_ArrVal_4964))) (let ((.cse1 (select .cse6 .cse4))) (or (= 20 .cse0) (= .cse1 20) (= 20 .cse2) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse4 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_4968)) .cse4) 20))))))))))))) is different from false [2021-11-25 20:31:05,594 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4948 Int) (v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4943 Int) (v_ArrVal_4954 Int) (v_ArrVal_4964 Int) (v_ArrVal_4950 Int) (v_ArrVal_4962 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4967 (Array Int Int)) (v_ArrVal_4946 (Array Int Int))) (let ((.cse16 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4943)) (.cse17 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse0 (select .cse16 .cse17))) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse16 .cse17 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4946)) (.cse9 (+ 88 |c_~#queue~0.offset|))) (let ((.cse14 (store (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_4948)) .cse9 v_ArrVal_4950))) (let ((.cse7 (select .cse14 .cse4))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store .cse14 .cse4 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_4953))) (let ((.cse11 (store (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_4954)) .cse9 v_ArrVal_4956))) (let ((.cse2 (select .cse11 .cse4))) (let ((.cse5 (store (store .cse10 |c_~#queue~0.base| (store .cse11 .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse6 (store (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_4962)) .cse9 v_ArrVal_4964))) (let ((.cse1 (select .cse6 .cse4))) (or (= .cse0 20) (= .cse1 20) (= 20 .cse2) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse4 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse4) 20) (= .cse7 20)))))))))))))) is different from false [2021-11-25 20:31:05,985 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4948 Int) (v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4943 Int) (v_ArrVal_4954 Int) (v_ArrVal_4941 Int) (v_ArrVal_4964 Int) (v_ArrVal_4950 Int) (v_ArrVal_4962 Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4967 (Array Int Int)) (v_ArrVal_4946 (Array Int Int))) (let ((.cse16 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_4941) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4943)) (.cse17 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse1 (select .cse16 .cse17))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse16 .cse17 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_4946)) (.cse9 (+ 88 |c_~#queue~0.offset|))) (let ((.cse14 (store (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4948)) .cse9 v_ArrVal_4950))) (let ((.cse0 (select .cse14 .cse3))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store .cse14 .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4953))) (let ((.cse11 (store (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4954)) .cse9 v_ArrVal_4956))) (let ((.cse7 (select .cse11 .cse3))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store .cse11 .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse5 (store (let ((.cse8 (select .cse4 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4962)) .cse9 v_ArrVal_4964))) (let ((.cse6 (select .cse5 .cse3))) (or (= .cse0 20) (= .cse1 20) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse3 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse3) 20) (= .cse7 20) (= .cse6 20)))))))))))))) is different from false [2021-11-25 20:31:06,356 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4948 Int) (v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4943 Int) (v_ArrVal_4954 Int) (v_ArrVal_4941 Int) (v_ArrVal_4964 Int) (v_ArrVal_4950 Int) (v_ArrVal_4962 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484| Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4967 (Array Int Int)) (v_ArrVal_4946 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse10 (+ 88 |c_~#queue~0.offset|))) (let ((.cse17 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484| 4) |c_~#queue~0.offset|) v_ArrVal_4941) .cse10 v_ArrVal_4943)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse17 .cse5))) (let ((.cse14 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse17 .cse5 (+ 1 .cse2))) |c_~#stored_elements~0.base| v_ArrVal_4946))) (let ((.cse15 (store (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse5) 4)) v_ArrVal_4948)) .cse10 v_ArrVal_4950))) (let ((.cse1 (select .cse15 .cse5))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store .cse15 .cse5 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_4953))) (let ((.cse12 (store (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_4954)) .cse10 v_ArrVal_4956))) (let ((.cse3 (select .cse12 .cse5))) (let ((.cse7 (store (store .cse11 |c_~#queue~0.base| (store .cse12 .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse8 (store (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_4962)) .cse10 v_ArrVal_4964))) (let ((.cse0 (select .cse8 .cse5))) (or (= 20 .cse0) (= .cse1 20) (= 20 .cse2) (= .cse3 20) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484|) (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse5) 20))))))))))))))) is different from false [2021-11-25 20:31:06,700 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4939 (Array Int Int)) (v_ArrVal_4948 Int) (v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4943 Int) (v_ArrVal_4954 Int) (v_ArrVal_4941 Int) (v_ArrVal_4964 Int) (v_ArrVal_4950 Int) (v_ArrVal_4962 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484| Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4967 (Array Int Int)) (v_ArrVal_4946 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4939))) (let ((.cse0 (select .cse17 |c_~#queue~0.base|)) (.cse10 (+ 88 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484| 4) |c_~#queue~0.offset|) v_ArrVal_4941) .cse10 v_ArrVal_4943)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse18 .cse1))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store .cse18 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_4946))) (let ((.cse15 (store (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4948)) .cse10 v_ArrVal_4950))) (let ((.cse8 (select .cse15 .cse1))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store .cse15 .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_4953))) (let ((.cse12 (store (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4954)) .cse10 v_ArrVal_4956))) (let ((.cse7 (select .cse12 .cse1))) (let ((.cse5 (store (store .cse11 |c_~#queue~0.base| (store .cse12 .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse6 (store (let ((.cse9 (select .cse5 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) v_ArrVal_4962)) .cse10 v_ArrVal_4964))) (let ((.cse3 (select .cse6 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484|) (= .cse2 20) (= .cse3 20) (< (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse1) 20) (= .cse7 20) (= .cse8 20)))))))))))))))) is different from false [2021-11-25 20:31:07,504 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4937 Int) (v_ArrVal_4939 (Array Int Int)) (v_ArrVal_4948 Int) (v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4943 Int) (v_ArrVal_4954 Int) (v_ArrVal_4941 Int) (v_ArrVal_4964 Int) (v_ArrVal_4950 Int) (v_ArrVal_4962 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484| Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4967 (Array Int Int)) (v_ArrVal_4946 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84) v_ArrVal_4937)) |c_~#stored_elements~0.base| v_ArrVal_4939))) (let ((.cse8 (select .cse17 |c_~#queue~0.base|)) (.cse10 (+ 88 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484| 4) |c_~#queue~0.offset|) v_ArrVal_4941) .cse10 v_ArrVal_4943)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse18 .cse4))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store .cse18 .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_4946))) (let ((.cse15 (store (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse4) 4)) v_ArrVal_4948)) .cse10 v_ArrVal_4950))) (let ((.cse1 (select .cse15 .cse4))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store .cse15 .cse4 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_4953))) (let ((.cse12 (store (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_4954)) .cse10 v_ArrVal_4956))) (let ((.cse0 (select .cse12 .cse4))) (let ((.cse5 (store (store .cse11 |c_~#queue~0.base| (store .cse12 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse6 (store (let ((.cse9 (select .cse5 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse4) 4)) v_ArrVal_4962)) .cse10 v_ArrVal_4964))) (let ((.cse7 (select .cse6 .cse4))) (or (= .cse0 20) (= .cse1 20) (= 20 .cse2) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse4 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse4) 20) (= .cse7 20) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_4937) (< (select .cse8 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484|)))))))))))))))) is different from false [2021-11-25 20:31:08,298 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4937 Int) (v_ArrVal_4939 (Array Int Int)) (v_ArrVal_4948 Int) (v_ArrVal_4956 Int) (v_ArrVal_4968 Int) (v_ArrVal_4943 Int) (v_ArrVal_4954 Int) (v_ArrVal_4941 Int) (v_ArrVal_4964 Int) (v_ArrVal_4950 Int) (v_ArrVal_4962 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484| Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4967 (Array Int Int)) (v_ArrVal_4946 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_4937)) |c_~#stored_elements~0.base| v_ArrVal_4939))) (let ((.cse10 (select .cse19 |c_~#queue~0.base|)) (.cse12 (+ 88 |c_~#queue~0.offset|))) (let ((.cse20 (store (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484| 4) |c_~#queue~0.offset|) v_ArrVal_4941) .cse12 v_ArrVal_4943)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse20 .cse6))) (let ((.cse16 (store (store .cse19 |c_~#queue~0.base| (store .cse20 .cse6 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4946))) (let ((.cse17 (store (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse6) 4)) v_ArrVal_4948)) .cse12 v_ArrVal_4950))) (let ((.cse1 (select .cse17 .cse6))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store .cse17 .cse6 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_4953))) (let ((.cse14 (store (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_4954)) .cse12 v_ArrVal_4956))) (let ((.cse0 (select .cse14 .cse6))) (let ((.cse7 (store (store .cse13 |c_~#queue~0.base| (store .cse14 .cse6 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse8 (store (let ((.cse11 (select .cse7 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse6) 4)) v_ArrVal_4962)) .cse12 v_ArrVal_4964))) (let ((.cse9 (select .cse8 .cse6))) (or (= .cse0 20) (= .cse1 20) (< (+ (select .cse2 .cse3) 1) v_ArrVal_4937) (= 20 .cse4) (< (select (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse6 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse6) 20) (= .cse9 20) (< (select .cse10 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484|))))))))))))))))) is different from false [2021-11-25 20:31:10,000 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4937 Int) (v_ArrVal_4939 (Array Int Int)) (v_ArrVal_4948 Int) (v_ArrVal_4956 Int) (v_ArrVal_4935 Int) (v_ArrVal_4968 Int) (v_ArrVal_4943 Int) (v_ArrVal_4954 Int) (v_ArrVal_4941 Int) (v_ArrVal_4964 Int) (v_ArrVal_4950 Int) (v_ArrVal_4962 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484| Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4967 (Array Int Int)) (v_ArrVal_4946 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4935)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_4937)) |c_~#stored_elements~0.base| v_ArrVal_4939))) (let ((.cse4 (select .cse19 |c_~#queue~0.base|)) (.cse12 (+ 88 |c_~#queue~0.offset|))) (let ((.cse20 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484| 4) |c_~#queue~0.offset|) v_ArrVal_4941) .cse12 v_ArrVal_4943)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select .cse20 .cse5))) (let ((.cse16 (store (store .cse19 |c_~#queue~0.base| (store .cse20 .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_4946))) (let ((.cse17 (store (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse5) 4)) v_ArrVal_4948)) .cse12 v_ArrVal_4950))) (let ((.cse7 (select .cse17 .cse5))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store .cse17 .cse5 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_4953))) (let ((.cse14 (store (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_4954)) .cse12 v_ArrVal_4956))) (let ((.cse6 (select .cse14 .cse5))) (let ((.cse9 (store (store .cse13 |c_~#queue~0.base| (store .cse14 .cse5 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse10 (store (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_4962)) .cse12 v_ArrVal_4964))) (let ((.cse2 (select .cse10 .cse5))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_4937) (= 20 .cse2) (= .cse3 20) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484|) (= 20 .cse6) (= .cse7 20) (< (select (let ((.cse8 (select (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse5 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse5) 4)) v_ArrVal_4968)) .cse5) 20))))))))))))))))) is different from false [2021-11-25 20:31:11,798 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4937 Int) (v_ArrVal_4939 (Array Int Int)) (v_ArrVal_4948 Int) (v_ArrVal_4934 Int) (v_ArrVal_4956 Int) (v_ArrVal_4935 Int) (v_ArrVal_4968 Int) (v_ArrVal_4943 Int) (v_ArrVal_4954 Int) (v_ArrVal_4941 Int) (v_ArrVal_4964 Int) (v_ArrVal_4950 Int) (v_ArrVal_4962 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484| Int) (v_ArrVal_4960 (Array Int Int)) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4967 (Array Int Int)) (v_ArrVal_4946 (Array Int Int))) (let ((.cse3 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_4934) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4935)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 84))) (let ((.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_4937)) |c_~#stored_elements~0.base| v_ArrVal_4939))) (let ((.cse1 (select .cse19 |c_~#queue~0.base|)) (.cse12 (+ 88 |c_~#queue~0.offset|))) (let ((.cse20 (store (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484| 4) |c_~#queue~0.offset|) v_ArrVal_4941) .cse12 v_ArrVal_4943)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse10 (select .cse20 .cse2))) (let ((.cse16 (store (store .cse19 |c_~#queue~0.base| (store .cse20 .cse2 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_4946))) (let ((.cse17 (store (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse2) 4)) v_ArrVal_4948)) .cse12 v_ArrVal_4950))) (let ((.cse0 (select .cse17 .cse2))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store .cse17 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4953))) (let ((.cse14 (store (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse2) 4)) v_ArrVal_4954)) .cse12 v_ArrVal_4956))) (let ((.cse9 (select .cse14 .cse2))) (let ((.cse6 (store (store .cse13 |c_~#queue~0.base| (store .cse14 .cse2 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse7 (store (let ((.cse11 (select .cse6 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse2) 4)) v_ArrVal_4962)) .cse12 v_ArrVal_4964))) (let ((.cse8 (select .cse7 .cse2))) (or (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_4937) (< (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4968)) .cse2) 20) (= .cse9 20) (= .cse10 20) (= 20 .cse8))))))))))))))))) is different from false [2021-11-25 20:31:13,506 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4937 Int) (v_ArrVal_4939 (Array Int Int)) (v_ArrVal_4948 Int) (v_ArrVal_4934 Int) (v_ArrVal_4956 Int) (v_ArrVal_4935 Int) (v_ArrVal_4968 Int) (v_ArrVal_4943 Int) (v_ArrVal_4954 Int) (v_ArrVal_4941 Int) (v_ArrVal_4964 Int) (v_ArrVal_4950 Int) (v_ArrVal_4962 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484| Int) (v_ArrVal_4960 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_486| Int) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4967 (Array Int Int)) (v_ArrVal_4946 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse12 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_486| 4) |c_~#queue~0.offset|) v_ArrVal_4934) .cse12 v_ArrVal_4935)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse19 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_4937)) |c_~#stored_elements~0.base| v_ArrVal_4939))) (let ((.cse0 (select .cse19 |c_~#queue~0.base|))) (let ((.cse20 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484| 4) |c_~#queue~0.offset|) v_ArrVal_4941) .cse12 v_ArrVal_4943))) (let ((.cse4 (select .cse20 .cse1))) (let ((.cse16 (store (store .cse19 |c_~#queue~0.base| (store .cse20 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4946))) (let ((.cse17 (store (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4948)) .cse12 v_ArrVal_4950))) (let ((.cse6 (select .cse17 .cse1))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store .cse17 .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_4953))) (let ((.cse14 (store (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse1) 4)) v_ArrVal_4954)) .cse12 v_ArrVal_4956))) (let ((.cse7 (select .cse14 .cse1))) (let ((.cse9 (store (store .cse13 |c_~#queue~0.base| (store .cse14 .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse10 (store (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4962)) .cse12 v_ArrVal_4964))) (let ((.cse3 (select .cse10 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_486|) (= 20 .cse3) (= .cse4 20) (< (+ (select .cse5 .cse1) 1) v_ArrVal_4937) (= .cse6 20) (= .cse7 20) (< (select (let ((.cse8 (select (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse1 (+ 1 .cse3))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) v_ArrVal_4968)) .cse1) 20)))))))))))))))))) is different from false [2021-11-25 20:31:15,091 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4937 Int) (v_ArrVal_4939 (Array Int Int)) (v_ArrVal_4948 Int) (v_ArrVal_4934 Int) (v_ArrVal_4956 Int) (v_ArrVal_4935 Int) (v_ArrVal_4968 Int) (v_ArrVal_4943 Int) (v_ArrVal_4954 Int) (v_ArrVal_4941 Int) (v_ArrVal_4964 Int) (v_ArrVal_4950 Int) (v_ArrVal_4962 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484| Int) (v_ArrVal_4960 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_486| Int) (v_ArrVal_4953 (Array Int Int)) (v_ArrVal_4932 (Array Int Int)) (v_ArrVal_4967 (Array Int Int)) (v_ArrVal_4946 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4932))) (let ((.cse9 (select .cse21 |c_~#queue~0.base|)) (.cse12 (+ 88 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_486| 4) |c_~#queue~0.offset|) v_ArrVal_4934) .cse12 v_ArrVal_4935)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse19 (store (store .cse21 |c_~#queue~0.base| (store .cse7 .cse2 v_ArrVal_4937)) |c_~#stored_elements~0.base| v_ArrVal_4939))) (let ((.cse1 (select .cse19 |c_~#queue~0.base|))) (let ((.cse20 (store (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484| 4) |c_~#queue~0.offset|) v_ArrVal_4941) .cse12 v_ArrVal_4943))) (let ((.cse0 (select .cse20 .cse2))) (let ((.cse16 (store (store .cse19 |c_~#queue~0.base| (store .cse20 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4946))) (let ((.cse17 (store (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4948)) .cse12 v_ArrVal_4950))) (let ((.cse8 (select .cse17 .cse2))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store .cse17 .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_4953))) (let ((.cse14 (store (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse2) 4)) v_ArrVal_4954)) .cse12 v_ArrVal_4956))) (let ((.cse10 (select .cse14 .cse2))) (let ((.cse4 (store (store .cse13 |c_~#queue~0.base| (store .cse14 .cse2 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_4960))) (let ((.cse5 (store (let ((.cse11 (select .cse4 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4962)) .cse12 v_ArrVal_4964))) (let ((.cse6 (select .cse5 .cse2))) (or (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_484|) (< (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse2) 4)) v_ArrVal_4968)) .cse2) 20) (= 20 .cse6) (< (+ (select .cse7 .cse2) 1) v_ArrVal_4937) (= .cse8 20) (< (select .cse9 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_486|) (= .cse10 20))))))))))))))))))) is different from false [2021-11-25 20:31:15,141 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:31:15,142 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 66402 treesize of output 47632 [2021-11-25 20:31:15,395 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:31:15,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27874 treesize of output 27634 [2021-11-25 20:31:15,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:31:15,483 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 12946 treesize of output 12938 [2021-11-25 20:31:15,554 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 18527 treesize of output 18143 [2021-11-25 20:31:15,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:31:15,641 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 25030 treesize of output 24518 [2021-11-25 20:31:15,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:31:15,752 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 29230 treesize of output 27982 [2021-11-25 20:31:16,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:31:16,196 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 23368 treesize of output 22728 [2021-11-25 20:31:16,668 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:31:16,715 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 20564 treesize of output 20036