./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/config/svcomp-Overflow-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 16:13:11,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 16:13:11,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 16:13:11,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 16:13:11,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 16:13:11,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 16:13:11,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 16:13:11,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 16:13:11,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 16:13:11,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 16:13:11,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 16:13:11,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 16:13:11,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 16:13:11,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 16:13:11,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 16:13:11,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 16:13:11,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 16:13:11,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 16:13:11,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 16:13:11,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 16:13:11,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 16:13:11,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 16:13:11,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 16:13:11,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 16:13:11,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 16:13:11,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 16:13:11,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 16:13:11,959 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 16:13:11,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 16:13:11,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 16:13:11,961 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 16:13:11,962 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 16:13:11,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 16:13:11,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 16:13:11,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 16:13:11,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 16:13:11,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 16:13:11,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 16:13:11,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 16:13:11,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 16:13:11,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 16:13:11,972 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/config/svcomp-Overflow-32bit-GemCutter_Default.epf [2022-11-20 16:13:12,028 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 16:13:12,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 16:13:12,030 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 16:13:12,030 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 16:13:12,031 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 16:13:12,031 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 16:13:12,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 16:13:12,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 16:13:12,032 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 16:13:12,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 16:13:12,034 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 16:13:12,034 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 16:13:12,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 16:13:12,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 16:13:12,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 16:13:12,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 16:13:12,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 16:13:12,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 16:13:12,036 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 16:13:12,036 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 16:13:12,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 16:13:12,036 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 16:13:12,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 16:13:12,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 16:13:12,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 16:13:12,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 16:13:12,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 16:13:12,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 16:13:12,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 16:13:12,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 16:13:12,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 16:13:12,039 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-20 16:13:12,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 16:13:12,040 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 16:13:12,040 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-20 16:13:12,040 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-20 16:13:12,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 16:13:12,041 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-20 16:13:12,041 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-20 16:13:12,041 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/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_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter 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 [2022-11-20 16:13:12,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 16:13:12,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 16:13:12,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 16:13:12,333 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 16:13:12,333 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 16:13:12,335 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/../../sv-benchmarks/c/pthread/queue_ok.i [2022-11-20 16:13:15,320 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 16:13:15,663 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 16:13:15,663 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/sv-benchmarks/c/pthread/queue_ok.i [2022-11-20 16:13:15,696 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/data/53c7e8aca/064d9550de404d93a299bd5c743d3f92/FLAG52b921ee6 [2022-11-20 16:13:15,726 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/data/53c7e8aca/064d9550de404d93a299bd5c743d3f92 [2022-11-20 16:13:15,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 16:13:15,730 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 16:13:15,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 16:13:15,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 16:13:15,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 16:13:15,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:13:15" (1/1) ... [2022-11-20 16:13:15,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b8828af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:15, skipping insertion in model container [2022-11-20 16:13:15,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:13:15" (1/1) ... [2022-11-20 16:13:15,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 16:13:15,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 16:13:16,340 WARN L237 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_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-20 16:13:16,343 WARN L237 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_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-20 16:13:16,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 16:13:16,362 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 16:13:16,414 WARN L237 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_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-20 16:13:16,417 WARN L237 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_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-20 16:13:16,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 16:13:16,483 INFO L208 MainTranslator]: Completed translation [2022-11-20 16:13:16,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:16 WrapperNode [2022-11-20 16:13:16,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 16:13:16,485 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 16:13:16,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 16:13:16,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 16:13:16,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:16" (1/1) ... [2022-11-20 16:13:16,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:16" (1/1) ... [2022-11-20 16:13:16,564 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-11-20 16:13:16,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 16:13:16,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 16:13:16,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 16:13:16,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 16:13:16,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:16" (1/1) ... [2022-11-20 16:13:16,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:16" (1/1) ... [2022-11-20 16:13:16,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:16" (1/1) ... [2022-11-20 16:13:16,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:16" (1/1) ... [2022-11-20 16:13:16,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:16" (1/1) ... [2022-11-20 16:13:16,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:16" (1/1) ... [2022-11-20 16:13:16,633 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:16" (1/1) ... [2022-11-20 16:13:16,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:16" (1/1) ... [2022-11-20 16:13:16,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 16:13:16,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 16:13:16,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 16:13:16,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 16:13:16,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:16" (1/1) ... [2022-11-20 16:13:16,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 16:13:16,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:13:16,692 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 16:13:16,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 16:13:16,734 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-20 16:13:16,734 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-20 16:13:16,735 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-20 16:13:16,735 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-20 16:13:16,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 16:13:16,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 16:13:16,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 16:13:16,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 16:13:16,736 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 16:13:16,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 16:13:16,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 16:13:16,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 16:13:16,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 16:13:16,739 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 16:13:16,912 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 16:13:16,915 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 16:13:17,505 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 16:13:17,516 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 16:13:17,516 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 16:13:17,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:13:17 BoogieIcfgContainer [2022-11-20 16:13:17,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 16:13:17,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 16:13:17,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 16:13:17,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 16:13:17,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:13:15" (1/3) ... [2022-11-20 16:13:17,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c04e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:13:17, skipping insertion in model container [2022-11-20 16:13:17,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:16" (2/3) ... [2022-11-20 16:13:17,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c04e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:13:17, skipping insertion in model container [2022-11-20 16:13:17,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:13:17" (3/3) ... [2022-11-20 16:13:17,531 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-11-20 16:13:17,540 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 16:13:17,552 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 16:13:17,552 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-20 16:13:17,553 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 16:13:17,725 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 16:13:17,786 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 16:13:17,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-20 16:13:17,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:13:17,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-20 16:13:17,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-20 16:13:17,853 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-20 16:13:17,875 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2022-11-20 16:13:17,882 INFO L357 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=PARTIAL_ORDER_FA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@8bbacf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 16:13:17,883 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-20 16:13:18,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:13:18,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:13:18,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1319727467, now seen corresponding path program 1 times [2022-11-20 16:13:18,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:13:18,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178733571] [2022-11-20 16:13:18,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:18,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:13:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:18,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:18,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:13:18,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178733571] [2022-11-20 16:13:18,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178733571] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:13:18,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:13:18,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 16:13:18,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011657007] [2022-11-20 16:13:18,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:13:18,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 16:13:18,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:13:18,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 16:13:18,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 16:13:18,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:19,001 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:13:19,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 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) [2022-11-20 16:13:19,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:19,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:19,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 16:13:19,091 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:13:19,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:13:19,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1423842390, now seen corresponding path program 1 times [2022-11-20 16:13:19,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:13:19,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925260907] [2022-11-20 16:13:19,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:19,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:13:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:19,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:13:19,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925260907] [2022-11-20 16:13:19,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925260907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:13:19,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:13:19,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 16:13:19,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348898356] [2022-11-20 16:13:19,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:13:19,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 16:13:19,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:13:19,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 16:13:19,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 16:13:19,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:19,588 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:13:19,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:13:19,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:19,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:19,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:19,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:19,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 16:13:19,679 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:13:19,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:13:19,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1119853959, now seen corresponding path program 1 times [2022-11-20 16:13:19,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:13:19,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107401245] [2022-11-20 16:13:19,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:19,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:13:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:23,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:23,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:13:23,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107401245] [2022-11-20 16:13:23,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107401245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:13:23,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:13:23,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-20 16:13:23,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702939257] [2022-11-20 16:13:23,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:13:23,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 16:13:23,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:13:23,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 16:13:23,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-11-20 16:13:23,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:23,194 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:13:23,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.0) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:13:23,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:23,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:23,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:25,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:25,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:25,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:13:25,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 16:13:25,029 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:13:25,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:13:25,031 INFO L85 PathProgramCache]: Analyzing trace with hash -828858809, now seen corresponding path program 1 times [2022-11-20 16:13:25,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:13:25,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750250213] [2022-11-20 16:13:25,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:25,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:13:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:25,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:25,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:13:25,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750250213] [2022-11-20 16:13:25,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750250213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:13:25,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:13:25,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 16:13:25,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199808880] [2022-11-20 16:13:25,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:13:25,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 16:13:25,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:13:25,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 16:13:25,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 16:13:25,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:25,197 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:13:25,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 37.0) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:13:25,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:25,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:25,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:13:25,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:25,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:25,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:25,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:13:25,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:13:25,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 16:13:25,315 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:13:25,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:13:25,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1017669425, now seen corresponding path program 1 times [2022-11-20 16:13:25,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:13:25,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122892845] [2022-11-20 16:13:25,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:25,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:13:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:27,724 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:27,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:13:27,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122892845] [2022-11-20 16:13:27,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122892845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:13:27,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:13:27,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-20 16:13:27,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364013102] [2022-11-20 16:13:27,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:13:27,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 16:13:27,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:13:27,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 16:13:27,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-20 16:13:27,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:27,731 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:13:27,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.842105263157895) internal successors, (130), 19 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:13:27,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:27,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:27,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:13:27,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:13:27,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:28,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:28,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:28,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:13:28,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:13:28,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:13:28,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 16:13:28,936 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:13:28,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:13:28,936 INFO L85 PathProgramCache]: Analyzing trace with hash -91224222, now seen corresponding path program 1 times [2022-11-20 16:13:28,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:13:28,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732669471] [2022-11-20 16:13:28,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:28,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:13:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:35,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:13:35,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732669471] [2022-11-20 16:13:35,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732669471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:13:35,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:13:35,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-20 16:13:35,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284333539] [2022-11-20 16:13:35,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:13:35,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 16:13:35,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:13:35,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 16:13:35,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-11-20 16:13:35,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:35,328 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:13:35,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.526315789473684) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:13:35,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:35,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:35,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:13:35,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:13:35,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:13:35,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:37,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:37,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:37,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:13:37,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:13:37,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:13:37,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:13:37,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 16:13:37,428 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:13:37,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:13:37,429 INFO L85 PathProgramCache]: Analyzing trace with hash 217716167, now seen corresponding path program 1 times [2022-11-20 16:13:37,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:13:37,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65061815] [2022-11-20 16:13:37,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:37,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:13:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:43,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:13:43,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65061815] [2022-11-20 16:13:43,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65061815] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:13:43,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149040787] [2022-11-20 16:13:43,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:43,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:13:43,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:13:43,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:13:43,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 16:13:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:43,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 16:13:43,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:13:43,810 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 16:13:43,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 16:13:43,906 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 16:13:43,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 16:13:44,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:13:44,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:13:45,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 16:13:45,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 16:13:46,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:13:46,052 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-20 16:13:46,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:13:46,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:13:46,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:13:46,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-20 16:13:46,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-20 16:13:47,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:13:47,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 16:13:47,498 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-20 16:13:47,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:13:47,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 16:13:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:47,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:13:48,192 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_226 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 16:13:48,305 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_225 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 16:13:48,372 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_225)))) is different from false [2022-11-20 16:13:48,687 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_223 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_223) .cse2 v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (not (<= v_ArrVal_223 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_225))))) is different from false [2022-11-20 16:13:49,267 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_223 Int) (v_ArrVal_220 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_220)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_223) .cse2 v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_225) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_223))))) is different from false [2022-11-20 16:13:49,728 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_223 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (v_ArrVal_220 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4)) v_ArrVal_220)) (.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 .cse1 v_ArrVal_223) .cse2 v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_223) (< (+ (select .cse0 .cse2) 1) v_ArrVal_225) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse4 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse3 (+ 84 |c_~#queue~0.offset|))))))))) is different from false [2022-11-20 16:13:56,629 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_223 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (v_ArrVal_220 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_219))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4) |c_~#queue~0.offset|) v_ArrVal_220)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_223) .cse3 v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_223) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) .cse1) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_225) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse2 .cse3))))))))) is different from false [2022-11-20 16:13:57,070 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_218 (Array Int Int)) (v_ArrVal_223 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (v_ArrVal_220 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_219))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4) |c_~#queue~0.offset|) v_ArrVal_220)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_223) .cse1 v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_223) (< (+ (select .cse4 .cse1) 1) v_ArrVal_225) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse2 .cse1))))))))) is different from false [2022-11-20 16:13:57,873 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_218 (Array Int Int)) (v_ArrVal_223 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (v_ArrVal_220 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_217 Int) (v_ArrVal_227 Int)) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_217)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_219))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4) |c_~#queue~0.offset|) v_ArrVal_220)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_223) .cse1 v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_217 0)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_223) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse4 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_225))))))) is different from false [2022-11-20 16:13:57,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:13:57,916 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 270 treesize of output 185 [2022-11-20 16:13:57,942 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:13:57,955 INFO L350 Elim1Store]: Elim1 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 644 treesize of output 640 [2022-11-20 16:13:57,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 292 treesize of output 280 [2022-11-20 16:13:58,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 397 treesize of output 365 [2022-11-20 16:13:58,051 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:13:58,051 INFO L350 Elim1Store]: Elim1 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 549 treesize of output 525 [2022-11-20 16:13:58,176 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:13:58,177 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2022-11-20 16:13:59,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:13:59,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 172 treesize of output 168 [2022-11-20 16:14:00,362 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:14:00,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 85 [2022-11-20 16:14:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-20 16:14:00,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149040787] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:14:00,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:14:00,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 29] total 82 [2022-11-20 16:14:00,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984987400] [2022-11-20 16:14:00,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:14:00,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-11-20 16:14:00,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:14:00,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-11-20 16:14:00,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=4784, Unknown=30, NotChecked=1368, Total=6806 [2022-11-20 16:14:00,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:14:00,574 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:14:00,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 4.524390243902439) internal successors, (371), 83 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:14:00,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:14:00,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:14:00,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:14:00,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:14:00,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:14:00,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:14:00,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:14:08,657 WARN L233 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 112 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:14:43,505 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:14:43,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:14:43,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:14:43,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:14:43,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:14:43,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:14:43,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:14:43,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:14:43,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 16:14:43,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:14:43,715 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:14:43,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:14:43,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1840732794, now seen corresponding path program 1 times [2022-11-20 16:14:43,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:14:43,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494489770] [2022-11-20 16:14:43,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:14:43,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:14:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:14:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:14:45,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:14:45,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494489770] [2022-11-20 16:14:45,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494489770] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:14:45,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669889145] [2022-11-20 16:14:45,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:14:45,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:14:45,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:14:45,647 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:14:45,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 16:14:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:14:45,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-20 16:14:45,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:14:46,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:14:47,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 16:14:47,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:14:47,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 16:14:47,914 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 16:14:47,914 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 32 [2022-11-20 16:14:48,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 16:14:48,066 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:14:48,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:14:49,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:14:49,266 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-20 16:14:49,280 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:14:49,280 INFO L350 Elim1Store]: Elim1 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 56 treesize of output 60 [2022-11-20 16:14:49,291 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 28 [2022-11-20 16:14:49,314 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 6 [2022-11-20 16:14:49,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:14:49,340 INFO L350 Elim1Store]: Elim1 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 48 treesize of output 48 [2022-11-20 16:14:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:14:49,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669889145] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:14:49,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:14:49,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 51 [2022-11-20 16:14:49,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183925627] [2022-11-20 16:14:49,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:14:49,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-20 16:14:49,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:14:49,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-20 16:14:49,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2380, Unknown=13, NotChecked=0, Total=2652 [2022-11-20 16:14:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:14:49,869 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:14:49,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 7.313725490196078) internal successors, (373), 52 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:14:49,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:14:49,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:14:49,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:14:49,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:14:49,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:14:49,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:14:49,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:14:49,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:15:13,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:15:13,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:15:13,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:15:13,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:15:13,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:15:13,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:15:13,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-20 16:15:13,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 16:15:13,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 16:15:13,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:15:13,672 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:15:13,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:15:13,673 INFO L85 PathProgramCache]: Analyzing trace with hash -431098475, now seen corresponding path program 1 times [2022-11-20 16:15:13,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:15:13,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023609559] [2022-11-20 16:15:13,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:15:13,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:15:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:15:13,783 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 16:15:13,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:15:13,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023609559] [2022-11-20 16:15:13,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023609559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:15:13,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:15:13,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 16:15:13,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710127755] [2022-11-20 16:15:13,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:15:13,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 16:15:13,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:15:13,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 16:15:13,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 16:15:13,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:15:13,787 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:15:13,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:15:13,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:15:13,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:15:13,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:15:13,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:15:13,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:15:13,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:15:13,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-20 16:15:13,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-20 16:15:13,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:15:13,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:15:13,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:15:13,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:15:13,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:15:13,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:15:13,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:15:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-20 16:15:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 16:15:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:15:13,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 16:15:13,865 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:15:13,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:15:13,865 INFO L85 PathProgramCache]: Analyzing trace with hash -479150187, now seen corresponding path program 1 times [2022-11-20 16:15:13,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:15:13,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585610287] [2022-11-20 16:15:13,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:15:13,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:15:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:15:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:15:14,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:15:14,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585610287] [2022-11-20 16:15:14,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585610287] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:15:14,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897215202] [2022-11-20 16:15:14,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:15:14,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:15:14,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:15:14,038 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:15:14,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 16:15:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:15:14,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 16:15:14,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:15:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:15:14,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 16:15:14,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897215202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:15:14,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 16:15:14,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 16:15:14,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284960849] [2022-11-20 16:15:14,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:15:14,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 16:15:14,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:15:14,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 16:15:14,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 16:15:14,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:15:14,350 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:15:14,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 38.25) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:15:14,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:15:14,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:15:14,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:15:14,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:15:14,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:15:14,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:15:14,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-20 16:15:14,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-20 16:15:14,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:15:14,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:15:14,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:15:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:15:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:15:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:15:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:15:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:15:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-20 16:15:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 16:15:14,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:15:14,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:15:14,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 16:15:15,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 16:15:15,094 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:15:15,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:15:15,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1890333377, now seen corresponding path program 1 times [2022-11-20 16:15:15,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:15:15,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103255076] [2022-11-20 16:15:15,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:15:15,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:15:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:15:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:15:18,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:15:18,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103255076] [2022-11-20 16:15:18,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103255076] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:15:18,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951150959] [2022-11-20 16:15:18,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:15:18,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:15:18,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:15:18,540 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:15:18,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 16:15:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:15:18,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-20 16:15:18,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:15:18,964 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 16:15:18,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 16:15:19,043 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 16:15:19,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 16:15:19,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:15:19,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:15:20,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:15:20,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:15:20,726 INFO L321 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2022-11-20 16:15:20,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 52 [2022-11-20 16:15:21,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:15:21,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:15:21,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2022-11-20 16:15:22,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 32 [2022-11-20 16:15:22,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:15:22,588 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 34 [2022-11-20 16:15:23,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:15:23,402 INFO L321 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-11-20 16:15:23,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 50 [2022-11-20 16:15:24,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:15:24,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:15:24,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 44 [2022-11-20 16:15:24,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2022-11-20 16:15:24,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:15:24,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 16:15:25,396 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-20 16:15:25,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:15:25,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 16:15:25,610 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:15:25,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:15:26,416 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 16:15:26,495 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_496 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-11-20 16:15:28,230 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (let ((.cse0 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_492))) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 .cse3 v_ArrVal_494) .cse1 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< 20 (select .cse0 .cse1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (not (<= v_ArrVal_496 1)) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_494)))))) is different from false [2022-11-20 16:15:29,542 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse0 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_492))) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_494) .cse3 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_494) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse1) 2147483647) (not (<= v_ArrVal_496 1)) (< 20 (select .cse0 .cse3)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 .cse3)))))))) is different from false [2022-11-20 16:15:29,688 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_492))) (.cse3 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_494) .cse1 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_496 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (< 20 (select .cse2 .cse1)) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse3) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_494)))))) is different from false [2022-11-20 16:15:29,729 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse0 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_492))) (.cse2 (+ 88 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_494) .cse1 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< 20 (select .cse0 .cse1)) (< (+ (select .cse0 .cse2) 1) v_ArrVal_494) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse2) 2147483647) (not (<= v_ArrVal_496 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse3 .cse1)))))))) is different from false [2022-11-20 16:15:30,529 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse7 .cse8))) (or (= .cse0 20) (forall ((v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_487) .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse1 (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_492))) (.cse3 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse1 .cse3 v_ArrVal_494) .cse2 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< 20 (select .cse1 .cse2)) (< (+ (select .cse1 .cse3) 1) v_ArrVal_494) (not (<= v_ArrVal_496 1)) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse4 .cse2))) (not (<= v_ArrVal_487 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))))))) is different from false [2022-11-20 16:15:30,703 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse7 .cse8))) (or (= .cse0 20) (forall ((v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_487) .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse1 (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_492))) (.cse3 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse1 .cse3 v_ArrVal_494) .cse2 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< 20 (select .cse1 .cse2)) (< (+ (select .cse1 .cse3) 1) v_ArrVal_494) (not (<= v_ArrVal_496 1)) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse4 .cse2))) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 1) v_ArrVal_487))))))))) is different from false [2022-11-20 16:15:30,780 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse5 .cse9))) (or (= .cse0 20) (forall ((v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse6 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_487) .cse9 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse1 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_492))) (.cse3 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse1 .cse3 v_ArrVal_494) .cse2 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< 20 (select .cse1 .cse2)) (< (+ (select .cse1 .cse3) 1) v_ArrVal_494) (not (<= v_ArrVal_496 1)) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse4 .cse2))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_487)))))))))) is different from false [2022-11-20 16:15:30,919 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_485 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_485)) (.cse9 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse6 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (select .cse5 .cse9))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_487) .cse9 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse0 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_492))) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_494) .cse3 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_494) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 .cse3))) (not (<= v_ArrVal_496 1)) (= .cse4 20) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse1) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_487) (< 20 (select .cse0 .cse3))))))))) is different from false [2022-11-20 16:15:31,045 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| Int)) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_485 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse3 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_485))) (let ((.cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (select .cse3 .cse9))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_487) .cse9 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse0 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_492))) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse6 v_ArrVal_494) .cse1 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< 20 (select .cse0 .cse1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (not (<= v_ArrVal_496 1)) (< (+ (select .cse3 .cse4) 1) v_ArrVal_487) (= .cse5 20) (< (+ (select .cse0 .cse6) 1) v_ArrVal_494) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse6) 2147483647)))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| (select .cse10 .cse9)))))) is different from false [2022-11-20 16:15:31,253 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_485 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| Int) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse6 (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_485)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (let ((.cse7 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse0 (select .cse6 .cse2))) (let ((.cse8 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse6 .cse7 v_ArrVal_487) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse5 (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse8) 4)) v_ArrVal_492))) (.cse4 (+ 88 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_494) .cse8 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_496 1)) (= .cse0 20) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| (select .cse1 .cse2))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse4) 2147483647) (< (+ (select .cse5 .cse4) 1) v_ArrVal_494) (< (+ (select .cse6 .cse7) 1) v_ArrVal_487) (< 20 (select .cse5 .cse8)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse3 .cse8))))))))))) is different from false [2022-11-20 16:15:34,743 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_485 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| Int) (v_ArrVal_492 Int) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| 4) |c_~#queue~0.offset|) v_ArrVal_485)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse5 (select .cse6 .cse1))) (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_487) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse4 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_492)))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_494) .cse1 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| (select .cse0 .cse1))) (not (<= v_ArrVal_496 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_494) (= .cse5 20) (< (+ (select .cse6 .cse3) 1) v_ArrVal_487) (< 20 (select .cse4 .cse1))))))))))) is different from false [2022-11-20 16:15:35,650 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_485 Int) (v_ArrVal_496 Int) (v_ArrVal_494 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| Int) (v_ArrVal_492 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| 4) |c_~#queue~0.offset|) v_ArrVal_485)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (select .cse6 .cse5))) (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_487) .cse5 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse0 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse5) 4)) v_ArrVal_492)))) (let ((.cse3 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_494) .cse5 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_494) (= .cse2 20) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse1) 2147483647) (not (<= v_ArrVal_496 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| (select .cse4 .cse5))) (< 20 (select .cse0 .cse5)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse3 .cse5))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_487)))))))))) is different from false [2022-11-20 16:15:37,095 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:15:37,096 INFO L350 Elim1Store]: Elim1 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 1107 treesize of output 787 [2022-11-20 16:15:37,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:15:37,159 INFO L350 Elim1Store]: Elim1 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 3984 treesize of output 3942 [2022-11-20 16:15:37,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1832 treesize of output 1768 [2022-11-20 16:15:37,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2022 treesize of output 1894 [2022-11-20 16:15:37,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:15:37,385 INFO L350 Elim1Store]: Elim1 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 3690 treesize of output 3562 [2022-11-20 16:15:37,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3110 treesize of output 2918 [2022-11-20 16:15:37,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-20 16:16:28,164 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:16:28,165 INFO L350 Elim1Store]: Elim1 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 2971 treesize of output 2885 [2022-11-20 16:16:35,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:16:35,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 85 [2022-11-20 16:16:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 31 not checked. [2022-11-20 16:16:36,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951150959] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:16:36,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:16:36,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 39, 41] total 105 [2022-11-20 16:16:36,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065008509] [2022-11-20 16:16:36,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:16:36,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2022-11-20 16:16:36,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:16:36,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2022-11-20 16:16:36,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=7472, Unknown=66, NotChecked=2674, Total=10920 [2022-11-20 16:16:36,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:36,199 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:16:36,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 4.552380952380952) internal successors, (478), 105 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:16:36,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:36,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:16:36,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:16:36,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:16:36,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:16:36,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:16:36,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-20 16:16:36,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-20 16:16:36,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:16:36,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:16:36,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:17:09,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:17:09,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:17:09,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:17:09,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:17:09,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:17:09,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:17:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-20 16:17:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 16:17:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:17:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:17:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-20 16:17:09,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 16:17:09,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:17:09,786 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:17:09,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:17:09,786 INFO L85 PathProgramCache]: Analyzing trace with hash -38506192, now seen corresponding path program 1 times [2022-11-20 16:17:09,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:17:09,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176668561] [2022-11-20 16:17:09,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:17:09,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:17:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:17:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:17:13,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:17:13,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176668561] [2022-11-20 16:17:13,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176668561] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:17:13,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588178662] [2022-11-20 16:17:13,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:17:13,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:17:13,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:17:13,003 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:17:13,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 16:17:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:17:13,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-20 16:17:13,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:17:13,319 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 16:17:13,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 16:17:13,397 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 16:17:13,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 16:17:13,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:17:13,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:17:14,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:17:14,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:17:14,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:17:14,946 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 16:17:14,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:17:15,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:17:15,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:17:15,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 16:17:15,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:17:15,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:17:15,964 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:17:15,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-20 16:17:16,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:17:16,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 16:17:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:17:16,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:17:16,668 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_579 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse1)) 2147483647)) is different from false [2022-11-20 16:17:16,824 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_579 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_579)) .cse1)) 2147483647)) is different from false [2022-11-20 16:17:16,842 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_579 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_579)) .cse1)) 2147483647)) (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 20)) is different from false [2022-11-20 16:17:16,857 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_579 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_579)) .cse1)) 2147483647)) (= .cse4 20)))) is different from false [2022-11-20 16:17:16,889 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (v_ArrVal_579 Int)) (< (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_574) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse2)) 2147483647))))) is different from false [2022-11-20 16:17:16,949 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (v_ArrVal_572 Int) (v_ArrVal_579 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_572)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_574) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse1)) 2147483647) (= .cse4 20))))) is different from false [2022-11-20 16:17:16,974 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| (select .cse0 .cse1))) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (v_ArrVal_572 Int) (v_ArrVal_579 Int)) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_572))) (let ((.cse2 (select .cse5 .cse1))) (or (= .cse2 20) (< (let ((.cse4 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_574) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_579)) .cse4)) 2147483647)))))))) is different from false [2022-11-20 16:17:17,020 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| Int) (v_ArrVal_574 Int) (v_ArrVal_572 Int) (v_ArrVal_579 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_572)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~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_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_574) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse2)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| (select .cse5 .cse4)))))))) is different from false [2022-11-20 16:17:17,430 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| Int) (v_ArrVal_574 Int) (v_ArrVal_572 Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_579 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_571))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| 4) |c_~#queue~0.offset|) v_ArrVal_572)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| (select .cse0 .cse1))) (< (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_574) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_579)) .cse1) 2147483647) (= .cse5 20))))))) is different from false [2022-11-20 16:17:17,640 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| Int) (v_ArrVal_574 Int) (v_ArrVal_572 Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_579 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_570) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_571))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| 4) |c_~#queue~0.offset|) v_ArrVal_572)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_574) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| (select .cse5 .cse1))) (= 20 .cse4))))))) is different from false [2022-11-20 16:17:18,257 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:17:18,257 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 297 treesize of output 197 [2022-11-20 16:17:18,275 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:17:18,276 INFO L350 Elim1Store]: Elim1 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 533 treesize of output 529 [2022-11-20 16:17:18,288 INFO L350 Elim1Store]: Elim1 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 422 treesize of output 374 [2022-11-20 16:17:18,298 INFO L350 Elim1Store]: Elim1 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 603 treesize of output 563 [2022-11-20 16:17:18,318 INFO L350 Elim1Store]: Elim1 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 349 treesize of output 329 [2022-11-20 16:17:18,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-20 16:17:18,375 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:17:18,376 INFO L350 Elim1Store]: Elim1 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 338 treesize of output 322 [2022-11-20 16:17:22,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:17:22,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 136 [2022-11-20 16:17:22,425 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2022-11-20 16:17:22,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588178662] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:17:22,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:17:22,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 29] total 76 [2022-11-20 16:17:22,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562292366] [2022-11-20 16:17:22,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:17:22,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-20 16:17:22,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:17:22,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-20 16:17:22,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=3893, Unknown=33, NotChecked=1390, Total=5852 [2022-11-20 16:17:22,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:17:22,431 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:17:22,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 5.276315789473684) internal successors, (401), 77 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:17:22,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:17:22,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:17:22,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:17:22,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:17:22,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:17:22,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:17:22,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-11-20 16:17:22,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-20 16:17:22,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:17:22,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:17:22,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-20 16:17:22,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:17:58,525 WARN L233 SmtUtils]: Spent 32.55s on a formula simplification. DAG size of input: 72 DAG size of output: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:18:01,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:18:01,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:18:01,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:18:01,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:18:01,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:18:01,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:18:01,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-20 16:18:01,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 16:18:01,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:18:01,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:18:01,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:18:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 16:18:01,678 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 16:18:01,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:18:01,877 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:18:01,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:18:01,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1193691313, now seen corresponding path program 1 times [2022-11-20 16:18:01,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:18:01,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468581290] [2022-11-20 16:18:01,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:18:01,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:18:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:18:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:18:03,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:18:03,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468581290] [2022-11-20 16:18:03,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468581290] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:18:03,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211678953] [2022-11-20 16:18:03,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:18:03,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:18:03,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:18:03,325 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:18:03,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 16:18:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:18:03,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-20 16:18:03,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:18:04,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:18:04,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:18:04,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 16:18:04,659 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 16:18:04,660 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 32 [2022-11-20 16:18:04,791 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 24 [2022-11-20 16:18:04,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-20 16:18:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:18:04,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:18:05,515 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_649 (Array Int Int)) (v_ArrVal_650 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_649) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_650) (+ 84 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_650 2147483648) 0))) is different from false [2022-11-20 16:18:05,589 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:18:05,589 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 32 [2022-11-20 16:18:05,600 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:18:05,600 INFO L350 Elim1Store]: Elim1 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 56 treesize of output 60 [2022-11-20 16:18:05,608 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 28 [2022-11-20 16:18:05,629 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 6 [2022-11-20 16:18:05,646 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:18:05,647 INFO L350 Elim1Store]: Elim1 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 48 treesize of output 48 [2022-11-20 16:18:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:18:06,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211678953] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:18:06,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:18:06,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 46 [2022-11-20 16:18:06,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758855965] [2022-11-20 16:18:06,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:18:06,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-20 16:18:06,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:18:06,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-20 16:18:06,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1892, Unknown=1, NotChecked=88, Total=2162 [2022-11-20 16:18:06,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:18:06,194 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:18:06,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 8.782608695652174) internal successors, (404), 47 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:18:06,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:18:06,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:18:06,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:18:06,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:18:06,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:18:06,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:18:06,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-11-20 16:18:06,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-20 16:18:06,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:18:06,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:18:06,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:18:06,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-20 16:18:06,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:09,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:09,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:20:09,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:20:09,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:20:09,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:20:09,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:20:09,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-20 16:20:09,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 16:20:09,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:20:09,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:20:09,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:20:09,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-20 16:20:09,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:20:09,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 16:20:09,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 16:20:09,238 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:20:09,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:20:09,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1413197191, now seen corresponding path program 2 times [2022-11-20 16:20:09,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:20:09,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840890624] [2022-11-20 16:20:09,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:20:09,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:20:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:20:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 143 proven. 76 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-20 16:20:10,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:20:10,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840890624] [2022-11-20 16:20:10,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840890624] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:20:10,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126637605] [2022-11-20 16:20:10,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 16:20:10,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:20:10,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:20:10,964 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:20:10,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 16:20:11,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 16:20:11,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:20:11,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-20 16:20:11,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:20:12,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:20:12,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:20:12,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:20:13,075 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:20:13,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:20:13,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:20:13,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 16:20:13,198 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 146 proven. 76 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-20 16:20:13,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:20:13,611 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| Int) (v_ArrVal_764 (Array Int Int)) (v_ArrVal_765 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_764) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| 4) |c_~#queue~0.offset|) v_ArrVal_765) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| (select .cse0 .cse1)))))) is different from false [2022-11-20 16:20:13,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:20:13,676 INFO L350 Elim1Store]: Elim1 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 54 treesize of output 44 [2022-11-20 16:20:13,688 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:20:13,689 INFO L350 Elim1Store]: Elim1 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 81 treesize of output 83 [2022-11-20 16:20:13,694 INFO L350 Elim1Store]: Elim1 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 78 treesize of output 70 [2022-11-20 16:20:13,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-20 16:20:13,749 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:20:13,749 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 48 [2022-11-20 16:20:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 131 proven. 76 refuted. 0 times theorem prover too weak. 53 trivial. 12 not checked. [2022-11-20 16:20:14,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126637605] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:20:14,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:20:14,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 37 [2022-11-20 16:20:14,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389103613] [2022-11-20 16:20:14,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:20:14,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 16:20:14,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:20:14,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 16:20:14,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1105, Unknown=1, NotChecked=68, Total=1332 [2022-11-20 16:20:14,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:14,329 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:20:14,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 13.891891891891891) internal successors, (514), 37 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:20:14,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:14,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:20:14,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:20:14,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:20:14,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:20:14,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:20:14,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-11-20 16:20:14,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-20 16:20:14,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:20:14,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:20:14,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:20:14,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-20 16:20:14,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:20:14,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:15,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:15,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:20:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:20:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:20:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:20:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:20:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-20 16:20:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 16:20:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:20:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:20:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:20:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-20 16:20:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:20:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:20:15,531 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-20 16:20:15,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 16:20:15,729 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:20:15,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:20:15,729 INFO L85 PathProgramCache]: Analyzing trace with hash -84225416, now seen corresponding path program 1 times [2022-11-20 16:20:15,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:20:15,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184287748] [2022-11-20 16:20:15,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:20:15,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:20:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:20:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 44 proven. 84 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-20 16:20:16,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:20:16,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184287748] [2022-11-20 16:20:16,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184287748] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:20:16,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452784825] [2022-11-20 16:20:16,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:20:16,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:20:16,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:20:16,891 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:20:16,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 16:20:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:20:17,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-20 16:20:17,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:20:18,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:20:18,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:20:18,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:20:18,923 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:20:18,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:20:18,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:20:19,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 16:20:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 44 proven. 84 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-20 16:20:19,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:20:19,646 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:20:19,646 INFO L350 Elim1Store]: Elim1 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 53 treesize of output 43 [2022-11-20 16:20:19,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:20:19,655 INFO L350 Elim1Store]: Elim1 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 78 treesize of output 80 [2022-11-20 16:20:19,663 INFO L350 Elim1Store]: Elim1 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 55 treesize of output 47 [2022-11-20 16:20:19,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-20 16:20:19,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:20:19,723 INFO L350 Elim1Store]: Elim1 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 49 treesize of output 45 [2022-11-20 16:20:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 44 proven. 84 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-20 16:20:20,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452784825] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:20:20,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:20:20,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 13] total 37 [2022-11-20 16:20:20,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287886568] [2022-11-20 16:20:20,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:20:20,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-20 16:20:20,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:20:20,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-20 16:20:20,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1245, Unknown=6, NotChecked=0, Total=1406 [2022-11-20 16:20:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:20,272 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:20:20,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 13.324324324324325) internal successors, (493), 38 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:20:20,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:20,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:20:20,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:20:20,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:20:20,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:20:20,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:20:20,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-11-20 16:20:20,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-20 16:20:20,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:20:20,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:20:20,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:20:20,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-11-20 16:20:20,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:20:20,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:20:20,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:21,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:21,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:20:21,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:20:21,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:20:21,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:20:21,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:20:21,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-20 16:20:21,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 16:20:21,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:20:21,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:20:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:20:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-20 16:20:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:20:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:20:21,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:20:21,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 16:20:22,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 16:20:22,157 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:20:22,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:20:22,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1981507569, now seen corresponding path program 3 times [2022-11-20 16:20:22,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:20:22,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415184651] [2022-11-20 16:20:22,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:20:22,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:20:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:20:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 174 proven. 85 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 16:20:28,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:20:28,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415184651] [2022-11-20 16:20:28,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415184651] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:20:28,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294480881] [2022-11-20 16:20:28,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 16:20:28,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:20:28,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:20:28,345 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:20:28,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 16:20:28,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-20 16:20:28,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:20:28,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 117 conjunts are in the unsatisfiable core [2022-11-20 16:20:28,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:20:29,150 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 16:20:29,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 16:20:29,237 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 16:20:29,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 16:20:29,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:20:29,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:20:30,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:20:30,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:20:30,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:20:31,007 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 16:20:31,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:20:31,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:20:31,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:20:31,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 16:20:31,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:20:31,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:20:32,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:20:32,202 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:20:32,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-20 16:20:32,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:20:32,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:20:32,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 16:20:32,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:20:32,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 16:20:33,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:20:33,266 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 16:20:33,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:20:33,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:20:33,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:20:33,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-20 16:20:33,457 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 174 proven. 85 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 16:20:33,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:20:33,932 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 Int) (v_ArrVal_1000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1000) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_1001) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| (select .cse0 .cse1)))))) is different from false [2022-11-20 16:20:34,009 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 Int) (v_ArrVal_1000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1000) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_1001) .cse1)))))) is different from false [2022-11-20 16:20:34,164 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 Int) (v_ArrVal_1000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1000) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_1001) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| (select .cse0 .cse1)))))) is different from false [2022-11-20 16:20:34,239 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 Int) (v_ArrVal_1000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int) (v_ArrVal_997 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_997) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1000) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_1001) .cse1)))))) is different from false [2022-11-20 16:20:34,324 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_1001 Int) (v_ArrVal_1000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int) (v_ArrVal_997 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_995)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_997) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1000) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_1001) .cse1) 20))))) is different from false [2022-11-20 16:20:34,345 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_1001 Int) (v_ArrVal_1000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int) (v_ArrVal_997 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_995)))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_997) .cse3 (+ (select .cse2 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1000) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_1001) .cse1) 20))))) is different from false [2022-11-20 16:20:34,383 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_1001 Int) (v_ArrVal_1000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int) (v_ArrVal_997 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_995)))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_997) .cse3 (+ (select .cse2 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1000) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_1001) .cse1) 20))))) is different from false [2022-11-20 16:20:49,051 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:20:49,051 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 654 treesize of output 434 [2022-11-20 16:20:49,077 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:20:49,078 INFO L350 Elim1Store]: Elim1 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 1164 treesize of output 1148 [2022-11-20 16:20:49,097 INFO L350 Elim1Store]: Elim1 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 1077 treesize of output 1045 [2022-11-20 16:20:49,113 INFO L350 Elim1Store]: Elim1 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 1136 treesize of output 1072 [2022-11-20 16:20:49,133 INFO L350 Elim1Store]: Elim1 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 963 treesize of output 931 [2022-11-20 16:20:49,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-20 16:20:50,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:20:50,715 INFO L350 Elim1Store]: Elim1 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 360 treesize of output 324 [2022-11-20 16:20:51,654 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:20:51,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 85 [2022-11-20 16:20:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 174 proven. 39 refuted. 1 times theorem prover too weak. 27 trivial. 45 not checked. [2022-11-20 16:20:51,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294480881] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:20:51,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:20:51,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 37] total 97 [2022-11-20 16:20:51,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319357259] [2022-11-20 16:20:51,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:20:51,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-11-20 16:20:51,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:20:51,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-11-20 16:20:51,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=900, Invalid=7093, Unknown=45, NotChecked=1274, Total=9312 [2022-11-20 16:20:51,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:51,912 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:20:51,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 5.752577319587629) internal successors, (558), 97 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:20:51,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:51,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:20:51,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:20:51,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:20:51,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:20:51,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:20:51,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-11-20 16:20:51,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-20 16:20:51,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:20:51,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:20:51,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:20:51,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-11-20 16:20:51,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:20:51,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:20:51,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:20:51,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:21:04,804 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse8 (select .cse7 .cse6))) (and (forall ((v_ArrVal_995 Int) (v_ArrVal_1001 Int) (v_ArrVal_1000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int) (v_ArrVal_997 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_995)))) (store (store .cse2 (+ 88 |c_~#queue~0.offset|) v_ArrVal_997) .cse1 (+ (select .cse2 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1000) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_1001) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| (select .cse0 .cse1)))))) (forall ((v_ArrVal_995 Int) (v_ArrVal_1001 Int) (v_ArrVal_1000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int) (v_ArrVal_997 Int)) (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse5 (store .cse7 (+ (* .cse8 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_995))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_997) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1000) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| (select .cse4 .cse1))) (not (= (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_1001) .cse1) 20))))) (forall ((v_ArrVal_1001 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| .cse8)) (not (= (select (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1001) .cse6) 20))))))) is different from false [2022-11-20 16:21:04,817 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (let ((.cse5 (select .cse4 .cse3))) (and (forall ((v_ArrVal_995 Int) (v_ArrVal_1001 Int) (v_ArrVal_1000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int) (v_ArrVal_997 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse2 (store .cse4 (+ (* .cse5 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_995))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_997) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1000) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_1001) .cse1) 20))))) (forall ((v_ArrVal_1001 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| .cse5)) (not (= (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1001) .cse3) 20))))))) is different from false [2022-11-20 16:21:04,838 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| .cse0)) (forall ((v_ArrVal_1001 Int)) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1001) .cse2) 20))))) (forall ((v_ArrVal_995 Int) (v_ArrVal_1001 Int) (v_ArrVal_1000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int) (v_ArrVal_997 Int)) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (store .cse1 (+ (* .cse0 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_995))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_997) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1000) |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| (select .cse3 .cse4))) (not (= (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_1001) .cse4) 20)))))))) is different from false [2022-11-20 16:21:04,867 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_995 Int) (v_ArrVal_1001 Int) (v_ArrVal_1000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int) (v_ArrVal_997 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store .cse4 .cse5 v_ArrVal_995))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_997) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1000) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_1001) .cse1) 20))))) (forall ((v_ArrVal_1001 Int)) (not (= (select (store .cse4 .cse5 v_ArrVal_1001) .cse3) 20))))) is different from false [2022-11-20 16:21:04,888 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (and (forall ((v_ArrVal_1001 Int) (v_ArrVal_1000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int) (v_ArrVal_997 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_997) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1000) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_1001) .cse1)))))) (not (= .cse4 20))))) is different from false [2022-11-20 16:21:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:21:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:21:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:21:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:21:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:21:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:21:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-20 16:21:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 16:21:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:21:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:21:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:21:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-20 16:21:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:21:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:21:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:21:04,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-20 16:21:04,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 16:21:05,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 16:21:05,118 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:21:05,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:21:05,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1831649785, now seen corresponding path program 2 times [2022-11-20 16:21:05,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:21:05,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753290477] [2022-11-20 16:21:05,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:21:05,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:21:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:21:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:21:13,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:21:13,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753290477] [2022-11-20 16:21:13,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753290477] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:21:13,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275650491] [2022-11-20 16:21:13,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 16:21:13,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:21:13,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:21:13,695 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:21:13,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_172c2f00-6fee-4cb0-a40b-dbbf1ef1dbb6/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 16:21:13,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 16:21:13,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:21:13,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 119 conjunts are in the unsatisfiable core [2022-11-20 16:21:13,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:21:14,152 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 16:21:14,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 16:21:14,230 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 16:21:14,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 16:21:14,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:21:14,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 16:21:15,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 16:21:15,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 16:21:16,437 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:21:16,460 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-20 16:21:16,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:21:16,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:21:16,928 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:21:16,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-20 16:21:17,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-20 16:21:17,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:21:17,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 16:21:18,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:21:18,493 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-20 16:21:18,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:21:18,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:21:18,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:21:18,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-20 16:21:19,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-20 16:21:19,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:21:19,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 16:21:20,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:21:20,474 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-20 16:21:20,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:21:20,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:21:20,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:21:20,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-20 16:21:21,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-20 16:21:21,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:21:21,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 16:21:22,289 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-20 16:21:22,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:21:22,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 16:21:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:21:22,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:21:23,189 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1125 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (not (<= v_ArrVal_1123 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)))))) is different from false [2022-11-20 16:21:23,276 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1125 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_1123)))) is different from false [2022-11-20 16:21:23,860 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1121 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1125 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1121) .cse1 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1121 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 16:21:27,283 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse0 .cse1))) (forall ((v_ArrVal_1121 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1125 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1118)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1121) .cse1 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ (select .cse2 .cse1) 1) v_ArrVal_1123) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1121) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse4 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))))) is different from false [2022-11-20 16:21:27,369 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1121 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118)) (.cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1121) .cse2 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1121) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))))) is different from false [2022-11-20 16:21:36,631 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1121 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1121) .cse4 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1121) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse3 .cse4))) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse2 .cse4))))))))) is different from false [2022-11-20 16:21:37,454 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1121 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1121) .cse4 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1121) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1115) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse5 .cse4))) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse6 .cse4)))))))))) is different from false [2022-11-20 16:21:41,813 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse7 .cse8))) (or (= .cse0 20) (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1121 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1114) .cse8 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse1 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1121) .cse4 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_1121) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse3 .cse4))) (< (+ .cse0 1) v_ArrVal_1115) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse5 .cse4))) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse2) 2147483647) (< (+ (select .cse1 .cse4) 1) v_ArrVal_1123) (not (<= v_ArrVal_1114 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))))))))) is different from false [2022-11-20 16:21:42,373 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse5 .cse9))) (or (= .cse0 20) (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1121 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse6 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1114) .cse9 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse1 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1121) .cse4 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_1121) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse3 .cse4))) (< (+ .cse0 1) v_ArrVal_1115) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1114) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse7 .cse4))) (< (select (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse2) 2147483647) (< (+ (select .cse1 .cse4) 1) v_ArrVal_1123))))))))))) is different from false [2022-11-20 16:21:42,511 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1112)) (.cse6 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1114) .cse9 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse1 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse5 .cse9)) (.cse3 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1121) .cse4 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1115) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1121) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse3 .cse4))) (= 20 .cse0) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse2) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1114) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse7 .cse4))) (< (+ (select .cse1 .cse4) 1) v_ArrVal_1123)))))))) is different from false [2022-11-20 16:21:42,609 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse0 .cse1))) (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1112)) (.cse9 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1114) .cse1 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (select .cse8 .cse1)) (.cse5 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_1121) .cse3 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse4 .cse3))) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse6) 2147483647) (< (+ (select .cse2 .cse6) 1) v_ArrVal_1121) (= .cse7 20) (< (+ .cse7 1) v_ArrVal_1115) (< (+ (select .cse8 .cse9) 1) v_ArrVal_1114) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse5 .cse3))))))))))))) is different from false [2022-11-20 16:21:42,784 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112)) (.cse8 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse7 .cse8 v_ArrVal_1114) .cse5 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1121) .cse1 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|)) (.cse6 (select .cse7 .cse5))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse2 .cse1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse4 .cse5))) (< (+ .cse6 1) v_ArrVal_1115) (< (+ (select .cse7 .cse8) 1) v_ArrVal_1114) (= .cse6 20) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1121) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse9 .cse1))))))))))) is different from false [2022-11-20 16:21:54,438 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1114) .cse1 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse3 (select .cse4 .cse1)) (.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1121) .cse1 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse2 .cse1))) (< (+ .cse3 1) v_ArrVal_1115) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1114) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse6 .cse1))) (= 20 .cse3) (< (+ (select .cse0 .cse5) 1) v_ArrVal_1121) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse7 .cse1)))))))))))) is different from false [2022-11-20 16:21:55,015 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_1114) .cse4 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse0 (select .cse6 .cse4)) (.cse1 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_1121) .cse4 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (= .cse0 20) (< (+ .cse0 1) v_ArrVal_1115) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse2) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1121) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse1 .cse4))) (not (<= v_ArrVal_1108 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse5 .cse4))) (< (+ (select .cse6 .cse2) 1) v_ArrVal_1114) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse7 .cse4)))))))))))) is different from false [2022-11-20 16:21:55,284 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_1114) .cse4 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse0 (select .cse6 .cse4)) (.cse1 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_1121) .cse4 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (= .cse0 20) (< (+ .cse0 1) v_ArrVal_1115) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_1108) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse2) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1121) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse1 .cse4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse5 .cse4))) (< (+ (select .cse6 .cse2) 1) v_ArrVal_1114) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse7 .cse4)))))))))))) is different from false [2022-11-20 16:21:55,381 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse7 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_1114) .cse6 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse2 (select .cse8 .cse6)) (.cse3 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_1121) .cse6 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1108) (= .cse2 20) (< (+ .cse2 1) v_ArrVal_1115) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse4) 2147483647) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1121) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse3 .cse6))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse7 .cse6))) (< (+ (select .cse8 .cse4) 1) v_ArrVal_1114) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse9 .cse6))))))))))))) is different from false [2022-11-20 16:21:55,960 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (v_ArrVal_1106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1106) .cse2 v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse9 (select .cse11 |c_~#queue~0.base|))) (let ((.cse6 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_1114) .cse5 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse0 (select .cse6 .cse5)) (.cse3 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_1121) .cse5 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1115) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1108) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse4) 2147483647) (= 20 .cse0) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse3 .cse5))) (< (+ (select .cse6 .cse4) 1) v_ArrVal_1114) (< (+ (select .cse7 .cse4) 1) v_ArrVal_1121) (< (+ (select .cse7 .cse5) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse8 .cse5))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse9 .cse5))) (not (<= v_ArrVal_1106 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))))))))) is different from false [2022-11-20 16:21:56,762 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (v_ArrVal_1106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse10 v_ArrVal_1106) .cse2 v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse9 (select .cse12 |c_~#queue~0.base|))) (let ((.cse6 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_1114) .cse5 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse0 (select .cse6 .cse5)) (.cse3 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_1121) .cse5 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1115) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1108) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse4) 2147483647) (= 20 .cse0) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse3 .cse5))) (< (+ (select .cse6 .cse4) 1) v_ArrVal_1114) (< (+ (select .cse7 .cse4) 1) v_ArrVal_1121) (< (+ (select .cse7 .cse5) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse8 .cse5))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse9 .cse5))) (< (+ (select .cse1 .cse10) 1) v_ArrVal_1106))))))))))) is different from false [2022-11-20 16:21:57,024 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1104 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (v_ArrVal_1106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1104)) (.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1106) .cse10 v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse7 (select .cse12 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1114) .cse5 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse4 (select .cse11 |c_~#queue~0.base|))) (let ((.cse6 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse8 (select .cse2 .cse5)) (.cse9 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_1121) .cse5 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1106) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1114) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse4 .cse5))) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse7 .cse5))) (= 20 .cse8) (< (+ (select .cse6 .cse3) 1) v_ArrVal_1121) (< (+ .cse8 1) v_ArrVal_1115) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse9 .cse5))) (< (+ (select .cse0 .cse10) 1) v_ArrVal_1108) (< (select (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse3) 2147483647))))))))))) is different from false [2022-11-20 16:21:57,202 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| Int)) (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1104 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (v_ArrVal_1106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse6 (store .cse13 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1104)) (.cse9 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse9 v_ArrVal_1106) .cse7 v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse10 (select .cse12 |c_~#queue~0.base|))) (let ((.cse3 (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1114) .cse2 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse1 (select .cse11 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse0 (select .cse3 .cse2)) (.cse8 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_1121) .cse2 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (= .cse0 20) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1114) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1121) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1108) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse8 .cse2))) (< (+ .cse0 1) v_ArrVal_1115) (< (+ (select .cse6 .cse9) 1) v_ArrVal_1106) (< (select (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse10 .cse2))) (< (+ (select .cse5 .cse2) 1) v_ArrVal_1123))))))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| (select .cse13 .cse7)))))) is different from false [2022-11-20 16:21:57,508 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1104 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (v_ArrVal_1106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse9 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| 4)) v_ArrVal_1104)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1106) .cse7 v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse0 (select .cse13 |c_~#queue~0.base|))) (let ((.cse11 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_1114) .cse1 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse8 (select .cse12 |c_~#queue~0.base|))) (let ((.cse4 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse6 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1121) .cse1 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|)) (.cse10 (select .cse11 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1106) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1121) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse5) 2147483647) (< (+ (select .cse2 .cse7) 1) v_ArrVal_1108) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse6 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse8 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| (select .cse9 .cse7))) (= .cse10 20) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1123) (< (+ (select .cse11 .cse5) 1) v_ArrVal_1114) (< (+ .cse10 1) v_ArrVal_1115)))))))))))) is different from false [2022-11-20 16:22:22,960 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1104 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (v_ArrVal_1106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1103))) (let ((.cse7 (select .cse12 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1104)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1106) .cse3 v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse9 (select .cse11 |c_~#queue~0.base|))) (let ((.cse5 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1114) .cse3 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse6 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse8 .cse1 v_ArrVal_1121) .cse3 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|)) (.cse4 (select .cse5 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1106) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse2 .cse3))) (= .cse4 20) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1108) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1114) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse6 .cse3))) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse1) 2147483647) (< (+ .cse4 1) v_ArrVal_1115) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| (select .cse7 .cse3))) (< (+ 1 (select .cse8 .cse3)) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse9 .cse3))) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1121))))))))))))) is different from false [2022-11-20 16:22:24,529 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1104 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (v_ArrVal_1106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1102) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1103))) (let ((.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1104)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_1106) .cse1 v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse4 (select .cse11 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1114) .cse1 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse6 (select .cse2 .cse1)) (.cse7 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse8 .cse3 v_ArrVal_1121) .cse1 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1114) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse4 .cse1))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1106) (< (+ .cse6 1) v_ArrVal_1115) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1108) (< (select (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse3) 2147483647) (< (+ (select .cse8 .cse3) 1) v_ArrVal_1121) (= .cse6 20) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse7 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse9 .cse1))) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1123))))))))))))) is different from false [2022-11-20 16:22:27,203 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1100 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1104 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (v_ArrVal_1106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_1100)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1102) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1103))) (let ((.cse2 (select .cse12 |c_~#queue~0.base|))) (let ((.cse7 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1104)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_1106) .cse1 v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse0 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_1114) .cse1 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse5 (select .cse9 .cse1)) (.cse3 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_1121) .cse1 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| (select .cse2 .cse1))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse4) 2147483647) (< (+ .cse5 1) v_ArrVal_1115) (not (<= v_ArrVal_1100 0)) (< (+ 1 (select .cse6 .cse1)) v_ArrVal_1123) (< (+ (select .cse7 .cse4) 1) v_ArrVal_1106) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1108) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse8 .cse1))) (= 20 .cse5) (< (+ (select .cse6 .cse4) 1) v_ArrVal_1121) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse3 .cse1))) (< (+ (select .cse9 .cse4) 1) v_ArrVal_1114))))))))))))) is different from false [2022-11-20 16:22:27,262 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:22:27,263 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 1675 treesize of output 1110 [2022-11-20 16:22:27,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:22:27,340 INFO L350 Elim1Store]: Elim1 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 4383 treesize of output 4369 [2022-11-20 16:22:27,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3275 treesize of output 3251 [2022-11-20 16:22:27,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1806 treesize of output 1678 [2022-11-20 16:22:27,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2704 treesize of output 2608 [2022-11-20 16:22:27,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1615 treesize of output 1603 [2022-11-20 16:22:27,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3059 treesize of output 2995 [2022-11-20 16:22:27,898 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:22:27,898 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2022-11-20 16:22:30,810 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:22:30,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1152 treesize of output 1168 [2022-11-20 16:23:02,200 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:23:02,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 85 [2022-11-20 16:23:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 48 refuted. 16 times theorem prover too weak. 0 trivial. 107 not checked. [2022-11-20 16:23:02,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275650491] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:23:02,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:23:02,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 53] total 143 [2022-11-20 16:23:02,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624042226] [2022-11-20 16:23:02,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:23:02,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 144 states [2022-11-20 16:23:02,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:23:02,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2022-11-20 16:23:02,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1839, Invalid=12369, Unknown=168, NotChecked=6216, Total=20592 [2022-11-20 16:23:02,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:23:02,568 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:23:02,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 144 states, 143 states have (on average 4.314685314685315) internal successors, (617), 144 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:23:02,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:23:02,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:23:02,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:23:02,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:23:02,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:23:02,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:23:02,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-11-20 16:23:02,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-20 16:23:02,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:23:02,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:23:02,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:23:02,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-11-20 16:23:02,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:23:02,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:23:02,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:23:02,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-11-20 16:23:02,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:23:16,035 WARN L233 SmtUtils]: Spent 6.67s on a formula simplification. DAG size of input: 147 DAG size of output: 118 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:24:08,294 WARN L233 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:24:39,564 WARN L233 SmtUtils]: Spent 9.08s on a formula simplification that was a NOOP. DAG size: 140 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:24:39,578 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 20)) (forall ((v_ArrVal_1001 Int) (v_ArrVal_1000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1000) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_1001) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| (select .cse0 .cse1))))))) is different from false [2022-11-20 16:25:19,265 WARN L233 SmtUtils]: Spent 16.06s on a formula simplification that was a NOOP. DAG size: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:26:18,020 WARN L233 SmtUtils]: Spent 7.77s on a formula simplification. DAG size of input: 143 DAG size of output: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:27:06,171 WARN L233 SmtUtils]: Spent 22.42s on a formula simplification that was a NOOP. DAG size: 151 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:27:06,178 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1001 Int) (v_ArrVal_1000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1000) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_1001) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| (select .cse0 .cse1)))))) (forall ((v_ArrVal_1001 Int) (v_ArrVal_1000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int)) (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1000) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| (select .cse4 .cse1))) (not (= 20 (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_1001) .cse1)))))))) is different from false