./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/config/GemCutterReach.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 --- 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-5e519f3 [2022-11-04 12:05:26,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-04 12:05:26,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-04 12:05:26,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-04 12:05:26,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-04 12:05:26,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-04 12:05:26,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-04 12:05:26,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-04 12:05:26,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-04 12:05:26,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-04 12:05:26,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-04 12:05:26,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-04 12:05:26,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-04 12:05:26,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-04 12:05:26,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-04 12:05:26,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-04 12:05:26,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-04 12:05:26,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-04 12:05:26,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-04 12:05:26,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-04 12:05:26,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-04 12:05:27,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-04 12:05:27,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-04 12:05:27,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-04 12:05:27,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-04 12:05:27,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-04 12:05:27,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-04 12:05:27,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-04 12:05:27,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-04 12:05:27,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-04 12:05:27,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-04 12:05:27,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-04 12:05:27,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-04 12:05:27,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-04 12:05:27,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-04 12:05:27,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-04 12:05:27,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-04 12:05:27,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-04 12:05:27,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-04 12:05:27,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-04 12:05:27,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-04 12:05:27,031 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2022-11-04 12:05:27,070 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-04 12:05:27,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-04 12:05:27,071 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-04 12:05:27,071 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-04 12:05:27,072 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-04 12:05:27,072 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-04 12:05:27,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-04 12:05:27,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-04 12:05:27,074 INFO L138 SettingsManager]: * Use SBE=true [2022-11-04 12:05:27,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-04 12:05:27,075 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-04 12:05:27,075 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-04 12:05:27,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-04 12:05:27,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-04 12:05:27,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-04 12:05:27,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-04 12:05:27,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-04 12:05:27,076 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-04 12:05:27,077 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-04 12:05:27,077 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-04 12:05:27,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-04 12:05:27,077 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-04 12:05:27,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-04 12:05:27,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-04 12:05:27,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-04 12:05:27,078 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-04 12:05:27,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-04 12:05:27,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-04 12:05:27,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-04 12:05:27,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-04 12:05:27,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-04 12:05:27,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-04 12:05:27,080 INFO L138 SettingsManager]: * DFS Order used in POR=PSEUDO_LOCKSTEP [2022-11-04 12:05:27,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-04 12:05:27,080 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-04 12:05:27,081 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-04 12:05:27,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-04 12:05:27,081 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-04 12:05:27,081 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-04 12:05:27,081 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_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/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_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi 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 ! data-race) ) 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 -> a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 [2022-11-04 12:05:27,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-04 12:05:27,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-04 12:05:27,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-04 12:05:27,440 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-04 12:05:27,441 INFO L275 PluginConnector]: CDTParser initialized [2022-11-04 12:05:27,443 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/../../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i [2022-11-04 12:05:27,531 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/data/a70878547/a22526ee19114850ad2866bfd7b98a6b/FLAGc0b87622d [2022-11-04 12:05:28,182 INFO L306 CDTParser]: Found 1 translation units. [2022-11-04 12:05:28,182 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i [2022-11-04 12:05:28,204 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/data/a70878547/a22526ee19114850ad2866bfd7b98a6b/FLAGc0b87622d [2022-11-04 12:05:28,404 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/data/a70878547/a22526ee19114850ad2866bfd7b98a6b [2022-11-04 12:05:28,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-04 12:05:28,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-04 12:05:28,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-04 12:05:28,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-04 12:05:28,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-04 12:05:28,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:05:28" (1/1) ... [2022-11-04 12:05:28,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44af6085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:28, skipping insertion in model container [2022-11-04 12:05:28,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:05:28" (1/1) ... [2022-11-04 12:05:28,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-04 12:05:28,502 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-04 12:05:29,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-04 12:05:29,281 INFO L203 MainTranslator]: Completed pre-run [2022-11-04 12:05:29,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-04 12:05:29,438 INFO L208 MainTranslator]: Completed translation [2022-11-04 12:05:29,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29 WrapperNode [2022-11-04 12:05:29,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-04 12:05:29,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-04 12:05:29,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-04 12:05:29,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-04 12:05:29,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,544 INFO L138 Inliner]: procedures = 370, calls = 51, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 241 [2022-11-04 12:05:29,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-04 12:05:29,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-04 12:05:29,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-04 12:05:29,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-04 12:05:29,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,628 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-04 12:05:29,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-04 12:05:29,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-04 12:05:29,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-04 12:05:29,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-04 12:05:29,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:05:29,681 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-04 12:05:29,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-04 12:05:29,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-04 12:05:29,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-04 12:05:29,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-04 12:05:29,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-04 12:05:29,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-04 12:05:29,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-04 12:05:29,744 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-04 12:05:29,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-04 12:05:29,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-04 12:05:29,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-04 12:05:29,746 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-04 12:05:29,746 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-04 12:05:29,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-04 12:05:29,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-04 12:05:29,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-04 12:05:29,748 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-04 12:05:29,909 INFO L235 CfgBuilder]: Building ICFG [2022-11-04 12:05:29,912 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-04 12:05:30,706 INFO L276 CfgBuilder]: Performing block encoding [2022-11-04 12:05:30,726 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-04 12:05:30,726 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-04 12:05:30,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:05:30 BoogieIcfgContainer [2022-11-04 12:05:30,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-04 12:05:30,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-04 12:05:30,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-04 12:05:30,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-04 12:05:30,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 12:05:28" (1/3) ... [2022-11-04 12:05:30,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a6c80b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:05:30, skipping insertion in model container [2022-11-04 12:05:30,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (2/3) ... [2022-11-04 12:05:30,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a6c80b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:05:30, skipping insertion in model container [2022-11-04 12:05:30,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:05:30" (3/3) ... [2022-11-04 12:05:30,742 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_26-alloc_region_rc.i [2022-11-04 12:05:30,752 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-04 12:05:30,763 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-04 12:05:30,763 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-11-04 12:05:30,764 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-04 12:05:30,892 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-04 12:05:30,968 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-04 12:05:30,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-04 12:05:30,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:05:30,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-04 12:05:30,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-04 12:05:31,016 INFO L156 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-04 12:05:31,032 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2022-11-04 12:05:31,040 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;@17b98faa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-04 12:05:31,040 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-04 12:05:34,368 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-04 12:05:34,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:34,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1957847529, now seen corresponding path program 1 times [2022-11-04 12:05:34,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:34,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919185005] [2022-11-04 12:05:34,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:34,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:36,364 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-04 12:05:36,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:36,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919185005] [2022-11-04 12:05:36,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919185005] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:36,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:36,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-04 12:05:36,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645209774] [2022-11-04 12:05:36,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:36,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-04 12:05:36,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:36,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-04 12:05:36,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-11-04 12:05:36,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:36,402 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:36,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.571428571428571) internal successors, (106), 15 states have internal predecessors, (106), 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-04 12:05:36,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:37,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:37,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-04 12:05:37,181 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-04 12:05:37,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:37,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1256726610, now seen corresponding path program 1 times [2022-11-04 12:05:37,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:37,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349996150] [2022-11-04 12:05:37,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:37,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:38,008 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-04 12:05:38,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:38,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349996150] [2022-11-04 12:05:38,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349996150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:38,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:38,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-04 12:05:38,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855672945] [2022-11-04 12:05:38,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:38,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-04 12:05:38,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:38,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-04 12:05:38,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-04 12:05:38,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:38,014 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:38,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.2) internal successors, (116), 6 states have internal predecessors, (116), 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-04 12:05:38,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:38,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:38,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:38,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:38,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-04 12:05:38,207 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-04 12:05:38,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:38,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1601516726, now seen corresponding path program 1 times [2022-11-04 12:05:38,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:38,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490079717] [2022-11-04 12:05:38,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:38,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:39,035 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-04 12:05:39,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:39,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490079717] [2022-11-04 12:05:39,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490079717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:39,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:39,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-04 12:05:39,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858504856] [2022-11-04 12:05:39,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:39,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-04 12:05:39,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:39,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-04 12:05:39,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-04 12:05:39,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:39,053 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:39,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.2) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:05:39,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:39,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:39,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:39,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:39,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:39,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:39,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-04 12:05:39,308 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-04 12:05:39,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:39,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1435245858, now seen corresponding path program 1 times [2022-11-04 12:05:39,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:39,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652424674] [2022-11-04 12:05:39,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:39,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:40,138 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-04 12:05:40,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:40,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652424674] [2022-11-04 12:05:40,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652424674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:40,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:40,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-04 12:05:40,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999722629] [2022-11-04 12:05:40,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:40,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-04 12:05:40,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:40,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-04 12:05:40,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-04 12:05:40,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:40,142 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:40,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.6) internal successors, (138), 6 states have internal predecessors, (138), 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-04 12:05:40,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:40,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:40,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:40,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:40,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:40,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:40,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:40,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:40,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-04 12:05:40,327 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-04 12:05:40,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:40,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1398217715, now seen corresponding path program 1 times [2022-11-04 12:05:40,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:40,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955602420] [2022-11-04 12:05:40,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:40,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:41,112 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-04 12:05:41,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:41,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955602420] [2022-11-04 12:05:41,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955602420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:41,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:41,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-04 12:05:41,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501813901] [2022-11-04 12:05:41,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:41,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-04 12:05:41,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:41,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-04 12:05:41,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-04 12:05:41,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:41,118 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:41,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.4) internal successors, (147), 6 states have internal predecessors, (147), 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-04 12:05:41,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:41,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:41,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:41,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:41,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:41,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:41,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:41,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:41,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:41,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:41,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-04 12:05:41,320 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-04 12:05:41,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:41,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1552405417, now seen corresponding path program 1 times [2022-11-04 12:05:41,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:41,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16757342] [2022-11-04 12:05:41,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:41,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:42,096 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-04 12:05:42,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:42,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16757342] [2022-11-04 12:05:42,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16757342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:42,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:42,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-04 12:05:42,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885892361] [2022-11-04 12:05:42,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:42,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-04 12:05:42,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:42,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-04 12:05:42,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-04 12:05:42,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:42,101 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:42,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.6) internal successors, (158), 6 states have internal predecessors, (158), 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-04 12:05:42,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:42,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:42,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:42,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:42,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:42,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:42,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:42,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:42,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:42,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:42,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:42,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:42,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-04 12:05:42,420 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-04 12:05:42,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:42,421 INFO L85 PathProgramCache]: Analyzing trace with hash -802741330, now seen corresponding path program 1 times [2022-11-04 12:05:42,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:42,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664481124] [2022-11-04 12:05:42,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:42,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:43,203 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-04 12:05:43,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:43,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664481124] [2022-11-04 12:05:43,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664481124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:43,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:43,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-04 12:05:43,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730593494] [2022-11-04 12:05:43,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:43,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-04 12:05:43,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:43,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-04 12:05:43,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-04 12:05:43,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:43,206 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:43,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.2) internal successors, (166), 6 states have internal predecessors, (166), 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-04 12:05:43,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:43,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:43,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:43,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:43,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:43,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:43,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:43,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:43,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:43,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:43,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:43,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:43,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:43,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:43,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-04 12:05:43,592 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-04 12:05:43,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1563300130, now seen corresponding path program 1 times [2022-11-04 12:05:43,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:43,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071352967] [2022-11-04 12:05:43,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:43,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:44,440 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-04 12:05:44,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:44,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071352967] [2022-11-04 12:05:44,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071352967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:44,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:44,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-04 12:05:44,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952517443] [2022-11-04 12:05:44,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:44,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-04 12:05:44,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:44,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-04 12:05:44,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-11-04 12:05:44,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:44,445 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:44,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 15 states have internal predecessors, (122), 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-04 12:05:44,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:44,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:44,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:44,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:44,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:44,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:44,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:44,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:47,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:47,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:47,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:47,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:47,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:47,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:47,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:47,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:47,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-04 12:05:47,864 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-04 12:05:47,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:47,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1173535131, now seen corresponding path program 1 times [2022-11-04 12:05:47,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:47,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855775026] [2022-11-04 12:05:47,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:47,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:48,090 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-04 12:05:48,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:48,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855775026] [2022-11-04 12:05:48,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855775026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:48,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:48,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-04 12:05:48,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702430730] [2022-11-04 12:05:48,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:48,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-04 12:05:48,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:48,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-04 12:05:48,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-04 12:05:48,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:48,094 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:48,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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-04 12:05:48,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:48,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:48,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:48,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:48,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:48,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:48,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:48,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:48,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:50,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:50,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:50,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:50,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:50,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:50,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:50,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:50,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:50,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:50,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-04 12:05:50,943 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-04 12:05:50,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:50,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1235702433, now seen corresponding path program 1 times [2022-11-04 12:05:50,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:50,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231215204] [2022-11-04 12:05:50,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:50,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:52,149 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-04 12:05:52,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:52,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231215204] [2022-11-04 12:05:52,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231215204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:52,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:52,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-04 12:05:52,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770058290] [2022-11-04 12:05:52,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:52,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-04 12:05:52,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:52,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-04 12:05:52,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-11-04 12:05:52,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:52,152 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:52,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 16.0) internal successors, (192), 13 states have internal predecessors, (192), 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-04 12:05:52,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:52,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:52,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:52,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:52,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:52,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:52,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:52,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:52,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:52,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:53,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:53,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:53,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:53,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:53,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-04 12:05:53,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-04 12:05:53,035 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-04 12:05:53,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:53,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1633902307, now seen corresponding path program 1 times [2022-11-04 12:05:53,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:53,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956833180] [2022-11-04 12:05:53,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:53,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:55,826 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-04 12:05:55,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:55,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956833180] [2022-11-04 12:05:55,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956833180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:55,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:55,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-11-04 12:05:55,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455993463] [2022-11-04 12:05:55,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:55,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-04 12:05:55,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:55,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-04 12:05:55,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2022-11-04 12:05:55,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:55,829 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:55,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 8.04) internal successors, (201), 26 states have internal predecessors, (201), 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-04 12:05:55,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:55,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:55,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:55,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:55,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:55,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:55,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:55,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-04 12:05:55,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:55,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-04 12:05:55,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:58,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-04 12:05:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-04 12:05:58,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:58,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-04 12:05:58,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-04 12:05:58,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-04 12:05:58,282 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-04 12:05:58,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:58,282 INFO L85 PathProgramCache]: Analyzing trace with hash -792649472, now seen corresponding path program 1 times [2022-11-04 12:05:58,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:58,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018291199] [2022-11-04 12:05:58,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:58,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:03,166 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-04 12:06:03,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:03,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018291199] [2022-11-04 12:06:03,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018291199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:06:03,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:06:03,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-11-04 12:06:03,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342358390] [2022-11-04 12:06:03,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:06:03,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-04 12:06:03,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:06:03,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-04 12:06:03,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2022-11-04 12:06:03,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:03,170 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:06:03,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 11.0) internal successors, (220), 21 states have internal predecessors, (220), 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-04 12:06:03,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-04 12:06:03,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:06:03,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:06:03,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:06:03,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:06:03,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:06:03,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:06:03,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-04 12:06:03,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:03,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-04 12:06:03,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-04 12:06:03,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:07,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-04 12:06:07,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:06:07,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:06:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:06:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:06:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:06:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:06:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-04 12:06:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-04 12:06:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-04 12:06:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-04 12:06:07,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-04 12:06:07,352 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-04 12:06:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1344739761, now seen corresponding path program 1 times [2022-11-04 12:06:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:07,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597147827] [2022-11-04 12:06:07,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:07,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:06:22,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:22,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597147827] [2022-11-04 12:06:22,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597147827] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:06:22,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581954906] [2022-11-04 12:06:22,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:22,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:22,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:06:22,103 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:06:22,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7078859-4228-4169-a211-6c7b4152922d/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-04 12:06:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:22,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 169 conjunts are in the unsatisfiable core [2022-11-04 12:06:22,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:06:22,930 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-04 12:06:22,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-04 12:06:23,015 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-04 12:06:23,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-04 12:06:23,507 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-04 12:06:23,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-04 12:06:23,777 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-04 12:06:23,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2022-11-04 12:06:26,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-04 12:06:26,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-04 12:06:27,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-04 12:06:27,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-04 12:06:27,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-04 12:06:28,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:28,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:28,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:06:28,256 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:28,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-04 12:06:28,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-04 12:06:28,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-04 12:06:28,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:28,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:28,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:28,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:06:28,661 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:28,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 42 [2022-11-04 12:06:28,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:28,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:28,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:28,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:28,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:06:28,979 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:28,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 54 [2022-11-04 12:06:29,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:29,216 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:29,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 47 [2022-11-04 12:06:29,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:29,296 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:29,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 47 [2022-11-04 12:06:29,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:29,379 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:29,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 47 [2022-11-04 12:06:29,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:29,519 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:29,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 47 [2022-11-04 12:06:29,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:29,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-04 12:06:29,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:29,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-04 12:06:30,181 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-04 12:06:30,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 54 [2022-11-04 12:06:30,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-04 12:06:30,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:30,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:30,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:30,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2022-11-04 12:06:30,578 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-04 12:06:30,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2022-11-04 12:06:30,702 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-04 12:06:30,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2022-11-04 12:06:30,807 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-04 12:06:30,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2022-11-04 12:06:31,807 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-04 12:06:31,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2022-11-04 12:06:31,903 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-04 12:06:31,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2022-11-04 12:06:31,992 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-04 12:06:31,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2022-11-04 12:06:32,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:32,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:32,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:32,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:06:32,099 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-04 12:06:32,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 73 [2022-11-04 12:06:32,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:32,902 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:32,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62 [2022-11-04 12:06:32,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:32,964 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:32,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62 [2022-11-04 12:06:33,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:33,055 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:33,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62 [2022-11-04 12:06:33,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:33,165 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:33,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62 [2022-11-04 12:06:33,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:33,630 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:33,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62 [2022-11-04 12:06:33,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:33,729 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:33,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62 [2022-11-04 12:06:33,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:33,796 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:33,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62 [2022-11-04 12:06:33,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:33,901 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:33,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62 [2022-11-04 12:06:34,208 INFO L356 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2022-11-04 12:06:34,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 45 [2022-11-04 12:06:34,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2022-11-04 12:06:34,420 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:34,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62 [2022-11-04 12:06:34,499 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:34,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62 [2022-11-04 12:06:34,591 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:34,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62 [2022-11-04 12:06:34,651 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:34,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62 [2022-11-04 12:06:35,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:35,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:35,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:35,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:35,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:35,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:35,099 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:06:35,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:35,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:35,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:35,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:35,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:06:35,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:06:35,111 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-04 12:06:35,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 13 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 76 treesize of output 96 [2022-11-04 12:06:35,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:06:35,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:06:35,918 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem52#1.offset| 4))) (and (forall ((v_ArrVal_2418 (Array Int Int)) (v_ArrVal_2419 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2418))) (store .cse0 |c_ULTIMATE.start_main_#t~mem52#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem52#1.base|) .cse1 v_ArrVal_2419))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_ArrVal_2419 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2418))) (store .cse2 |c_ULTIMATE.start_main_#t~mem52#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem52#1.base|) .cse1 v_ArrVal_2419))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2418 (Array Int Int)) (v_ArrVal_2419 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2418))) (store .cse3 |c_ULTIMATE.start_main_#t~mem52#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem52#1.base|) .cse1 v_ArrVal_2419))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_ArrVal_2419 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2418))) (store .cse4 |c_ULTIMATE.start_main_#t~mem52#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem52#1.base|) .cse1 v_ArrVal_2419))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)))))) is different from false [2022-11-04 12:06:36,009 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~p~1#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base|) .cse6)) (.cse2 (+ 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base|) .cse6)))) (and (forall ((v_ArrVal_2418 (Array Int Int)) (v_ArrVal_2419 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2418))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2419))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2418 (Array Int Int)) (v_ArrVal_2419 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2418))) (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_2419))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2418 (Array Int Int)) (v_ArrVal_2419 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2418))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_2419))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2418 (Array Int Int)) (v_ArrVal_2419 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2418))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 v_ArrVal_2419))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1))))))) is different from false [2022-11-04 12:06:36,369 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_#t~mem49#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem49#1.base|) .cse6)) (.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem49#1.base|) .cse6) 4))) (and (forall ((v_ArrVal_2418 (Array Int Int)) (v_ArrVal_2419 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2418))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2419))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2418 (Array Int Int)) (v_ArrVal_2419 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2418))) (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_2419))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_ArrVal_2419 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2418))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_2419))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_ArrVal_2419 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2418))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 v_ArrVal_2419))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|))))) is different from false [2022-11-04 12:06:37,248 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:06:37,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 258 treesize of output 238 [2022-11-04 12:06:37,332 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_main_#t~mem49#1.offset| 4))) (let ((.cse0 (+ |c_~#A~0.offset| 2)) (.cse1 (+ |c_~#A~0.offset| 1)) (.cse5 (+ |c_~#A~0.offset| 3)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem49#1.base|) .cse9)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem49#1.base|) .cse9) 4))) (and (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (= (select (select (let ((.cse2 (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_#t~mem49#1.base| v_prenex_3))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_prenex_4))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse5) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (forall ((v_prenex_6 Int) (v_prenex_5 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_#t~mem49#1.base| v_prenex_5))) (store .cse6 .cse3 (store (select .cse6 .cse3) .cse4 v_prenex_6))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse5) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_ArrVal_2418 (Array Int Int)) (v_ArrVal_2419 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse7 (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2418))) (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 v_ArrVal_2419))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse5) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse5) 0)) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse8 (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_#t~mem49#1.base| v_prenex_1))) (store .cse8 .cse3 (store (select .cse8 .cse3) .cse4 v_prenex_2))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3))))))))) is different from false [2022-11-04 12:06:37,570 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse10 (+ (select (select |c_#memory_$Pointer$.offset| |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse0 (+ |c_~#A~0.offset| 2)) (.cse1 (+ |c_~#A~0.offset| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse5) .cse10)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| .cse5) .cse10) 4)) (.cse6 (+ |c_~#A~0.offset| 3))) (and (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_ArrVal_2418 (Array Int Int)) (v_ArrVal_2419 Int)) (= (select (select (let ((.cse2 (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_1) .cse5 v_ArrVal_2418))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_2419))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse6) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_prenex_6 Int) (v_prenex_5 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_1) .cse5 v_prenex_5))) (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 v_prenex_6))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse6) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse6) 0)) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse8 (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_1) .cse5 v_prenex_1))) (store .cse8 .cse3 (store (select .cse8 .cse3) .cse4 v_prenex_2))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)))))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (= (select (select (let ((.cse9 (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_1) .cse5 v_prenex_3))) (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 v_prenex_4))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 .cse6) 0))))))) is different from false [2022-11-04 12:06:38,117 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse10 (+ (select (select |c_#memory_$Pointer$.offset| |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse0 (+ |c_~#A~0.offset| 2)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse6) .cse10)) (.cse5 (+ (select (select |c_#memory_$Pointer$.offset| .cse6) .cse10) 4)) (.cse1 (+ |c_~#A~0.offset| 1)) (.cse2 (+ |c_~#A~0.offset| 3))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse3 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_prenex_1))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_prenex_2))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_prenex_6 Int) (v_prenex_5 (Array Int Int))) (= (select (select (let ((.cse7 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_prenex_5))) (store .cse7 .cse4 (store (select .cse7 .cse4) .cse5 v_prenex_6))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_ArrVal_2418 (Array Int Int)) (v_ArrVal_2419 Int)) (= (select (select (let ((.cse8 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_ArrVal_2418))) (store .cse8 .cse4 (store (select .cse8 .cse4) .cse5 v_ArrVal_2419))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (= (select (select (let ((.cse9 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_prenex_3))) (store .cse9 .cse4 (store (select .cse9 .cse4) .cse5 v_prenex_4))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0))))))) is different from false [2022-11-04 12:06:38,541 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.offset|))) (.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (let ((.cse6 (select (select .cse12 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse11 (+ (select (select .cse10 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse0 (+ |c_~#A~0.offset| 2)) (.cse4 (select (select .cse12 .cse6) .cse11)) (.cse5 (+ 4 (select (select .cse10 .cse6) .cse11))) (.cse1 (+ |c_~#A~0.offset| 1)) (.cse2 (+ |c_~#A~0.offset| 3))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)) (forall ((v_prenex_6 Int) (v_prenex_5 (Array Int Int))) (= (select (select (let ((.cse3 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_prenex_5))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_prenex_6))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (= (select (select (let ((.cse7 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_prenex_1))) (store .cse7 .cse4 (store (select .cse7 .cse4) .cse5 v_prenex_2))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 .cse2) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (= (select (select (let ((.cse8 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_prenex_3))) (store .cse8 .cse4 (store (select .cse8 .cse4) .cse5 v_prenex_4))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (forall ((v_ArrVal_2418 (Array Int Int)) (v_ArrVal_2419 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse9 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_ArrVal_2418))) (store .cse9 .cse4 (store (select .cse9 .cse4) .cse5 v_ArrVal_2419))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)))))))) is different from false [2022-11-04 12:06:38,932 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.offset|))) (.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (let ((.cse6 (select (select .cse12 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse11 (+ (select (select .cse10 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse0 (+ |c_~#A~0.offset| 2)) (.cse4 (select (select .cse12 .cse6) .cse11)) (.cse5 (+ 4 (select (select .cse10 .cse6) .cse11))) (.cse1 (+ |c_~#A~0.offset| 1)) (.cse2 (+ |c_~#A~0.offset| 3))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)) (forall ((v_prenex_6 Int) (v_prenex_5 (Array Int Int))) (= (select (select (let ((.cse3 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2393) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_prenex_5))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_prenex_6))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse7 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2393) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_prenex_3))) (store .cse7 .cse4 (store (select .cse7 .cse4) .cse5 v_prenex_4))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)))) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (= (select (select (let ((.cse8 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2393) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_prenex_1))) (store .cse8 .cse4 (store (select .cse8 .cse4) .cse5 v_prenex_2))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 .cse2) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (forall ((v_ArrVal_2418 (Array Int Int)) (v_ArrVal_2419 Int)) (= (select (select (let ((.cse9 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2393) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_ArrVal_2418))) (store .cse9 .cse4 (store (select .cse9 .cse4) .cse5 v_ArrVal_2419))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)))))))) is different from false [2022-11-04 12:06:39,366 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.offset|))) (.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (let ((.cse7 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse6 (select (select .cse14 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse13 (+ (select (select .cse12 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse0 (+ |c_~#A~0.offset| 2)) (.cse1 (+ |c_~#A~0.offset| 1)) (.cse3 (select (select .cse14 .cse6) .cse13)) (.cse4 (+ 4 (select (select .cse12 .cse6) .cse13))) (.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse7 |c_t_funThread1of1ForFork0_#t~nondet40#1|))) (.cse8 (+ |c_~#A~0.offset| 3))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse2 (store (store (store (store .cse5 |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2393) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_prenex_1))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_prenex_2))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse7))) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse8) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse8) 0)) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (= (select (select (let ((.cse9 (store (store (store (store .cse5 |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2393) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_prenex_3))) (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 v_prenex_4))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse8) 0)) (forall ((v_ArrVal_2418 (Array Int Int)) (v_ArrVal_2419 Int)) (= (select (select (let ((.cse10 (store (store (store (store .cse5 |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2393) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_ArrVal_2418))) (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 v_ArrVal_2419))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (forall ((v_prenex_6 Int) (v_prenex_5 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse11 (store (store (store (store .cse5 |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2393) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_prenex_5))) (store .cse11 .cse3 (store (select .cse11 .cse3) .cse4 v_prenex_6))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))) (not (= (select v_arrayElimArr_1 .cse8) 0)))))))) is different from false [2022-11-04 12:06:39,608 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.offset|))) (.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (let ((.cse8 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) (.cse11 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse7 (select (select .cse15 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse14 (+ (select (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse0 (+ |c_~#A~0.offset| 2)) (.cse4 (select (select .cse15 .cse7) .cse14)) (.cse5 (+ 4 (select (select .cse13 .cse7) .cse14))) (.cse6 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 |c_t_funThread1of1ForFork0_#t~nondet40#1|) .cse11 |c_t_funThread1of1ForFork0_#t~nondet40#1|))) (.cse1 (+ |c_~#A~0.offset| 1)) (.cse2 (+ |c_~#A~0.offset| 3))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse3 (store (store (store (store .cse6 |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2393) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse7 v_prenex_3))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_prenex_4))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_ArrVal_2418 (Array Int Int)) (v_ArrVal_2419 Int)) (= (select (select (let ((.cse9 (store (store (store (store .cse6 |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2393) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse7 v_ArrVal_2418))) (store .cse9 .cse4 (store (select .cse9 .cse4) .cse5 v_ArrVal_2419))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse10 (store (store (store (store .cse6 |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2393) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse7 v_prenex_1))) (store .cse10 .cse4 (store (select .cse10 .cse4) .cse5 v_prenex_2))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse11))) (not (= (select v_arrayElimArr_1 .cse2) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (forall ((v_prenex_6 Int) (v_prenex_5 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse12 (store (store (store (store .cse6 |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2393) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2401) |c_~#A~0.base| v_arrayElimArr_1) .cse7 v_prenex_5))) (store .cse12 .cse4 (store (select .cse12 .cse4) .cse5 v_prenex_6))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)))))))) is different from false [2022-11-04 12:06:41,979 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:06:41,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 9142 treesize of output 8209 [2022-11-04 12:12:09,616 WARN L234 SmtUtils]: Spent 5.46m on a formula simplification. DAG size of input: 141 DAG size of output: 99 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-04 12:12:09,617 INFO L356 Elim1Store]: treesize reduction 174, result has 55.9 percent of original size [2022-11-04 12:12:09,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 147206 treesize of output 141968