./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/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_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/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_d014e3ef-43ee-449a-84df-e966c4edcbce/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 4ef1ebb9985ad6dadbe7cf99c72a7d7cbd507bc2d179a6afec5353fae325d63f --- 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:22:15,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 16:22:15,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 16:22:15,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 16:22:15,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 16:22:15,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 16:22:15,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 16:22:15,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 16:22:15,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 16:22:15,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 16:22:15,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 16:22:16,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 16:22:16,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 16:22:16,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 16:22:16,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 16:22:16,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 16:22:16,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 16:22:16,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 16:22:16,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 16:22:16,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 16:22:16,013 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 16:22:16,015 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 16:22:16,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 16:22:16,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 16:22:16,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 16:22:16,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 16:22:16,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 16:22:16,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 16:22:16,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 16:22:16,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 16:22:16,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 16:22:16,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 16:22:16,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 16:22:16,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 16:22:16,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 16:22:16,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 16:22:16,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 16:22:16,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 16:22:16,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 16:22:16,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 16:22:16,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 16:22:16,038 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/config/svcomp-Overflow-32bit-GemCutter_Default.epf [2022-11-20 16:22:16,065 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 16:22:16,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 16:22:16,067 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 16:22:16,067 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 16:22:16,068 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 16:22:16,068 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 16:22:16,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 16:22:16,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 16:22:16,070 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 16:22:16,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 16:22:16,071 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 16:22:16,072 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 16:22:16,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 16:22:16,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 16:22:16,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 16:22:16,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 16:22:16,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 16:22:16,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 16:22:16,074 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 16:22:16,074 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 16:22:16,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 16:22:16,075 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 16:22:16,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 16:22:16,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 16:22:16,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 16:22:16,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 16:22:16,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 16:22:16,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 16:22:16,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 16:22:16,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 16:22:16,077 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 16:22:16,078 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-20 16:22:16,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 16:22:16,078 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 16:22:16,079 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-20 16:22:16,079 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-20 16:22:16,079 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 16:22:16,079 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-20 16:22:16,080 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-20 16:22:16,080 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_d014e3ef-43ee-449a-84df-e966c4edcbce/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_d014e3ef-43ee-449a-84df-e966c4edcbce/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 -> 4ef1ebb9985ad6dadbe7cf99c72a7d7cbd507bc2d179a6afec5353fae325d63f [2022-11-20 16:22:16,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 16:22:16,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 16:22:16,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 16:22:16,504 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 16:22:16,504 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 16:22:16,506 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/../../sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i [2022-11-20 16:22:20,184 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 16:22:20,624 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 16:22:20,624 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i [2022-11-20 16:22:20,649 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/data/dd95b99be/51a0b6ba7da14ecebdce725acbbf9496/FLAG50184a034 [2022-11-20 16:22:20,669 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/data/dd95b99be/51a0b6ba7da14ecebdce725acbbf9496 [2022-11-20 16:22:20,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 16:22:20,677 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 16:22:20,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 16:22:20,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 16:22:20,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 16:22:20,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:22:20" (1/1) ... [2022-11-20 16:22:20,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795c4939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:22:20, skipping insertion in model container [2022-11-20 16:22:20,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:22:20" (1/1) ... [2022-11-20 16:22:20,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 16:22:20,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 16:22:21,789 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_d014e3ef-43ee-449a-84df-e966c4edcbce/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i[76469,76482] [2022-11-20 16:22:21,876 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_d014e3ef-43ee-449a-84df-e966c4edcbce/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i[79042,79055] [2022-11-20 16:22:21,882 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_d014e3ef-43ee-449a-84df-e966c4edcbce/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i[79451,79464] [2022-11-20 16:22:21,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 16:22:21,936 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 16:22:22,021 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_d014e3ef-43ee-449a-84df-e966c4edcbce/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i[76469,76482] [2022-11-20 16:22:22,050 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_d014e3ef-43ee-449a-84df-e966c4edcbce/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i[79042,79055] [2022-11-20 16:22:22,058 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_d014e3ef-43ee-449a-84df-e966c4edcbce/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i[79451,79464] [2022-11-20 16:22:22,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 16:22:22,176 INFO L208 MainTranslator]: Completed translation [2022-11-20 16:22:22,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:22:22 WrapperNode [2022-11-20 16:22:22,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 16:22:22,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 16:22:22,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 16:22:22,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 16:22:22,186 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:22:22" (1/1) ... [2022-11-20 16:22:22,246 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:22:22" (1/1) ... [2022-11-20 16:22:22,342 INFO L138 Inliner]: procedures = 489, calls = 127, calls flagged for inlining = 45, calls inlined = 117, statements flattened = 1809 [2022-11-20 16:22:22,353 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 16:22:22,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 16:22:22,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 16:22:22,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 16:22:22,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:22:22" (1/1) ... [2022-11-20 16:22:22,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:22:22" (1/1) ... [2022-11-20 16:22:22,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:22:22" (1/1) ... [2022-11-20 16:22:22,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:22:22" (1/1) ... [2022-11-20 16:22:22,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:22:22" (1/1) ... [2022-11-20 16:22:22,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:22:22" (1/1) ... [2022-11-20 16:22:22,507 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:22:22" (1/1) ... [2022-11-20 16:22:22,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:22:22" (1/1) ... [2022-11-20 16:22:22,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 16:22:22,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 16:22:22,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 16:22:22,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 16:22:22,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:22:22" (1/1) ... [2022-11-20 16:22:22,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 16:22:22,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:22:22,573 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 16:22:22,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 16:22:22,679 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2022-11-20 16:22:22,679 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2022-11-20 16:22:22,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 16:22:22,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 16:22:22,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 16:22:22,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 16:22:22,680 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 16:22:22,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 16:22:22,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 16:22:22,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 16:22:22,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 16:22:22,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 16:22:22,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 16:22:22,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 16:22:22,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 16:22:22,687 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:22:23,202 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 16:22:23,204 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 16:22:25,871 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 16:22:26,398 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 16:22:26,399 INFO L300 CfgBuilder]: Removed 11 assume(true) statements. [2022-11-20 16:22:26,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:22:26 BoogieIcfgContainer [2022-11-20 16:22:26,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 16:22:26,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 16:22:26,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 16:22:26,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 16:22:26,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:22:20" (1/3) ... [2022-11-20 16:22:26,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442ee63e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:22:26, skipping insertion in model container [2022-11-20 16:22:26,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:22:22" (2/3) ... [2022-11-20 16:22:26,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442ee63e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:22:26, skipping insertion in model container [2022-11-20 16:22:26,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:22:26" (3/3) ... [2022-11-20 16:22:26,423 INFO L112 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-2.i [2022-11-20 16:22:26,436 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 16:22:26,449 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 16:22:26,450 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 90 error locations. [2022-11-20 16:22:26,450 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 16:22:26,769 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-20 16:22:26,873 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 16:22:26,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-20 16:22:26,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:22:26,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-20 16:22:26,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-20 16:22:26,972 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-20 16:22:26,993 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-20 16:22:27,011 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;@748264de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 16:22:27,012 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2022-11-20 16:22:27,093 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-20 16:22:27,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:22:27,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2027481313, now seen corresponding path program 1 times [2022-11-20 16:22:27,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:22:27,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460531050] [2022-11-20 16:22:27,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:22:27,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:22:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:22:28,013 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:22:28,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:22:28,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460531050] [2022-11-20 16:22:28,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460531050] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:22:28,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:22:28,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 16:22:28,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836016165] [2022-11-20 16:22:28,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:22:28,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 16:22:28,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:22:28,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 16:22:28,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 16:22:28,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:22:28,067 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:22:28,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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:22:28,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:22:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:22:28,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 16:22:28,180 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-20 16:22:28,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:22:28,181 INFO L85 PathProgramCache]: Analyzing trace with hash 549574883, now seen corresponding path program 1 times [2022-11-20 16:22:28,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:22:28,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929960361] [2022-11-20 16:22:28,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:22:28,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:22:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:22:28,407 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:22:28,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:22:28,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929960361] [2022-11-20 16:22:28,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929960361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:22:28,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:22:28,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 16:22:28,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851909852] [2022-11-20 16:22:28,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:22:28,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 16:22:28,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:22:28,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 16:22:28,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 16:22:28,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:22:28,413 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:22:28,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:22:28,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:22:28,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:22:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:22:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:22:28,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 16:22:28,476 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-20 16:22:28,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:22:28,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1409363284, now seen corresponding path program 1 times [2022-11-20 16:22:28,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:22:28,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528779245] [2022-11-20 16:22:28,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:22:28,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:22:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:22:28,839 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:22:28,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:22:28,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528779245] [2022-11-20 16:22:28,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528779245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:22:28,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:22:28,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 16:22:28,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423403117] [2022-11-20 16:22:28,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:22:28,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 16:22:28,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:22:28,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 16:22:28,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 16:22:28,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:22:28,854 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:22:28,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 27.0) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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:22:28,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:22:28,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:22:28,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:22:30,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:22:30,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:22:30,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:30,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 16:22:30,306 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-20 16:22:30,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:22:30,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1744625727, now seen corresponding path program 1 times [2022-11-20 16:22:30,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:22:30,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333740758] [2022-11-20 16:22:30,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:22:30,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:22:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:22:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:22:30,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:22:30,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333740758] [2022-11-20 16:22:30,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333740758] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:22:30,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322699267] [2022-11-20 16:22:30,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:22:30,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:22:30,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:22:30,594 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:22:30,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 16:22:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:22:30,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 16:22:30,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:22:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:22:30,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:22:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:22:31,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322699267] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:22:31,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:22:31,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 16:22:31,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040984065] [2022-11-20 16:22:31,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:22:31,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 16:22:31,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:22:31,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 16:22:31,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 16:22:31,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:22:31,012 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:22:31,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 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:22:31,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:22:31,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:22:31,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:31,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:22:31,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:22:31,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:22:31,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:31,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:22:31,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 16:22:31,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:22:31,339 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-20 16:22:31,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:22:31,340 INFO L85 PathProgramCache]: Analyzing trace with hash 977480084, now seen corresponding path program 1 times [2022-11-20 16:22:31,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:22:31,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928725278] [2022-11-20 16:22:31,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:22:31,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:22:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:22:31,684 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:22:31,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:22:31,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928725278] [2022-11-20 16:22:31,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928725278] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:22:31,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983442541] [2022-11-20 16:22:31,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:22:31,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:22:31,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:22:31,695 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:22:31,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 16:22:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:22:31,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 16:22:31,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:22:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:22:32,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 16:22:32,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983442541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:22:32,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 16:22:32,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-20 16:22:32,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201148162] [2022-11-20 16:22:32,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:22:32,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 16:22:32,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:22:32,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 16:22:32,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 16:22:32,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:22:32,021 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:22:32,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:22:32,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:22:32,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:22:32,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:32,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:22:32,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:22:32,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:22:32,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:22:32,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:32,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 16:22:32,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:22:32,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 16:22:32,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:22:32,376 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-20 16:22:32,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:22:32,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1000848082, now seen corresponding path program 1 times [2022-11-20 16:22:32,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:22:32,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610547384] [2022-11-20 16:22:32,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:22:32,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:22:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:22:32,584 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 16:22:32,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:22:32,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610547384] [2022-11-20 16:22:32,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610547384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:22:32,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:22:32,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 16:22:32,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3042285] [2022-11-20 16:22:32,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:22:32,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 16:22:32,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:22:32,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 16:22:32,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 16:22:32,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:22:32,591 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:22:32,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:22:32,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:22:32,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:22:32,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:32,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-20 16:22:32,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:22:32,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:22:32,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:22:32,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:22:32,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:32,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:22:32,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:22:32,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:32,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 16:22:32,759 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-20 16:22:32,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:22:32,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2106362471, now seen corresponding path program 2 times [2022-11-20 16:22:32,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:22:32,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071442704] [2022-11-20 16:22:32,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:22:32,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:22:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:22:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-20 16:22:32,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:22:32,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071442704] [2022-11-20 16:22:32,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071442704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:22:32,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:22:32,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 16:22:32,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515776790] [2022-11-20 16:22:32,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:22:32,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 16:22:32,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:22:32,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 16:22:32,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 16:22:32,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:22:32,991 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:22:32,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 33.0) internal successors, (99), 4 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:22:32,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:22:32,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:22:32,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:32,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:22:32,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:22:32,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:32,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:22:33,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:22:33,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:22:33,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:33,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:22:33,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:22:33,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:33,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:33,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 16:22:33,473 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-20 16:22:33,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:22:33,474 INFO L85 PathProgramCache]: Analyzing trace with hash 287540226, now seen corresponding path program 1 times [2022-11-20 16:22:33,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:22:33,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245043604] [2022-11-20 16:22:33,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:22:33,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:22:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:22:33,734 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-20 16:22:33,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:22:33,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245043604] [2022-11-20 16:22:33,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245043604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:22:33,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:22:33,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 16:22:33,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777500746] [2022-11-20 16:22:33,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:22:33,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 16:22:33,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:22:33,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 16:22:33,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 16:22:33,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:22:33,741 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:22:33,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:22:33,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:22:33,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:22:33,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:33,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:22:33,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:22:33,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:33,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:33,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:22:34,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:22:34,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:22:34,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:34,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:22:34,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:22:34,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:34,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:34,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:22:34,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 16:22:34,498 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-20 16:22:34,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:22:34,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1348864023, now seen corresponding path program 1 times [2022-11-20 16:22:34,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:22:34,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578218805] [2022-11-20 16:22:34,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:22:34,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:22:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:22:35,064 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-20 16:22:35,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:22:35,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578218805] [2022-11-20 16:22:35,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578218805] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:22:35,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818924565] [2022-11-20 16:22:35,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:22:35,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:22:35,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:22:35,071 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:22:35,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 16:22:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:22:35,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 16:22:35,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:22:35,621 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 16:22:35,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:22:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 16:22:35,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818924565] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:22:35,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:22:35,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 11 [2022-11-20 16:22:35,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234164074] [2022-11-20 16:22:35,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:22:35,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 16:22:35,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:22:35,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 16:22:35,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-20 16:22:35,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:22:35,794 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:22:35,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.90909090909091) internal successors, (307), 11 states have internal predecessors, (307), 0 states have call successors, (0), 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:22:35,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:22:35,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:22:35,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:35,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:22:35,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:22:35,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:35,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:35,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:22:35,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:22:36,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:22:36,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:22:36,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:36,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:22:36,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:22:36,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:36,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:22:36,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:22:36,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 16:22:36,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 16:22:36,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:22:36,602 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-20 16:22:36,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:22:36,602 INFO L85 PathProgramCache]: Analyzing trace with hash -624558840, now seen corresponding path program 1 times [2022-11-20 16:22:36,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:22:36,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601504273] [2022-11-20 16:22:36,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:22:36,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:22:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:23:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 16:23:27,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:23:27,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601504273] [2022-11-20 16:23:27,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601504273] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:23:27,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879112657] [2022-11-20 16:23:27,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:23:27,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:23:27,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:23:27,779 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:23:27,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 16:23:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:23:28,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-20 16:23:28,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:23:28,742 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 16:23:28,743 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:23:30,130 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:23:30,408 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:23:31,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:23:31,359 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 21 treesize of output 20 [2022-11-20 16:23:31,955 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:23:32,175 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:23:32,403 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:23:32,956 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:23:33,326 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:23:35,237 INFO L321 Elim1Store]: treesize reduction 23, result has 54.0 percent of original size [2022-11-20 16:23:35,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 120 [2022-11-20 16:23:35,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 75 [2022-11-20 16:23:35,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 69 [2022-11-20 16:23:35,319 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 16:23:35,320 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 1 case distinctions, treesize of input 13 treesize of output 1 [2022-11-20 16:23:35,332 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 16:23:35,333 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 23 treesize of output 7 [2022-11-20 16:23:35,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 11 [2022-11-20 16:23:35,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 21 [2022-11-20 16:23:35,767 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:23:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 16:23:36,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:23:37,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:23:37,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 106 [2022-11-20 16:23:37,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:23:37,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 100 [2022-11-20 16:23:38,686 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 5 treesize of output 3 [2022-11-20 16:23:41,033 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse0 (select (select .cse1 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= .cse0 0)) (= .cse0 (select (select .cse1 |c_~#q~0.base|) .cse2)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (not (= (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse3 |c_~#q~0.base| (store (select .cse3 |c_~#q~0.base|) .cse2 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647))))))) is different from false [2022-11-20 16:23:41,284 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647)) (not (= (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse2 (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (= .cse2 (select (select .cse3 |c_~#q~0.base|) .cse1)) (not (= .cse2 0)))))))) is different from false [2022-11-20 16:23:41,320 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse2 (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse0 |c_~#q~0.base|) .cse1) .cse2) (not (= .cse2 0)))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (not (= (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse3 |c_~#q~0.base| (store (select .cse3 |c_~#q~0.base|) .cse1 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647))))))) is different from false [2022-11-20 16:23:41,372 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647)) (not (= (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse2 (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= .cse2 0)) (= (select (select .cse3 |c_~#q~0.base|) .cse1) .cse2))))))) is different from false [2022-11-20 16:23:41,578 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_930) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse2 (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse0 |c_~#q~0.base|) .cse1) .cse2) (not (= .cse2 0)))))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_930) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse3 |c_~#q~0.base| (store (select .cse3 |c_~#q~0.base|) .cse1 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647)) (not (= (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2022-11-20 16:23:41,611 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_930) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (not (= (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647))))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_930) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse2 (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (= .cse2 (select (select .cse3 |c_~#q~0.base|) .cse1)) (not (= .cse2 0)))))))) is different from false [2022-11-20 16:23:41,846 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_929) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647)) (not (= (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_929) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse2 (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (= .cse2 (select (select .cse3 |c_~#q~0.base|) .cse1)) (not (= .cse2 0)))))))) is different from false [2022-11-20 16:23:41,882 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_929) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse2 (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse0 |c_~#q~0.base|) .cse1) .cse2) (not (= 0 .cse2)))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_929) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse3 |c_~#q~0.base| (store (select .cse3 |c_~#q~0.base|) .cse1 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647)) (not (= 0 (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0)))))))) is different from false [2022-11-20 16:23:42,138 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_928 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_928) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647)) (not (= (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_928 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_928) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse2 (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= .cse2 0)) (= (select (select .cse3 |c_~#q~0.base|) .cse1) .cse2))))))) is different from false [2022-11-20 16:23:42,177 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_928 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_928) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse0 (select (select .cse1 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= .cse0 0)) (= (select (select .cse1 |c_~#q~0.base|) .cse2) .cse0))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_928 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_928) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (not (= (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse3 |c_~#q~0.base| (store (select .cse3 |c_~#q~0.base|) .cse2 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647))))))) is different from false [2022-11-20 16:23:42,467 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_927 Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base| (store .cse2 |c_ULTIMATE.start_atomic_exchange_~obj#1.offset| v_ArrVal_927)) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647)) (not (= (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_927 Int)) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base| (store .cse2 |c_ULTIMATE.start_atomic_exchange_~obj#1.offset| v_ArrVal_927)) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse3 (select (select .cse4 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (= .cse3 (select (select .cse4 |c_~#q~0.base|) .cse1)) (not (= .cse3 0)))))))) is different from false [2022-11-20 16:23:54,238 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|)) (.cse4 (select |c_#memory_int| |c_~#q~0.base|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_927 Int) (|v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#q~0.base| (store .cse4 |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| v_ArrVal_927)) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse0 (select (select .cse1 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= .cse0 0)) (= .cse0 (select (select .cse1 |c_~#q~0.base|) .cse2)) (< |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| .cse3))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_927 Int) (|v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| Int) (v_ArrVal_934 Int)) (let ((.cse5 (store (store (store |c_#memory_int| |c_~#q~0.base| (store .cse4 |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| v_ArrVal_927)) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (not (= (select (select .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0)) (< |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| .cse3) (< (select (select (store .cse5 |c_~#q~0.base| (store (select .cse5 |c_~#q~0.base|) .cse2 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647)))))) is different from false [2022-11-20 16:23:54,362 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 32 |c_~#q~0.offset|)) (.cse0 (+ |c_~#q~0.offset| 36)) (.cse4 (select |c_#memory_int| |c_~#q~0.base|)) (.cse5 (+ 104 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_927 Int) (|v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| Int) (v_ArrVal_924 Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#q~0.base| (store (store .cse4 .cse5 v_ArrVal_924) |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| v_ArrVal_927)) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse3 (select (select .cse1 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (< |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| .cse0) (= (select (select .cse1 |c_~#q~0.base|) .cse2) .cse3) (not (= .cse3 0)))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_927 Int) (|v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| Int) (v_ArrVal_924 Int) (v_ArrVal_934 Int)) (let ((.cse6 (store (store (store |c_#memory_int| |c_~#q~0.base| (store (store .cse4 .cse5 v_ArrVal_924) |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| v_ArrVal_927)) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (< (select (select (store .cse6 |c_~#q~0.base| (store (select .cse6 |c_~#q~0.base|) .cse2 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647) (< |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| .cse0) (not (= (select (select .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2022-11-20 16:23:54,952 INFO L321 Elim1Store]: treesize reduction 57, result has 49.1 percent of original size [2022-11-20 16:23:54,953 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 3 case distinctions, treesize of input 127 treesize of output 94 [2022-11-20 16:23:55,065 INFO L321 Elim1Store]: treesize reduction 4, result has 93.8 percent of original size [2022-11-20 16:23:55,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1438 treesize of output 1319 [2022-11-20 16:23:55,113 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:23:55,115 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 1224 treesize of output 1034 [2022-11-20 16:23:55,151 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:23:55,152 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 1024 treesize of output 934 [2022-11-20 16:24:01,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:24:01,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:24:01,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:24:01,916 INFO L321 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-20 16:24:01,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 69 [2022-11-20 16:24:01,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:24:01,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:24:01,958 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 16:24:01,959 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 1 case distinctions, treesize of input 663 treesize of output 623 [2022-11-20 16:24:01,989 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 16:24:01,989 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 811 treesize of output 765 [2022-11-20 16:24:02,010 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 374 treesize of output 364 [2022-11-20 16:24:02,026 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 744 treesize of output 724 [2022-11-20 16:24:06,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:24:06,020 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 38 treesize of output 78 [2022-11-20 16:24:06,300 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 40 not checked. [2022-11-20 16:24:06,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879112657] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:24:06,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:24:06,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 35, 41] total 113 [2022-11-20 16:24:06,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018189526] [2022-11-20 16:24:06,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:24:06,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 113 states [2022-11-20 16:24:06,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:24:06,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2022-11-20 16:24:06,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=9164, Unknown=215, NotChecked=2704, Total=12656 [2022-11-20 16:24:06,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:06,317 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:24:06,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 113 states, 113 states have (on average 3.9911504424778763) internal successors, (451), 113 states have internal predecessors, (451), 0 states have call successors, (0), 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:24:06,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:24:06,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:24:06,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:24:06,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:24:06,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:24:06,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:24:06,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:24:06,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:24:06,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-20 16:24:06,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:40,239 WARN L233 SmtUtils]: Spent 21.11s on a formula simplification. DAG size of input: 185 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:25:08,867 WARN L233 SmtUtils]: Spent 6.45s on a formula simplification. DAG size of input: 120 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:25:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:25:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:25:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:25:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:25:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:25:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:25:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:25:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:25:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 16:25:58,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-20 16:25:58,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-20 16:25:59,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 16:25:59,043 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-20 16:25:59,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:25:59,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1090821140, now seen corresponding path program 1 times [2022-11-20 16:25:59,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:25:59,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440747555] [2022-11-20 16:25:59,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:25:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:25:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:25:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-11-20 16:25:59,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:25:59,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440747555] [2022-11-20 16:25:59,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440747555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:25:59,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:25:59,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 16:25:59,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824018622] [2022-11-20 16:25:59,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:25:59,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 16:25:59,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:25:59,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 16:25:59,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 16:25:59,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:25:59,367 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:25:59,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 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:25:59,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:25:59,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:25:59,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:25:59,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:25:59,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:25:59,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:25:59,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:25:59,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:25:59,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-20 16:25:59,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-11-20 16:25:59,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:26:04,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:26:04,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:26:04,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:26:04,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:26:04,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:26:04,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:26:04,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:26:04,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:26:04,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 16:26:04,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-20 16:26:04,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:26:04,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 16:26:04,924 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-20 16:26:04,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:26:04,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1664852949, now seen corresponding path program 1 times [2022-11-20 16:26:04,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:26:04,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211528486] [2022-11-20 16:26:04,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:26:04,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:26:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:28:18,842 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 16:28:18,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:28:18,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211528486] [2022-11-20 16:28:18,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211528486] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:28:18,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270828348] [2022-11-20 16:28:18,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:28:18,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:28:18,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:28:18,847 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:28:18,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d014e3ef-43ee-449a-84df-e966c4edcbce/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 16:28:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:28:19,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 182 conjunts are in the unsatisfiable core [2022-11-20 16:28:19,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:28:20,409 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 16:28:20,409 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:28:23,537 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:28:24,092 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:28:26,718 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:28:28,301 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:28:28,479 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:28:28,672 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:28:29,457 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:28:29,940 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:28:33,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:28:33,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:28:33,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:28:33,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 122 [2022-11-20 16:28:33,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 87 [2022-11-20 16:28:33,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 81 [2022-11-20 16:28:33,299 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-20 16:28:33,300 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 3 case distinctions, treesize of input 60 treesize of output 45 [2022-11-20 16:28:33,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 9 treesize of output 7 [2022-11-20 16:28:33,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:28:33,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:28:33,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2022-11-20 16:28:38,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:28:38,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:28:38,717 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:28:38,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-20 16:28:43,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 94 [2022-11-20 16:28:43,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 88 [2022-11-20 16:28:43,166 INFO L321 Elim1Store]: treesize reduction 63, result has 41.1 percent of original size [2022-11-20 16:28:43,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 93 treesize of output 135 [2022-11-20 16:28:43,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 21 [2022-11-20 16:28:43,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-11-20 16:28:43,403 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 16:28:43,404 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 1 case distinctions, treesize of input 13 treesize of output 1 [2022-11-20 16:28:44,896 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:28:44,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 189 treesize of output 193 [2022-11-20 16:28:44,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 164 [2022-11-20 16:28:44,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 161 [2022-11-20 16:28:44,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 155 [2022-11-20 16:28:44,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 152 [2022-11-20 16:28:45,043 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 7 treesize of output 5 [2022-11-20 16:28:45,091 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 7 treesize of output 5 [2022-11-20 16:28:45,143 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 11 treesize of output 7 [2022-11-20 16:28:45,213 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 16 treesize of output 10 [2022-11-20 16:28:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 16:28:46,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:28:48,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:28:48,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 106 [2022-11-20 16:28:48,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:28:48,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 100 [2022-11-20 16:28:51,767 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 7 treesize of output 5 [2022-11-20 16:29:09,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:29:09,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 115 [2022-11-20 16:29:09,413 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:29:09,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 109 [2022-11-20 16:29:50,535 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#q~0.offset| 36)) (.cse4 (+ 32 |c_~#q~0.offset|))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse6 (select .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse3 (store .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse6 0 (select (select .cse5 |c_~#q~0.base|) .cse4))))) (let ((.cse0 (select .cse3 |c_~#q~0.base|))) (let ((.cse2 (select (select (store .cse3 |c_~#q~0.base| (store .cse0 .cse4 v_ArrVal_1293)) v_subst_1) 0))) (or (= (select .cse0 .cse1) .cse2) (not (= .cse2 0))))))) (not (= (select .cse6 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse11 (select .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse9 (select (select .cse10 |c_~#q~0.base|) .cse4))) (let ((.cse7 (store .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse11 0 .cse9)))) (let ((.cse8 (store (select .cse7 |c_~#q~0.base|) .cse4 v_ArrVal_1293))) (or (not (= (select (select (store .cse7 |c_~#q~0.base| .cse8) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse7 |c_~#q~0.base| (store .cse8 .cse1 v_ArrVal_1300)) v_subst_2) 0) (+ .cse9 1)))))))) (not (= (select .cse11 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse12 (select .cse14 |c_~#q~0.base|)) (.cse13 (select (select .cse14 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= (select .cse12 .cse4) .cse13)) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse15 (store .cse12 .cse4 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse14 |c_~#q~0.base| (store .cse15 .cse1 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse14 |c_~#q~0.base| (store .cse12 .cse4 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1))) (not (= (select (select (store .cse14 |c_~#q~0.base| .cse15) v_subst_2) 0) 0))))) (not (= .cse13 0)))))))) is different from false [2022-11-20 16:29:51,429 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse5 (+ 32 |c_~#q~0.offset|))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse0 (select .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse0 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse4 (select (select .cse6 |c_~#q~0.base|) .cse5))) (let ((.cse1 (store .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse0 0 .cse4)))) (let ((.cse2 (store (select .cse1 |c_~#q~0.base|) .cse5 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse1 |c_~#q~0.base| (store .cse2 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ .cse4 1))) (not (= (select (select (store .cse1 |c_~#q~0.base| .cse2) v_subst_2) 0) 0))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse7 (select .cse11 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse7 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse10 (store .cse11 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse7 0 (select (select .cse11 |c_~#q~0.base|) .cse5))))) (let ((.cse9 (select .cse10 |c_~#q~0.base|))) (let ((.cse8 (select (select (store .cse10 |c_~#q~0.base| (store .cse9 .cse5 v_ArrVal_1293)) v_subst_1) 0))) (or (not (= .cse8 0)) (= .cse8 (select .cse9 .cse3))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse12 (select (select .cse14 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0)) (.cse13 (select .cse14 |c_~#q~0.base|))) (or (not (= .cse12 0)) (not (= .cse12 (select .cse13 .cse5))) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse15 (store .cse13 .cse5 v_ArrVal_1293))) (or (not (= (select (select (store .cse14 |c_~#q~0.base| .cse15) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse14 |c_~#q~0.base| (store .cse15 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse14 |c_~#q~0.base| (store .cse13 .cse5 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))))))))) is different from false [2022-11-20 16:29:51,515 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse5 (+ 32 |c_~#q~0.offset|))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse0 (select .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse0 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse4 (select (select .cse6 |c_~#q~0.base|) .cse5))) (let ((.cse1 (store .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse0 0 .cse4)))) (let ((.cse2 (store (select .cse1 |c_~#q~0.base|) .cse5 v_ArrVal_1293))) (or (not (= (select (select (store .cse1 |c_~#q~0.base| .cse2) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse1 |c_~#q~0.base| (store .cse2 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ .cse4 1)))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse10 (select .cse8 |c_~#q~0.base|)) (.cse7 (select (select .cse8 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= .cse7 0)) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1293))) (or (not (= (select (select (store .cse8 |c_~#q~0.base| .cse9) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse8 |c_~#q~0.base| (store .cse9 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse8 |c_~#q~0.base| (store .cse10 .cse5 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))) (not (= (select .cse10 .cse5) .cse7)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse11 (select .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse11 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse14 (store .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse11 0 (select (select .cse15 |c_~#q~0.base|) .cse5))))) (let ((.cse13 (select .cse14 |c_~#q~0.base|))) (let ((.cse12 (select (select (store .cse14 |c_~#q~0.base| (store .cse13 .cse5 v_ArrVal_1293)) v_subst_1) 0))) (or (= .cse12 (select .cse13 .cse3)) (not (= .cse12 0))))))))))))) is different from false [2022-11-20 16:29:51,682 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse4 (+ 32 |c_~#q~0.offset|))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse6 (select .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse3 (select (select .cse5 |c_~#q~0.base|) .cse4))) (let ((.cse0 (store .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse6 0 .cse3)))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse4 v_ArrVal_1293))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ .cse3 1)))))))) (not (= (select .cse6 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse11 (select .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse9 (store .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse11 0 (select (select .cse10 |c_~#q~0.base|) .cse4))))) (let ((.cse8 (select .cse9 |c_~#q~0.base|))) (let ((.cse7 (select (select (store .cse9 |c_~#q~0.base| (store .cse8 .cse4 v_ArrVal_1293)) v_subst_1) 0))) (or (not (= 0 .cse7)) (= (select .cse8 .cse2) .cse7)))))) (not (= (select .cse11 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse12 (select (select .cse14 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0)) (.cse13 (select .cse14 |c_~#q~0.base|))) (or (not (= .cse12 0)) (not (= (select .cse13 .cse4) .cse12)) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse15 (store .cse13 .cse4 v_ArrVal_1293))) (or (not (= (select (select (store .cse14 |c_~#q~0.base| .cse15) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse14 |c_~#q~0.base| (store .cse15 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse14 |c_~#q~0.base| (store .cse13 .cse4 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))))))))) is different from false [2022-11-20 16:29:52,415 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse5 (+ 32 |c_~#q~0.offset|))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1282) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse0 (select .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse0 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse4 (store .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse0 0 (select (select .cse6 |c_~#q~0.base|) .cse5))))) (let ((.cse1 (select .cse4 |c_~#q~0.base|))) (let ((.cse3 (select (select (store .cse4 |c_~#q~0.base| (store .cse1 .cse5 v_ArrVal_1293)) v_subst_1) 0))) (or (= (select .cse1 .cse2) .cse3) (not (= .cse3 0))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1282) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse7 (select .cse11 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse7 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse10 (select (select .cse11 |c_~#q~0.base|) .cse5))) (let ((.cse8 (store .cse11 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse7 0 .cse10)))) (let ((.cse9 (store (select .cse8 |c_~#q~0.base|) .cse5 v_ArrVal_1293))) (or (not (= (select (select (store .cse8 |c_~#q~0.base| .cse9) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse8 |c_~#q~0.base| (store .cse9 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ .cse10 1)))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1282) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse12 (select .cse14 |c_~#q~0.base|)) (.cse13 (select (select .cse14 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= (select .cse12 .cse5) .cse13)) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse15 (store .cse12 .cse5 v_ArrVal_1293))) (or (not (= (select (select (store .cse14 |c_~#q~0.base| .cse15) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse14 |c_~#q~0.base| (store .cse15 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse14 |c_~#q~0.base| (store .cse12 .cse5 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))) (not (= .cse13 0)))))))) is different from false [2022-11-20 16:29:52,528 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse5 (+ 32 |c_~#q~0.offset|))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1282) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse0 (select .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse0 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse4 (select (select .cse6 |c_~#q~0.base|) .cse5))) (let ((.cse1 (store .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse0 0 .cse4)))) (let ((.cse2 (store (select .cse1 |c_~#q~0.base|) .cse5 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse1 |c_~#q~0.base| (store .cse2 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ .cse4 1))) (not (= (select (select (store .cse1 |c_~#q~0.base| .cse2) v_subst_2) 0) 0))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1282) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse10 (select (select .cse7 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0)) (.cse9 (select .cse7 |c_~#q~0.base|))) (or (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse7 |c_~#q~0.base| (store .cse8 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse7 |c_~#q~0.base| (store .cse9 .cse5 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1))) (not (= (select (select (store .cse7 |c_~#q~0.base| .cse8) v_subst_2) 0) 0))))) (not (= .cse10 0)) (not (= .cse10 (select .cse9 .cse5))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1282) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse11 (select .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse11 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse14 (store .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse11 0 (select (select .cse15 |c_~#q~0.base|) .cse5))))) (let ((.cse13 (select .cse14 |c_~#q~0.base|))) (let ((.cse12 (select (select (store .cse14 |c_~#q~0.base| (store .cse13 .cse5 v_ArrVal_1293)) v_subst_1) 0))) (or (= .cse12 (select .cse13 .cse3)) (not (= .cse12 0))))))))))))) is different from false [2022-11-20 16:29:53,349 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse4 (+ 32 |c_~#q~0.offset|))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1281) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse6 (select .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse3 (select (select .cse5 |c_~#q~0.base|) .cse4))) (let ((.cse0 (store .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse6 0 .cse3)))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse4 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ .cse3 1))) (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) v_subst_2) 0) 0))))))) (not (= (select .cse6 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1281) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse11 (select .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse9 (store .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse11 0 (select (select .cse10 |c_~#q~0.base|) .cse4))))) (let ((.cse7 (select .cse9 |c_~#q~0.base|))) (let ((.cse8 (select (select (store .cse9 |c_~#q~0.base| (store .cse7 .cse4 v_ArrVal_1293)) v_subst_1) 0))) (or (= (select .cse7 .cse2) .cse8) (not (= 0 .cse8))))))) (not (= (select .cse11 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1281) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse12 (select .cse14 |c_~#q~0.base|)) (.cse13 (select (select .cse14 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= (select .cse12 .cse4) .cse13)) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse15 (store .cse12 .cse4 v_ArrVal_1293))) (or (not (= (select (select (store .cse14 |c_~#q~0.base| .cse15) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse14 |c_~#q~0.base| (store .cse15 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse14 |c_~#q~0.base| (store .cse12 .cse4 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))) (not (= .cse13 0)))))))) is different from false [2022-11-20 16:29:53,470 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse4 (+ 32 |c_~#q~0.offset|))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1281) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse6 (select .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse3 (select (select .cse5 |c_~#q~0.base|) .cse4))) (let ((.cse0 (store .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse6 0 .cse3)))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse4 v_ArrVal_1293))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ .cse3 1)))))))) (not (= (select .cse6 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1281) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse10 (select (select .cse7 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0)) (.cse9 (select .cse7 |c_~#q~0.base|))) (or (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse8 (store .cse9 .cse4 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse7 |c_~#q~0.base| (store .cse8 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse7 |c_~#q~0.base| (store .cse9 .cse4 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1))) (not (= (select (select (store .cse7 |c_~#q~0.base| .cse8) v_subst_2) 0) 0))))) (not (= .cse10 0)) (not (= .cse10 (select .cse9 .cse4))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1281) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse11 (select .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse11 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse14 (store .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse11 0 (select (select .cse15 |c_~#q~0.base|) .cse4))))) (let ((.cse13 (select .cse14 |c_~#q~0.base|))) (let ((.cse12 (select (select (store .cse14 |c_~#q~0.base| (store .cse13 .cse4 v_ArrVal_1293)) v_subst_1) 0))) (or (not (= .cse12 0)) (= .cse12 (select .cse13 .cse2))))))))))))) is different from false [2022-11-20 16:29:54,457 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_1280 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1280) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse0 (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0)) (.cse1 (select .cse3 |c_~#q~0.base|))) (or (not (= .cse0 0)) (not (= .cse0 (select .cse1 .cse2))) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse4 (store .cse1 .cse2 v_ArrVal_1293))) (or (not (= (select (select (store .cse3 |c_~#q~0.base| .cse4) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse3 |c_~#q~0.base| (store .cse4 .cse5 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse3 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))))))) (forall ((v_ArrVal_1280 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1280) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse6 (select .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse6 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse9 (select (select .cse10 |c_~#q~0.base|) .cse2))) (let ((.cse7 (store .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse6 0 .cse9)))) (let ((.cse8 (store (select .cse7 |c_~#q~0.base|) .cse2 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse7 |c_~#q~0.base| (store .cse8 .cse5 v_ArrVal_1300)) v_subst_2) 0) (+ .cse9 1))) (not (= (select (select (store .cse7 |c_~#q~0.base| .cse8) v_subst_2) 0) 0))))))))))) (forall ((v_ArrVal_1280 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1280) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse11 (select .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse11 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse14 (store .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse11 0 (select (select .cse15 |c_~#q~0.base|) .cse2))))) (let ((.cse12 (select .cse14 |c_~#q~0.base|))) (let ((.cse13 (select (select (store .cse14 |c_~#q~0.base| (store .cse12 .cse2 v_ArrVal_1293)) v_subst_1) 0))) (or (= (select .cse12 .cse5) .cse13) (not (= .cse13 0))))))))))))) is different from false [2022-11-20 16:29:54,564 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse5 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_1280 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1280) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse0 (select .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse0 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse4 (select (select .cse6 |c_~#q~0.base|) .cse5))) (let ((.cse1 (store .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse0 0 .cse4)))) (let ((.cse2 (store (select .cse1 |c_~#q~0.base|) .cse5 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse1 |c_~#q~0.base| (store .cse2 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ .cse4 1))) (not (= (select (select (store .cse1 |c_~#q~0.base| .cse2) v_subst_2) 0) 0))))))))))) (forall ((v_ArrVal_1280 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1280) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse11 (select .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse9 (store .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse11 0 (select (select .cse10 |c_~#q~0.base|) .cse5))))) (let ((.cse8 (select .cse9 |c_~#q~0.base|))) (let ((.cse7 (select (select (store .cse9 |c_~#q~0.base| (store .cse8 .cse5 v_ArrVal_1293)) v_subst_1) 0))) (or (not (= .cse7 0)) (= .cse7 (select .cse8 .cse3))))))) (not (= (select .cse11 0) 0)))))) (forall ((v_ArrVal_1280 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1280) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse14 (select .cse12 |c_~#q~0.base|)) (.cse15 (select (select .cse12 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse13 (store .cse14 .cse5 v_ArrVal_1293))) (or (not (= (select (select (store .cse12 |c_~#q~0.base| .cse13) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse12 |c_~#q~0.base| (store .cse13 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse12 |c_~#q~0.base| (store .cse14 .cse5 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))) (not (= (select .cse14 .cse5) .cse15)) (not (= .cse15 0)))))))) is different from false [2022-11-20 16:29:55,591 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse5 (+ 32 |c_~#q~0.offset|)) (.cse7 (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base|) |c_ULTIMATE.start_atomic_exchange_~obj#1.offset| |c_ULTIMATE.start_atomic_exchange_~v#1|)))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse6 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse0 (select .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse0 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse4 (store .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse0 0 (select (select .cse6 |c_~#q~0.base|) .cse5))))) (let ((.cse2 (select .cse4 |c_~#q~0.base|))) (let ((.cse1 (select (select (store .cse4 |c_~#q~0.base| (store .cse2 .cse5 v_ArrVal_1293)) v_subst_1) 0))) (or (not (= .cse1 0)) (= (select .cse2 .cse3) .cse1)))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse8 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse10 (select .cse8 |c_~#q~0.base|)) (.cse11 (select (select .cse8 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1293))) (or (not (= (select (select (store .cse8 |c_~#q~0.base| .cse9) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse8 |c_~#q~0.base| (store .cse9 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse8 |c_~#q~0.base| (store .cse10 .cse5 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))) (not (= .cse11 0)) (not (= (select .cse10 .cse5) .cse11)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse16 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse12 (select .cse16 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse12 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse15 (select (select .cse16 |c_~#q~0.base|) .cse5))) (let ((.cse13 (store .cse16 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse12 0 .cse15)))) (let ((.cse14 (store (select .cse13 |c_~#q~0.base|) .cse5 v_ArrVal_1293))) (or (not (= (select (select (store .cse13 |c_~#q~0.base| .cse14) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse13 |c_~#q~0.base| (store .cse14 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ .cse15 1)))))))))))))) is different from false [2022-11-20 16:29:55,706 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse5 (+ 32 |c_~#q~0.offset|)) (.cse7 (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base|) |c_ULTIMATE.start_atomic_exchange_~obj#1.offset| |c_ULTIMATE.start_atomic_exchange_#in~v#1|)))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse6 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse0 (select .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse0 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse4 (store .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse0 0 (select (select .cse6 |c_~#q~0.base|) .cse5))))) (let ((.cse2 (select .cse4 |c_~#q~0.base|))) (let ((.cse1 (select (select (store .cse4 |c_~#q~0.base| (store .cse2 .cse5 v_ArrVal_1293)) v_subst_1) 0))) (or (not (= .cse1 0)) (= .cse1 (select .cse2 .cse3))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse10 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse8 (select (select .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0)) (.cse9 (select .cse10 |c_~#q~0.base|))) (or (not (= .cse8 0)) (not (= .cse8 (select .cse9 .cse5))) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse11 (store .cse9 .cse5 v_ArrVal_1293))) (or (not (= (select (select (store .cse10 |c_~#q~0.base| .cse11) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse10 |c_~#q~0.base| (store .cse11 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse10 |c_~#q~0.base| (store .cse9 .cse5 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse16 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse12 (select .cse16 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse12 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse15 (select (select .cse16 |c_~#q~0.base|) .cse5))) (let ((.cse13 (store .cse16 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse12 0 .cse15)))) (let ((.cse14 (store (select .cse13 |c_~#q~0.base|) .cse5 v_ArrVal_1293))) (or (not (= 0 (select (select (store .cse13 |c_~#q~0.base| .cse14) v_subst_2) 0))) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse13 |c_~#q~0.base| (store .cse14 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ .cse15 1)))))))))))))) is different from false [2022-11-20 16:29:55,823 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse4 (+ 32 |c_~#q~0.offset|)) (.cse7 (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_#in~obj#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_#in~obj#1.base|) |c_ULTIMATE.start_atomic_exchange_#in~obj#1.offset| |c_ULTIMATE.start_atomic_exchange_#in~v#1|)))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse5 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse6 (select .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse3 (store .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse6 0 (select (select .cse5 |c_~#q~0.base|) .cse4))))) (let ((.cse1 (select .cse3 |c_~#q~0.base|))) (let ((.cse0 (select (select (store .cse3 |c_~#q~0.base| (store .cse1 .cse4 v_ArrVal_1293)) v_subst_1) 0))) (or (not (= .cse0 0)) (= (select .cse1 .cse2) .cse0)))))) (not (= (select .cse6 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse11 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse12 (select .cse11 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse10 (select (select .cse11 |c_~#q~0.base|) .cse4))) (let ((.cse8 (store .cse11 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse12 0 .cse10)))) (let ((.cse9 (store (select .cse8 |c_~#q~0.base|) .cse4 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse8 |c_~#q~0.base| (store .cse9 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ .cse10 1))) (not (= (select (select (store .cse8 |c_~#q~0.base| .cse9) v_subst_2) 0) 0))))))) (not (= (select .cse12 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse15 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse14 (select .cse15 |c_~#q~0.base|)) (.cse13 (select (select .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= .cse13 (select .cse14 .cse4))) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse16 (store .cse14 .cse4 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse15 |c_~#q~0.base| (store .cse16 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse15 |c_~#q~0.base| (store .cse14 .cse4 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1))) (not (= (select (select (store .cse15 |c_~#q~0.base| .cse16) v_subst_2) 0) 0))))) (not (= .cse13 0)))))))) is different from false [2022-11-20 16:29:56,158 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse4 (+ 32 |c_~#q~0.offset|)) (.cse7 (store |c_#memory_int| |c_ULTIMATE.start_writeV_~v#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_writeV_~v#1.base|) |c_ULTIMATE.start_writeV_~v#1.offset| |c_ULTIMATE.start_writeV_~w#1|)))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse5 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse6 (select .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse3 (select (select .cse5 |c_~#q~0.base|) .cse4))) (let ((.cse0 (store .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse6 0 .cse3)))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse4 v_ArrVal_1293))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ .cse3 1)))))))) (not (= (select .cse6 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse12 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse8 (select .cse12 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse8 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse11 (store .cse12 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse8 0 (select (select .cse12 |c_~#q~0.base|) .cse4))))) (let ((.cse10 (select .cse11 |c_~#q~0.base|))) (let ((.cse9 (select (select (store .cse11 |c_~#q~0.base| (store .cse10 .cse4 v_ArrVal_1293)) v_subst_1) 0))) (or (not (= .cse9 0)) (= .cse9 (select .cse10 .cse2))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse14 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse16 (select .cse14 |c_~#q~0.base|)) (.cse13 (select (select .cse14 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= .cse13 0)) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse15 (store .cse16 .cse4 v_ArrVal_1293))) (or (not (= (select (select (store .cse14 |c_~#q~0.base| .cse15) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse14 |c_~#q~0.base| (store .cse15 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse14 |c_~#q~0.base| (store .cse16 .cse4 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))) (not (= (select .cse16 .cse4) .cse13)))))))) is different from false [2022-11-20 16:29:56,364 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse4 (+ 32 |c_~#q~0.offset|)) (.cse7 (store |c_#memory_int| |c_ULTIMATE.start_writeV_~v#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_writeV_~v#1.base|) |c_ULTIMATE.start_writeV_~v#1.offset| |c_ULTIMATE.start_writeV_#in~w#1|)))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse5 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse6 (select .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse3 (select (select .cse5 |c_~#q~0.base|) .cse4))) (let ((.cse0 (store .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse6 0 .cse3)))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse4 v_ArrVal_1293))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ .cse3 1)))))))) (not (= (select .cse6 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse12 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse8 (select .cse12 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse8 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse11 (store .cse12 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse8 0 (select (select .cse12 |c_~#q~0.base|) .cse4))))) (let ((.cse10 (select .cse11 |c_~#q~0.base|))) (let ((.cse9 (select (select (store .cse11 |c_~#q~0.base| (store .cse10 .cse4 v_ArrVal_1293)) v_subst_1) 0))) (or (= .cse9 (select .cse10 .cse2)) (not (= .cse9 0))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse14 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse13 (select (select .cse14 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0)) (.cse16 (select .cse14 |c_~#q~0.base|))) (or (not (= .cse13 0)) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse15 (store .cse16 .cse4 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse14 |c_~#q~0.base| (store .cse15 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse14 |c_~#q~0.base| (store .cse16 .cse4 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1))) (not (= (select (select (store .cse14 |c_~#q~0.base| .cse15) v_subst_2) 0) 0))))) (not (= .cse13 (select .cse16 .cse4))))))))) is different from false [2022-11-20 16:29:56,478 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse4 (+ 32 |c_~#q~0.offset|)) (.cse6 (store |c_#memory_int| |c_ULTIMATE.start_writeV_#in~v#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_writeV_#in~v#1.base|) |c_ULTIMATE.start_writeV_#in~v#1.offset| |c_ULTIMATE.start_writeV_#in~w#1|)))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse0 (store (store .cse6 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse3 (select .cse0 |c_~#q~0.base|)) (.cse5 (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse1 (store .cse3 .cse4 v_ArrVal_1293))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse0 |c_~#q~0.base| (store .cse3 .cse4 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))) (not (= .cse5 (select .cse3 .cse4))) (not (= .cse5 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse11 (store (store .cse6 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse7 (select .cse11 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse7 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse10 (select (select .cse11 |c_~#q~0.base|) .cse4))) (let ((.cse8 (store .cse11 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse7 0 .cse10)))) (let ((.cse9 (store (select .cse8 |c_~#q~0.base|) .cse4 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse8 |c_~#q~0.base| (store .cse9 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ .cse10 1))) (not (= (select (select (store .cse8 |c_~#q~0.base| .cse9) v_subst_2) 0) 0))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse15 (store (store .cse6 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse16 (select .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse14 (store .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse16 0 (select (select .cse15 |c_~#q~0.base|) .cse4))))) (let ((.cse13 (select .cse14 |c_~#q~0.base|))) (let ((.cse12 (select (select (store .cse14 |c_~#q~0.base| (store .cse13 .cse4 v_ArrVal_1293)) v_subst_1) 0))) (or (not (= .cse12 0)) (= .cse12 (select .cse13 .cse2))))))) (not (= (select .cse16 0) 0)))))))) is different from false [2022-11-20 16:30:28,898 INFO L321 Elim1Store]: treesize reduction 45, result has 53.6 percent of original size [2022-11-20 16:30:28,898 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 3 case distinctions, treesize of input 412 treesize of output 184 [2022-11-20 16:30:29,123 INFO L321 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2022-11-20 16:30:29,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 348301 treesize of output 333597 [2022-11-20 16:30:45,791 WARN L233 SmtUtils]: Spent 16.66s on a formula simplification. DAG size of input: 988 DAG size of output: 988 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 16:30:45,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:30:45,928 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 352164 treesize of output 344834 [2022-11-20 16:30:53,543 WARN L233 SmtUtils]: Spent 7.61s on a formula simplification. DAG size of input: 1038 DAG size of output: 1037 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 16:30:53,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:30:53,735 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 698072 treesize of output 663050 [2022-11-20 16:32:05,074 WARN L233 SmtUtils]: Spent 1.19m on a formula simplification. DAG size of input: 1052 DAG size of output: 1052 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 16:32:06,809 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 6 treesize of output 4 [2022-11-20 16:32:24,822 WARN L233 SmtUtils]: Spent 12.66s on a formula simplification. DAG size of input: 793 DAG size of output: 793 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 16:32:40,671 WARN L233 SmtUtils]: Spent 12.19s on a formula simplification. DAG size of input: 791 DAG size of output: 791 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 16:32:56,841 WARN L233 SmtUtils]: Spent 13.17s on a formula simplification. DAG size of input: 791 DAG size of output: 791 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 16:33:18,817 WARN L233 SmtUtils]: Spent 17.69s on a formula simplification. DAG size of input: 789 DAG size of output: 789 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 16:33:31,953 WARN L233 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 774 DAG size of output: 774 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)