./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 23:59:31,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 23:59:31,732 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DataRace-32bit-Taipan_Default.epf [2023-11-24 23:59:31,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 23:59:31,739 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 23:59:31,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 23:59:31,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 23:59:31,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 23:59:31,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 23:59:31,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 23:59:31,769 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-24 23:59:31,770 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-24 23:59:31,770 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-24 23:59:31,771 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-24 23:59:31,771 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-24 23:59:31,772 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-24 23:59:31,773 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-24 23:59:31,773 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-24 23:59:31,774 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-24 23:59:31,774 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-24 23:59:31,775 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-24 23:59:31,776 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-24 23:59:31,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 23:59:31,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 23:59:31,777 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 23:59:31,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 23:59:31,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 23:59:31,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 23:59:31,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 23:59:31,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 23:59:31,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 23:59:31,781 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-24 23:59:31,781 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 23:59:31,781 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 23:59:31,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 23:59:31,782 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 23:59:31,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 23:59:31,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 23:59:31,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:59:31,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 23:59:31,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 23:59:31,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 23:59:31,786 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-24 23:59:31,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 23:59:31,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 23:59:31,787 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 23:59:31,787 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-24 23:59:31,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 23:59:31,788 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/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_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e [2023-11-24 23:59:32,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 23:59:32,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 23:59:32,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 23:59:32,153 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 23:59:32,154 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 23:59:32,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2023-11-24 23:59:35,372 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 23:59:35,746 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 23:59:35,747 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2023-11-24 23:59:35,768 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/data/33b1027b4/ba45e1aad1da4b019c16360fc360069b/FLAGff199fec8 [2023-11-24 23:59:35,782 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/data/33b1027b4/ba45e1aad1da4b019c16360fc360069b [2023-11-24 23:59:35,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 23:59:35,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 23:59:35,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 23:59:35,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 23:59:35,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 23:59:35,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:59:35" (1/1) ... [2023-11-24 23:59:35,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@336272ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:59:35, skipping insertion in model container [2023-11-24 23:59:35,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:59:35" (1/1) ... [2023-11-24 23:59:35,869 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 23:59:36,349 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:59:36,363 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 23:59:36,420 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:59:36,484 INFO L206 MainTranslator]: Completed translation [2023-11-24 23:59:36,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:59:36 WrapperNode [2023-11-24 23:59:36,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 23:59:36,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 23:59:36,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 23:59:36,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 23:59:36,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:59:36" (1/1) ... [2023-11-24 23:59:36,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:59:36" (1/1) ... [2023-11-24 23:59:36,585 INFO L138 Inliner]: procedures = 265, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114 [2023-11-24 23:59:36,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 23:59:36,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 23:59:36,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 23:59:36,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 23:59:36,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:59:36" (1/1) ... [2023-11-24 23:59:36,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:59:36" (1/1) ... [2023-11-24 23:59:36,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:59:36" (1/1) ... [2023-11-24 23:59:36,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:59:36" (1/1) ... [2023-11-24 23:59:36,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:59:36" (1/1) ... [2023-11-24 23:59:36,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:59:36" (1/1) ... [2023-11-24 23:59:36,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:59:36" (1/1) ... [2023-11-24 23:59:36,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:59:36" (1/1) ... [2023-11-24 23:59:36,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 23:59:36,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 23:59:36,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 23:59:36,643 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 23:59:36,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:59:36" (1/1) ... [2023-11-24 23:59:36,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:59:36,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:59:36,681 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 23:59:36,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 23:59:36,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 23:59:36,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-24 23:59:36,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 23:59:36,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-24 23:59:36,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 23:59:36,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 23:59:36,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 23:59:36,714 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-24 23:59:36,714 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-24 23:59:36,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 23:59:36,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 23:59:36,716 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 23:59:36,856 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 23:59:36,858 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 23:59:37,200 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 23:59:37,213 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 23:59:37,213 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-24 23:59:37,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:59:37 BoogieIcfgContainer [2023-11-24 23:59:37,215 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 23:59:37,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 23:59:37,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 23:59:37,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 23:59:37,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 11:59:35" (1/3) ... [2023-11-24 23:59:37,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433799be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:59:37, skipping insertion in model container [2023-11-24 23:59:37,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:59:36" (2/3) ... [2023-11-24 23:59:37,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433799be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:59:37, skipping insertion in model container [2023-11-24 23:59:37,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:59:37" (3/3) ... [2023-11-24 23:59:37,224 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i [2023-11-24 23:59:37,233 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 23:59:37,244 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 23:59:37,245 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-24 23:59:37,245 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 23:59:37,316 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-24 23:59:37,353 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 135 places, 136 transitions, 279 flow [2023-11-24 23:59:37,530 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1360 states, 1330 states have (on average 1.9157894736842105) internal successors, (2548), 1359 states have internal predecessors, (2548), 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) [2023-11-24 23:59:37,553 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:59:37,560 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@4ac7d9ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:59:37,561 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-24 23:59:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 1360 states, 1330 states have (on average 1.9157894736842105) internal successors, (2548), 1359 states have internal predecessors, (2548), 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) [2023-11-24 23:59:37,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-24 23:59:37,575 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:59:37,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:59:37,576 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-24 23:59:37,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:59:37,583 INFO L85 PathProgramCache]: Analyzing trace with hash 82393490, now seen corresponding path program 1 times [2023-11-24 23:59:37,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:59:37,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653948335] [2023-11-24 23:59:37,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:59:37,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:59:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:59:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:59:38,598 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:59:38,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653948335] [2023-11-24 23:59:38,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653948335] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:59:38,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:59:38,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:59:38,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138808567] [2023-11-24 23:59:38,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:59:38,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:59:38,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:59:38,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:59:38,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:59:38,643 INFO L87 Difference]: Start difference. First operand has 1360 states, 1330 states have (on average 1.9157894736842105) internal successors, (2548), 1359 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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) [2023-11-24 23:59:39,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:59:39,036 INFO L93 Difference]: Finished difference Result 1346 states and 2464 transitions. [2023-11-24 23:59:39,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:59:39,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-24 23:59:39,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:59:39,063 INFO L225 Difference]: With dead ends: 1346 [2023-11-24 23:59:39,063 INFO L226 Difference]: Without dead ends: 1233 [2023-11-24 23:59:39,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:59:39,069 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 149 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:59:39,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 230 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 23:59:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2023-11-24 23:59:39,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1210. [2023-11-24 23:59:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1191 states have (on average 1.874895046179681) internal successors, (2233), 1209 states have internal predecessors, (2233), 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) [2023-11-24 23:59:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 2233 transitions. [2023-11-24 23:59:39,176 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 2233 transitions. Word has length 30 [2023-11-24 23:59:39,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:59:39,176 INFO L495 AbstractCegarLoop]: Abstraction has 1210 states and 2233 transitions. [2023-11-24 23:59:39,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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) [2023-11-24 23:59:39,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 2233 transitions. [2023-11-24 23:59:39,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-24 23:59:39,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:59:39,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:59:39,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 23:59:39,179 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-24 23:59:39,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:59:39,180 INFO L85 PathProgramCache]: Analyzing trace with hash 213058564, now seen corresponding path program 1 times [2023-11-24 23:59:39,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:59:39,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401219738] [2023-11-24 23:59:39,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:59:39,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:59:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:59:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:59:39,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:59:39,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401219738] [2023-11-24 23:59:39,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401219738] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:59:39,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:59:39,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:59:39,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317997788] [2023-11-24 23:59:39,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:59:39,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 23:59:39,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:59:39,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 23:59:39,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:59:39,273 INFO L87 Difference]: Start difference. First operand 1210 states and 2233 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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) [2023-11-24 23:59:39,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:59:39,375 INFO L93 Difference]: Finished difference Result 1219 states and 2241 transitions. [2023-11-24 23:59:39,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:59:39,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-11-24 23:59:39,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:59:39,384 INFO L225 Difference]: With dead ends: 1219 [2023-11-24 23:59:39,384 INFO L226 Difference]: Without dead ends: 1219 [2023-11-24 23:59:39,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:59:39,386 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 61 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:59:39,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 426 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:59:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2023-11-24 23:59:39,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1211. [2023-11-24 23:59:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 1192 states have (on average 1.8741610738255035) internal successors, (2234), 1210 states have internal predecessors, (2234), 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) [2023-11-24 23:59:39,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 2234 transitions. [2023-11-24 23:59:39,429 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 2234 transitions. Word has length 33 [2023-11-24 23:59:39,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:59:39,430 INFO L495 AbstractCegarLoop]: Abstraction has 1211 states and 2234 transitions. [2023-11-24 23:59:39,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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) [2023-11-24 23:59:39,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 2234 transitions. [2023-11-24 23:59:39,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-24 23:59:39,432 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:59:39,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:59:39,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 23:59:39,433 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-24 23:59:39,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:59:39,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1682416842, now seen corresponding path program 1 times [2023-11-24 23:59:39,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:59:39,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654928415] [2023-11-24 23:59:39,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:59:39,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:59:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:59:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:59:39,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:59:39,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654928415] [2023-11-24 23:59:39,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654928415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:59:39,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:59:39,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:59:39,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008223169] [2023-11-24 23:59:39,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:59:39,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:59:39,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:59:39,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:59:39,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:59:39,853 INFO L87 Difference]: Start difference. First operand 1211 states and 2234 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 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) [2023-11-24 23:59:40,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:59:40,143 INFO L93 Difference]: Finished difference Result 1172 states and 2156 transitions. [2023-11-24 23:59:40,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:59:40,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-24 23:59:40,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:59:40,151 INFO L225 Difference]: With dead ends: 1172 [2023-11-24 23:59:40,152 INFO L226 Difference]: Without dead ends: 1121 [2023-11-24 23:59:40,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:59:40,153 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 131 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:59:40,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 264 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 23:59:40,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2023-11-24 23:59:40,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2023-11-24 23:59:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1111 states have (on average 1.8622862286228623) internal successors, (2069), 1120 states have internal predecessors, (2069), 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) [2023-11-24 23:59:40,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 2069 transitions. [2023-11-24 23:59:40,195 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 2069 transitions. Word has length 34 [2023-11-24 23:59:40,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:59:40,196 INFO L495 AbstractCegarLoop]: Abstraction has 1121 states and 2069 transitions. [2023-11-24 23:59:40,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 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) [2023-11-24 23:59:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 2069 transitions. [2023-11-24 23:59:40,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-24 23:59:40,198 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:59:40,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:59:40,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 23:59:40,199 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-24 23:59:40,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:59:40,199 INFO L85 PathProgramCache]: Analyzing trace with hash -899302659, now seen corresponding path program 1 times [2023-11-24 23:59:40,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:59:40,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124063778] [2023-11-24 23:59:40,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:59:40,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:59:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:59:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:59:40,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:59:40,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124063778] [2023-11-24 23:59:40,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124063778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:59:40,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:59:40,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:59:40,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557145820] [2023-11-24 23:59:40,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:59:40,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:59:40,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:59:40,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:59:40,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:59:40,633 INFO L87 Difference]: Start difference. First operand 1121 states and 2069 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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) [2023-11-24 23:59:40,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:59:40,860 INFO L93 Difference]: Finished difference Result 1166 states and 2155 transitions. [2023-11-24 23:59:40,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:59:40,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-11-24 23:59:40,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:59:40,869 INFO L225 Difference]: With dead ends: 1166 [2023-11-24 23:59:40,870 INFO L226 Difference]: Without dead ends: 1166 [2023-11-24 23:59:40,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:59:40,879 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 39 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:59:40,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 293 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:59:40,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2023-11-24 23:59:40,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1156. [2023-11-24 23:59:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1147 states have (on average 1.8622493461203138) internal successors, (2136), 1155 states have internal predecessors, (2136), 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) [2023-11-24 23:59:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 2136 transitions. [2023-11-24 23:59:40,926 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 2136 transitions. Word has length 37 [2023-11-24 23:59:40,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:59:40,926 INFO L495 AbstractCegarLoop]: Abstraction has 1156 states and 2136 transitions. [2023-11-24 23:59:40,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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) [2023-11-24 23:59:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 2136 transitions. [2023-11-24 23:59:40,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-24 23:59:40,929 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:59:40,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:59:40,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 23:59:40,930 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-24 23:59:40,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:59:40,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1880402312, now seen corresponding path program 1 times [2023-11-24 23:59:40,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:59:40,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31194190] [2023-11-24 23:59:40,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:59:40,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:59:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:59:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:59:41,572 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:59:41,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31194190] [2023-11-24 23:59:41,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31194190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:59:41,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:59:41,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:59:41,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209957770] [2023-11-24 23:59:41,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:59:41,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:59:41,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:59:41,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:59:41,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:59:41,576 INFO L87 Difference]: Start difference. First operand 1156 states and 2136 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 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) [2023-11-24 23:59:42,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:59:42,206 INFO L93 Difference]: Finished difference Result 1326 states and 2440 transitions. [2023-11-24 23:59:42,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:59:42,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2023-11-24 23:59:42,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:59:42,217 INFO L225 Difference]: With dead ends: 1326 [2023-11-24 23:59:42,217 INFO L226 Difference]: Without dead ends: 1118 [2023-11-24 23:59:42,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:59:42,219 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 237 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-24 23:59:42,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 545 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-24 23:59:42,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2023-11-24 23:59:42,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 983. [2023-11-24 23:59:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 977 states have (on average 1.8546571136131014) internal successors, (1812), 982 states have internal predecessors, (1812), 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) [2023-11-24 23:59:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1812 transitions. [2023-11-24 23:59:42,257 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1812 transitions. Word has length 63 [2023-11-24 23:59:42,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:59:42,258 INFO L495 AbstractCegarLoop]: Abstraction has 983 states and 1812 transitions. [2023-11-24 23:59:42,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 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) [2023-11-24 23:59:42,259 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1812 transitions. [2023-11-24 23:59:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-24 23:59:42,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:59:42,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:59:42,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 23:59:42,269 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-24 23:59:42,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:59:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1345881083, now seen corresponding path program 1 times [2023-11-24 23:59:42,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:59:42,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210717495] [2023-11-24 23:59:42,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:59:42,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:59:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:59:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 23:59:42,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:59:42,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210717495] [2023-11-24 23:59:42,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210717495] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:59:42,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:59:42,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:59:42,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853270666] [2023-11-24 23:59:42,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:59:42,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:59:42,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:59:42,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:59:42,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:59:42,891 INFO L87 Difference]: Start difference. First operand 983 states and 1812 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 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) [2023-11-24 23:59:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:59:43,070 INFO L93 Difference]: Finished difference Result 969 states and 1786 transitions. [2023-11-24 23:59:43,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:59:43,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2023-11-24 23:59:43,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:59:43,077 INFO L225 Difference]: With dead ends: 969 [2023-11-24 23:59:43,077 INFO L226 Difference]: Without dead ends: 743 [2023-11-24 23:59:43,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:59:43,079 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 38 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:59:43,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 246 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:59:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2023-11-24 23:59:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2023-11-24 23:59:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 739 states have (on average 1.851150202976996) internal successors, (1368), 742 states have internal predecessors, (1368), 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) [2023-11-24 23:59:43,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1368 transitions. [2023-11-24 23:59:43,108 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1368 transitions. Word has length 78 [2023-11-24 23:59:43,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:59:43,109 INFO L495 AbstractCegarLoop]: Abstraction has 743 states and 1368 transitions. [2023-11-24 23:59:43,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 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) [2023-11-24 23:59:43,110 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1368 transitions. [2023-11-24 23:59:43,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-24 23:59:43,111 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:59:43,111 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:59:43,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 23:59:43,112 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-24 23:59:43,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:59:43,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1958933017, now seen corresponding path program 1 times [2023-11-24 23:59:43,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:59:43,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80231698] [2023-11-24 23:59:43,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:59:43,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:59:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:59:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:59:45,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:59:45,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80231698] [2023-11-24 23:59:45,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80231698] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:59:45,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203085216] [2023-11-24 23:59:45,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:59:45,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:59:45,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:59:45,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:59:45,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 23:59:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:59:46,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-24 23:59:46,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:59:46,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:59:46,334 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-24 23:59:46,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-11-24 23:59:46,429 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-24 23:59:46,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-24 23:59:46,982 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-24 23:59:46,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 64 [2023-11-24 23:59:47,003 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-11-24 23:59:47,990 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-24 23:59:47,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 73 [2023-11-24 23:59:48,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2023-11-24 23:59:48,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-11-24 23:59:48,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 23:59:48,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-24 23:59:48,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-24 23:59:48,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-24 23:59:49,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-24 23:59:49,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-24 23:59:49,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 23:59:49,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 23:59:49,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 23:59:49,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 23:59:49,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:59:49,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:59:49,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:59:49,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:59:49,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:59:49,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 41 [2023-11-24 23:59:49,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:59:49,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:59:50,198 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_375 Int) (v_ArrVal_374 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_375 Int) (v_ArrVal_374 (Array Int Int))) (= 0 (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_375 Int) (v_ArrVal_374 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_375 Int) (v_ArrVal_374 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false [2023-11-24 23:59:50,328 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (forall ((v_ArrVal_375 Int) (v_ArrVal_374 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse3) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (forall ((v_ArrVal_375 Int) (v_ArrVal_374 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse3) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (forall ((v_ArrVal_375 Int) (v_ArrVal_374 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse3) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (forall ((v_ArrVal_375 Int) (v_ArrVal_374 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse3) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) is different from false [2023-11-24 23:59:52,519 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_19| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse1) (forall ((v_ArrVal_375 Int) (v_ArrVal_374 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_19| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (forall ((v_ArrVal_375 Int) (v_ArrVal_374 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse4 .cse3 (store (select .cse4 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse1))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse1) (forall ((v_ArrVal_375 Int) (v_ArrVal_374 (Array Int Int))) (= 0 (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))))) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_19| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse1) (forall ((v_ArrVal_375 Int) (v_ArrVal_374 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))))))) is different from false [2023-11-24 23:59:52,666 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_374 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse3))) (forall ((v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_374 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= 0 (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse3))) (forall ((v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_374 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse3))) (forall ((v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_374 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse3))))) is different from false [2023-11-24 23:59:53,053 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) (.cse1 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_374 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0))) (forall ((v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_374 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1) (= (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0))) (forall ((v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_374 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (= (select (select (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1))) (forall ((v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_374 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1)))))) is different from false [2023-11-24 23:59:53,235 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 0) .cse8 0)))) (and (forall ((v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_374 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse4))) (forall ((v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_374 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= 0 (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) .cse6)) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse4))) (forall ((v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_374 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse4) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0))) (forall ((v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_374 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse4) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) is different from false [2023-11-24 23:59:53,403 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse6 0) .cse10 0))) (.cse1 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_374 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))) (forall ((v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_374 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1))) (forall ((v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_374 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1))) (forall ((v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_374 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_374))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_375))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1)))))) is different from false [2023-11-24 23:59:53,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:59:53,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 72 [2023-11-24 23:59:53,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:59:53,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 412 treesize of output 384 [2023-11-24 23:59:53,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 162 [2023-11-24 23:59:53,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2023-11-24 23:59:53,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 119 [2023-11-24 23:59:53,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:59:53,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74 [2023-11-24 23:59:53,860 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 23:59:53,873 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-24 23:59:53,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 130 [2023-11-24 23:59:53,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2023-11-24 23:59:53,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 62 [2023-11-24 23:59:53,936 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-24 23:59:53,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1 [2023-11-24 23:59:53,948 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-24 23:59:53,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1 [2023-11-24 23:59:54,862 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_362 (Array Int Int)) (v_ArrVal_361 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_361))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_363 (Array Int Int))) (not (= (select (select (store .cse0 .cse1 v_ArrVal_363) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_364 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_362))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_364) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) (forall ((v_ArrVal_361 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_361) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|)))) is different from false [2023-11-24 23:59:54,963 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_361 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_361) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_362 (Array Int Int)) (v_ArrVal_361 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_361))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_364 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_362))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 .cse2 v_ArrVal_364) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_363 (Array Int Int))) (not (= (select (select (store .cse3 .cse2 v_ArrVal_363) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))) is different from false [2023-11-24 23:59:55,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 259 [2023-11-24 23:59:55,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 120 [2023-11-24 23:59:55,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 116 [2023-11-24 23:59:55,796 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-24 23:59:55,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 579 treesize of output 362 [2023-11-24 23:59:55,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:59:55,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 96 [2023-11-24 23:59:55,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2023-11-24 23:59:56,033 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 23:59:56,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2023-11-24 23:59:56,106 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-24 23:59:56,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203085216] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:59:56,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [519402876] [2023-11-24 23:59:56,117 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-24 23:59:56,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:59:56,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 68 [2023-11-24 23:59:56,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826210016] [2023-11-24 23:59:56,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:59:56,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-11-24 23:59:56,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:59:56,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-11-24 23:59:56,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=3278, Unknown=14, NotChecked=1116, Total=4692 [2023-11-24 23:59:56,127 INFO L87 Difference]: Start difference. First operand 743 states and 1368 transitions. Second operand has 69 states, 68 states have (on average 3.0441176470588234) internal successors, (207), 69 states have internal predecessors, (207), 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) [2023-11-25 00:00:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:00:03,306 INFO L93 Difference]: Finished difference Result 1154 states and 2106 transitions. [2023-11-25 00:00:03,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-25 00:00:03,308 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 3.0441176470588234) internal successors, (207), 69 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2023-11-25 00:00:03,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:00:03,319 INFO L225 Difference]: With dead ends: 1154 [2023-11-25 00:00:03,320 INFO L226 Difference]: Without dead ends: 1154 [2023-11-25 00:00:03,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 122 SyntacticMatches, 9 SemanticMatches, 98 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2492 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=878, Invalid=7334, Unknown=14, NotChecked=1674, Total=9900 [2023-11-25 00:00:03,325 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 784 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 2146 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 4604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2375 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-25 00:00:03,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 2044 Invalid, 4604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2146 Invalid, 0 Unknown, 2375 Unchecked, 2.5s Time] [2023-11-25 00:00:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2023-11-25 00:00:03,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 759. [2023-11-25 00:00:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 755 states have (on average 1.8543046357615893) internal successors, (1400), 758 states have internal predecessors, (1400), 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) [2023-11-25 00:00:03,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1400 transitions. [2023-11-25 00:00:03,357 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1400 transitions. Word has length 80 [2023-11-25 00:00:03,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:00:03,359 INFO L495 AbstractCegarLoop]: Abstraction has 759 states and 1400 transitions. [2023-11-25 00:00:03,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 3.0441176470588234) internal successors, (207), 69 states have internal predecessors, (207), 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) [2023-11-25 00:00:03,360 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1400 transitions. [2023-11-25 00:00:03,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-25 00:00:03,361 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:00:03,361 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:00:03,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-25 00:00:03,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:00:03,569 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-25 00:00:03,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:00:03,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1685451621, now seen corresponding path program 2 times [2023-11-25 00:00:03,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:00:03,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329210564] [2023-11-25 00:00:03,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:00:03,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:00:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:00:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:00:06,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:00:06,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329210564] [2023-11-25 00:00:06,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329210564] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:00:06,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217767684] [2023-11-25 00:00:06,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-25 00:00:06,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:00:06,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:00:06,504 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:00:06,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326cfcd3-57ef-407c-bf3c-4717237ea0a9/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-25 00:00:06,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-25 00:00:06,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:00:06,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-25 00:00:06,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:00:07,205 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-25 00:00:07,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 44 [2023-11-25 00:00:07,798 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-25 00:00:07,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 70 [2023-11-25 00:00:07,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:00:07,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-25 00:00:08,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-25 00:00:08,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-25 00:00:08,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-11-25 00:00:09,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-25 00:00:09,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:00:09,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 39 [2023-11-25 00:00:09,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:00:09,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-25 00:00:09,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:00:09,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-25 00:00:09,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:00:09,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-25 00:00:09,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:00:09,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-25 00:00:09,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:00:09,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:00:09,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:00:09,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:00:09,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 35 [2023-11-25 00:00:09,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:00:09,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2023-11-25 00:00:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:00:09,858 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:00:10,113 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_542 Int) (v_ArrVal_540 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_540))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_542))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_542 Int) (v_ArrVal_540 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_540))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_542))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_542 Int) (v_ArrVal_540 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_540))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_542))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) is different from false [2023-11-25 00:00:17,038 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_542 Int) (v_ArrVal_540 (Array Int Int))) (= 0 (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_540))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_542))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3) (forall ((v_ArrVal_542 Int) (v_ArrVal_540 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_540))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_542))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_542 Int) (v_ArrVal_540 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_540))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_542))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3))))))) is different from false [2023-11-25 00:00:17,123 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_542 Int) (v_ArrVal_540 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= 0 (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_540))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_542))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse2) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3))) (forall ((v_ArrVal_542 Int) (v_ArrVal_540 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse2) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_540))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_542))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3))) (forall ((v_ArrVal_542 Int) (v_ArrVal_540 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse2) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_540))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_542))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3))))) is different from false [2023-11-25 00:00:17,416 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) (.cse3 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_542 Int) (v_ArrVal_540 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_540))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_542))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse4))) (forall ((v_ArrVal_542 Int) (v_ArrVal_540 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_540))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_542))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse4))) (forall ((v_ArrVal_542 Int) (v_ArrVal_540 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_540))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_542))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse4)))))) is different from false [2023-11-25 00:00:17,538 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse6 0))) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_542 Int) (v_ArrVal_540 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_540))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_542))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse4))) (forall ((v_ArrVal_542 Int) (v_ArrVal_540 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_540))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_542))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse4))) (forall ((v_ArrVal_542 Int) (v_ArrVal_540 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= 0 (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_540))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_542))) c_threadThread1of1ForFork0_~p~0.base) .cse8)) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse4)))))) is different from false [2023-11-25 00:00:17,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:00:17,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 64 [2023-11-25 00:00:17,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:00:17,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 342 treesize of output 318 [2023-11-25 00:00:17,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 177 [2023-11-25 00:00:17,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-11-25 00:00:17,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 123 [2023-11-25 00:00:17,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:00:17,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 64 [2023-11-25 00:00:17,904 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:00:17,923 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-25 00:00:17,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 122 [2023-11-25 00:00:17,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 58 [2023-11-25 00:00:17,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2023-11-25 00:00:17,989 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-25 00:00:17,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 1 [2023-11-25 00:00:19,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2023-11-25 00:00:19,282 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_529 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_529))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#is~0#1.base| .cse0)) (forall ((v_ArrVal_531 (Array Int Int))) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse1 .cse0 v_ArrVal_531) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) (forall ((v_ArrVal_529 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_529) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|)))) is different from false [2023-11-25 00:00:20,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-25 00:00:20,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:00:20,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 98 [2023-11-25 00:00:20,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2023-11-25 00:00:20,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-25 00:00:20,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217767684] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:00:20,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [780250842] [2023-11-25 00:00:20,961 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-25 00:00:20,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:00:20,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 24] total 66 [2023-11-25 00:00:20,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547625636] [2023-11-25 00:00:20,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:00:20,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-11-25 00:00:20,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:00:20,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-11-25 00:00:20,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=3414, Unknown=33, NotChecked=738, Total=4422 [2023-11-25 00:00:20,975 INFO L87 Difference]: Start difference. First operand 759 states and 1400 transitions. Second operand has 67 states, 66 states have (on average 3.1363636363636362) internal successors, (207), 67 states have internal predecessors, (207), 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)