./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 cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/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_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX --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.3-dev-cf1a783 [2023-11-12 00:43:25,275 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:43:25,403 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DataRace-32bit-Taipan_Default.epf [2023-11-12 00:43:25,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:43:25,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:43:25,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:43:25,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:43:25,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:43:25,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:43:25,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:43:25,462 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:43:25,462 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:43:25,463 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:43:25,465 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:43:25,465 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:43:25,466 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:43:25,466 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:43:25,467 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:43:25,467 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:43:25,467 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:43:25,469 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:43:25,470 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:43:25,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:43:25,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:43:25,472 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:43:25,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:43:25,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:43:25,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:43:25,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:43:25,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:43:25,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:43:25,476 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-12 00:43:25,477 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:43:25,477 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:43:25,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:43:25,477 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:43:25,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:43:25,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:43:25,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:43:25,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:43:25,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:43:25,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:43:25,479 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:43:25,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:43:25,480 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:43:25,480 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:43:25,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:43:25,481 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_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/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_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX 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-12 00:43:25,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:43:25,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:43:25,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:43:25,917 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:43:25,917 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:43:25,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2023-11-12 00:43:29,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:43:29,571 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:43:29,572 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2023-11-12 00:43:29,596 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/data/5d19ae02f/1cb8e770b50d4ce1b6325d752a80b4a5/FLAGbf9e1a396 [2023-11-12 00:43:29,614 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/data/5d19ae02f/1cb8e770b50d4ce1b6325d752a80b4a5 [2023-11-12 00:43:29,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:43:29,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:43:29,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:43:29,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:43:29,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:43:29,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:43:29" (1/1) ... [2023-11-12 00:43:29,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d07e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:29, skipping insertion in model container [2023-11-12 00:43:29,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:43:29" (1/1) ... [2023-11-12 00:43:29,705 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:43:29,899 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-12 00:43:30,309 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:43:30,320 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:43:30,335 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-12 00:43:30,407 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:43:30,492 WARN L672 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 00:43:30,501 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:43:30,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:30 WrapperNode [2023-11-12 00:43:30,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:43:30,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:43:30,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:43:30,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:43:30,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:30" (1/1) ... [2023-11-12 00:43:30,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:30" (1/1) ... [2023-11-12 00:43:30,587 INFO L138 Inliner]: procedures = 266, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114 [2023-11-12 00:43:30,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:43:30,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:43:30,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:43:30,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:43:30,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:30" (1/1) ... [2023-11-12 00:43:30,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:30" (1/1) ... [2023-11-12 00:43:30,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:30" (1/1) ... [2023-11-12 00:43:30,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:30" (1/1) ... [2023-11-12 00:43:30,627 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:30" (1/1) ... [2023-11-12 00:43:30,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:30" (1/1) ... [2023-11-12 00:43:30,638 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:30" (1/1) ... [2023-11-12 00:43:30,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:30" (1/1) ... [2023-11-12 00:43:30,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:43:30,660 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:43:30,661 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:43:30,661 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:43:30,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:30" (1/1) ... [2023-11-12 00:43:30,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:43:30,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:43:30,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:43:30,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:43:30,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:43:30,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:43:30,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:43:30,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:43:30,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:43:30,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:43:30,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:43:30,779 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-12 00:43:30,779 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-12 00:43:30,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:43:30,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:43:30,784 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 00:43:30,999 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:43:31,002 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:43:31,438 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:43:31,448 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:43:31,449 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 00:43:31,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:43:31 BoogieIcfgContainer [2023-11-12 00:43:31,452 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:43:31,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:43:31,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:43:31,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:43:31,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:43:29" (1/3) ... [2023-11-12 00:43:31,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e4e6c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:43:31, skipping insertion in model container [2023-11-12 00:43:31,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:30" (2/3) ... [2023-11-12 00:43:31,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e4e6c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:43:31, skipping insertion in model container [2023-11-12 00:43:31,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:43:31" (3/3) ... [2023-11-12 00:43:31,464 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i [2023-11-12 00:43:31,474 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 00:43:31,488 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:43:31,488 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-12 00:43:31,489 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 00:43:31,570 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-12 00:43:31,613 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-12 00:43:31,629 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 136 transitions, 279 flow [2023-11-12 00:43:31,633 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 136 transitions, 279 flow [2023-11-12 00:43:31,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 136 transitions, 279 flow [2023-11-12 00:43:31,763 INFO L124 PetriNetUnfolderBase]: 6/219 cut-off events. [2023-11-12 00:43:31,767 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-12 00:43:31,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 219 events. 6/219 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 376 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 108. Up to 4 conditions per place. [2023-11-12 00:43:31,782 INFO L119 LiptonReduction]: Number of co-enabled transitions 2366 [2023-11-12 00:43:39,489 INFO L134 LiptonReduction]: Checked pairs total: 10694 [2023-11-12 00:43:39,489 INFO L136 LiptonReduction]: Total number of compositions: 89 [2023-11-12 00:43:39,500 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 59 transitions, 125 flow [2023-11-12 00:43:39,555 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 440 states, 409 states have (on average 1.8973105134474328) internal successors, (776), 439 states have internal predecessors, (776), 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-12 00:43:39,587 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:43:39,603 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;@7c4790d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:43:39,603 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-12 00:43:39,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 440 states, 409 states have (on average 1.8973105134474328) internal successors, (776), 439 states have internal predecessors, (776), 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-12 00:43:39,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:43:39,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:39,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:43:39,619 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-12 00:43:39,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:39,627 INFO L85 PathProgramCache]: Analyzing trace with hash 407366024, now seen corresponding path program 1 times [2023-11-12 00:43:39,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:39,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742670856] [2023-11-12 00:43:39,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:39,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:40,404 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-12 00:43:40,405 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:40,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742670856] [2023-11-12 00:43:40,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742670856] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:43:40,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:43:40,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:43:40,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888608186] [2023-11-12 00:43:40,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:43:40,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:43:40,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:40,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:43:40,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:43:40,463 INFO L87 Difference]: Start difference. First operand has 440 states, 409 states have (on average 1.8973105134474328) internal successors, (776), 439 states have internal predecessors, (776), 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 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 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-12 00:43:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:40,976 INFO L93 Difference]: Finished difference Result 432 states and 747 transitions. [2023-11-12 00:43:40,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:43:40,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 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 5 [2023-11-12 00:43:40,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:41,012 INFO L225 Difference]: With dead ends: 432 [2023-11-12 00:43:41,013 INFO L226 Difference]: Without dead ends: 414 [2023-11-12 00:43:41,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:43:41,019 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:41,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 15 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:43:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2023-11-12 00:43:41,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 400. [2023-11-12 00:43:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 381 states have (on average 1.8608923884514437) internal successors, (709), 399 states have internal predecessors, (709), 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-12 00:43:41,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 709 transitions. [2023-11-12 00:43:41,150 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 709 transitions. Word has length 5 [2023-11-12 00:43:41,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:41,152 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 709 transitions. [2023-11-12 00:43:41,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 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-12 00:43:41,153 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 709 transitions. [2023-11-12 00:43:41,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:43:41,153 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:41,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:43:41,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:43:41,160 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-12 00:43:41,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:41,162 INFO L85 PathProgramCache]: Analyzing trace with hash -240797307, now seen corresponding path program 1 times [2023-11-12 00:43:41,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:41,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006945604] [2023-11-12 00:43:41,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:41,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:41,515 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-12 00:43:41,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:41,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006945604] [2023-11-12 00:43:41,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006945604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:43:41,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:43:41,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:43:41,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403766145] [2023-11-12 00:43:41,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:43:41,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:43:41,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:41,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:43:41,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:43:41,520 INFO L87 Difference]: Start difference. First operand 400 states and 709 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-12 00:43:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:41,838 INFO L93 Difference]: Finished difference Result 378 states and 667 transitions. [2023-11-12 00:43:41,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:43:41,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2023-11-12 00:43:41,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:41,842 INFO L225 Difference]: With dead ends: 378 [2023-11-12 00:43:41,842 INFO L226 Difference]: Without dead ends: 370 [2023-11-12 00:43:41,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:43:41,844 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:41,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 11 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:43:41,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2023-11-12 00:43:41,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 367. [2023-11-12 00:43:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 357 states have (on average 1.826330532212885) internal successors, (652), 366 states have internal predecessors, (652), 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-12 00:43:41,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 652 transitions. [2023-11-12 00:43:41,877 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 652 transitions. Word has length 6 [2023-11-12 00:43:41,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:41,877 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 652 transitions. [2023-11-12 00:43:41,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-12 00:43:41,878 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 652 transitions. [2023-11-12 00:43:41,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:43:41,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:41,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:43:41,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:43:41,879 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-12 00:43:41,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:41,880 INFO L85 PathProgramCache]: Analyzing trace with hash -935615675, now seen corresponding path program 1 times [2023-11-12 00:43:41,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:41,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184196772] [2023-11-12 00:43:41,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:41,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:42,018 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-12 00:43:42,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:42,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184196772] [2023-11-12 00:43:42,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184196772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:43:42,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:43:42,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:43:42,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605523519] [2023-11-12 00:43:42,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:43:42,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:43:42,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:42,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:43:42,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:43:42,026 INFO L87 Difference]: Start difference. First operand 367 states and 652 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-12 00:43:42,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:42,124 INFO L93 Difference]: Finished difference Result 368 states and 652 transitions. [2023-11-12 00:43:42,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:43:42,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2023-11-12 00:43:42,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:42,127 INFO L225 Difference]: With dead ends: 368 [2023-11-12 00:43:42,128 INFO L226 Difference]: Without dead ends: 367 [2023-11-12 00:43:42,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:43:42,129 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:42,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 80 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:43:42,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2023-11-12 00:43:42,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2023-11-12 00:43:42,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 357 states have (on average 1.8235294117647058) internal successors, (651), 366 states have internal predecessors, (651), 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-12 00:43:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 651 transitions. [2023-11-12 00:43:42,143 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 651 transitions. Word has length 10 [2023-11-12 00:43:42,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:42,144 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 651 transitions. [2023-11-12 00:43:42,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-12 00:43:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 651 transitions. [2023-11-12 00:43:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:43:42,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:42,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:43:42,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:43:42,145 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-12 00:43:42,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:42,146 INFO L85 PathProgramCache]: Analyzing trace with hash 927886634, now seen corresponding path program 1 times [2023-11-12 00:43:42,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:42,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999218108] [2023-11-12 00:43:42,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:42,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:42,481 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-12 00:43:42,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:42,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999218108] [2023-11-12 00:43:42,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999218108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:43:42,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:43:42,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:43:42,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067415019] [2023-11-12 00:43:42,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:43:42,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:43:42,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:42,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:43:42,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:43:42,490 INFO L87 Difference]: Start difference. First operand 367 states and 651 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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-12 00:43:42,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:42,757 INFO L93 Difference]: Finished difference Result 388 states and 690 transitions. [2023-11-12 00:43:42,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:43:42,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2023-11-12 00:43:42,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:42,760 INFO L225 Difference]: With dead ends: 388 [2023-11-12 00:43:42,760 INFO L226 Difference]: Without dead ends: 388 [2023-11-12 00:43:42,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:43:42,762 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:42,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:43:42,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-11-12 00:43:42,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2023-11-12 00:43:42,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 379 states have (on average 1.8205804749340369) internal successors, (690), 387 states have internal predecessors, (690), 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-12 00:43:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 690 transitions. [2023-11-12 00:43:42,776 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 690 transitions. Word has length 11 [2023-11-12 00:43:42,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:42,776 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 690 transitions. [2023-11-12 00:43:42,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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-12 00:43:42,776 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 690 transitions. [2023-11-12 00:43:42,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:43:42,778 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:42,778 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] [2023-11-12 00:43:42,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:43:42,779 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-12 00:43:42,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:42,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1492087749, now seen corresponding path program 1 times [2023-11-12 00:43:42,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:42,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385513160] [2023-11-12 00:43:42,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:42,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:43,262 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-12 00:43:43,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:43,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385513160] [2023-11-12 00:43:43,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385513160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:43:43,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:43:43,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:43:43,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148129442] [2023-11-12 00:43:43,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:43:43,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:43:43,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:43,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:43:43,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:43:43,265 INFO L87 Difference]: Start difference. First operand 388 states and 690 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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-12 00:43:44,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:44,038 INFO L93 Difference]: Finished difference Result 443 states and 776 transitions. [2023-11-12 00:43:44,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:43:44,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-12 00:43:44,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:44,043 INFO L225 Difference]: With dead ends: 443 [2023-11-12 00:43:44,043 INFO L226 Difference]: Without dead ends: 389 [2023-11-12 00:43:44,043 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-12 00:43:44,044 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 42 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:44,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 40 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 00:43:44,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2023-11-12 00:43:44,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 370. [2023-11-12 00:43:44,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 364 states have (on average 1.8104395604395604) internal successors, (659), 369 states have internal predecessors, (659), 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-12 00:43:44,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 659 transitions. [2023-11-12 00:43:44,059 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 659 transitions. Word has length 27 [2023-11-12 00:43:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:44,059 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 659 transitions. [2023-11-12 00:43:44,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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-12 00:43:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 659 transitions. [2023-11-12 00:43:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-12 00:43:44,061 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:44,062 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] [2023-11-12 00:43:44,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:43:44,062 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-12 00:43:44,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:44,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1744530172, now seen corresponding path program 1 times [2023-11-12 00:43:44,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:44,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480814551] [2023-11-12 00:43:44,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:44,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:44,599 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-12 00:43:44,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:44,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480814551] [2023-11-12 00:43:44,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480814551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:43:44,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:43:44,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:43:44,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81734015] [2023-11-12 00:43:44,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:43:44,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:43:44,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:44,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:43:44,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:43:44,609 INFO L87 Difference]: Start difference. First operand 370 states and 659 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-12 00:43:44,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:44,816 INFO L93 Difference]: Finished difference Result 362 states and 645 transitions. [2023-11-12 00:43:44,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:43:44,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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 31 [2023-11-12 00:43:44,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:44,819 INFO L225 Difference]: With dead ends: 362 [2023-11-12 00:43:44,819 INFO L226 Difference]: Without dead ends: 283 [2023-11-12 00:43:44,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:43:44,820 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:44,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 25 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:43:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-11-12 00:43:44,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2023-11-12 00:43:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 279 states have (on average 1.8136200716845878) internal successors, (506), 282 states have internal predecessors, (506), 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-12 00:43:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 506 transitions. [2023-11-12 00:43:44,832 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 506 transitions. Word has length 31 [2023-11-12 00:43:44,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:44,832 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 506 transitions. [2023-11-12 00:43:44,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-12 00:43:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 506 transitions. [2023-11-12 00:43:44,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-12 00:43:44,834 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:44,835 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-12 00:43:44,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:43:44,835 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-12 00:43:44,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:44,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1630906881, now seen corresponding path program 1 times [2023-11-12 00:43:44,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:44,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297293017] [2023-11-12 00:43:44,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:47,997 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:47,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297293017] [2023-11-12 00:43:47,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297293017] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:43:47,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477182668] [2023-11-12 00:43:47,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:47,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:43:47,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:43:48,004 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:43:48,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:43:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:48,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-12 00:43:48,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:43:48,280 INFO L351 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 51 treesize of output 49 [2023-11-12 00:43:48,680 INFO L322 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-12 00:43:48,681 INFO L351 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 42 treesize of output 36 [2023-11-12 00:43:48,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:48,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:43:49,351 INFO L322 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-12 00:43:49,351 INFO L351 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 66 treesize of output 66 [2023-11-12 00:43:49,372 INFO L351 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 20 treesize of output 11 [2023-11-12 00:43:49,399 INFO L351 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 12 treesize of output 8 [2023-11-12 00:43:49,720 INFO L351 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-12 00:43:49,823 INFO L351 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-12 00:43:49,957 INFO L351 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-12 00:43:50,109 INFO L351 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-12 00:43:50,264 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:43:50,265 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2023-11-12 00:43:50,289 INFO L351 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 24 treesize of output 12 [2023-11-12 00:43:50,301 INFO L351 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 7 treesize of output 3 [2023-11-12 00:43:50,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:50,405 INFO L351 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-12 00:43:50,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:50,450 INFO L351 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-12 00:43:50,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:50,499 INFO L351 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-12 00:43:50,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:50,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:50,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:50,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:50,635 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:50,635 INFO L351 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-12 00:43:50,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:50,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:43:50,940 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_382 (Array Int Int)) (v_ArrVal_383 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_382))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_383))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_382 (Array Int Int)) (v_ArrVal_383 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_382))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_383))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_382 (Array Int Int)) (v_ArrVal_383 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_382))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_383))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_382 (Array Int Int)) (v_ArrVal_383 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_382))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_383))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false [2023-11-12 00:43:51,029 WARN L854 $PredicateComparison]: unable to prove that (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 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.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_#t~mem8#1.offset_128| Int)) (or (forall ((v_ArrVal_382 (Array Int Int)) (v_ArrVal_383 Int)) (= 0 (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_382))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_128|) v_ArrVal_383))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_128| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_128| Int)) (or (forall ((v_ArrVal_382 (Array Int Int)) (v_ArrVal_383 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_382))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_128|) v_ArrVal_383))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_128| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_128| Int)) (or (forall ((v_ArrVal_382 (Array Int Int)) (v_ArrVal_383 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_382))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_128|) v_ArrVal_383))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_128| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_128| Int)) (or (forall ((v_ArrVal_382 (Array Int Int)) (v_ArrVal_383 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_382))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_128|) v_ArrVal_383))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_128| .cse3))))) is different from false [2023-11-12 00:43:55,484 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:55,485 INFO L351 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 81 treesize of output 74 [2023-11-12 00:43:55,500 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:55,500 INFO L351 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 444 treesize of output 416 [2023-11-12 00:43:55,520 INFO L351 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 190 treesize of output 174 [2023-11-12 00:43:55,563 INFO L351 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-12 00:43:55,577 INFO L351 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 149 treesize of output 127 [2023-11-12 00:43:55,806 INFO L322 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-12 00:43:55,807 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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-12 00:43:55,818 INFO L322 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-12 00:43:55,819 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2023-11-12 00:43:55,841 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:55,842 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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-12 00:43:55,848 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:43:55,863 INFO L322 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-12 00:43:55,863 INFO L351 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 144 treesize of output 130 [2023-11-12 00:43:55,878 INFO L351 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-12 00:43:55,889 INFO L351 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-12 00:43:57,137 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_369 (Array Int Int)) (v_ArrVal_370 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_370))) (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_371 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_371) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_372 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_369))) (< (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_372) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) (forall ((v_ArrVal_370 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_370) |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-12 00:43:57,225 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_ULTIMATE.start_main_#t~mem8#1.base_129| Int)) (or (forall ((v_ArrVal_370 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_129| v_ArrVal_370) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_129|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_129| Int)) (or (forall ((v_ArrVal_369 (Array Int Int)) (v_ArrVal_370 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_129| v_ArrVal_370))) (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_372 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_129| v_ArrVal_369))) (< (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_372) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_371 (Array Int Int))) (not (= (select (select (store .cse3 .cse2 v_ArrVal_371) |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|)))))))) (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_129|))))) is different from false [2023-11-12 00:43:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-12 00:43:57,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477182668] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:43:57,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1390587872] [2023-11-12 00:43:57,239 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:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java: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-12 00:43:57,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:43:57,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 48 [2023-11-12 00:43:57,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919896372] [2023-11-12 00:43:57,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:43:57,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-12 00:43:57,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:57,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-12 00:43:57,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1852, Unknown=39, NotChecked=364, Total=2450 [2023-11-12 00:43:57,248 INFO L87 Difference]: Start difference. First operand 283 states and 506 transitions. Second operand has 50 states, 49 states have (on average 2.061224489795918) internal successors, (101), 49 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:44:05,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:44:05,170 INFO L93 Difference]: Finished difference Result 374 states and 640 transitions. [2023-11-12 00:44:05,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-12 00:44:05,171 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.061224489795918) internal successors, (101), 49 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-12 00:44:05,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:44:05,174 INFO L225 Difference]: With dead ends: 374 [2023-11-12 00:44:05,174 INFO L226 Difference]: Without dead ends: 374 [2023-11-12 00:44:05,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=400, Invalid=2883, Unknown=39, NotChecked=460, Total=3782 [2023-11-12 00:44:05,177 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 190 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 1952 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 2625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 521 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:44:05,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 148 Invalid, 2625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1952 Invalid, 0 Unknown, 521 Unchecked, 6.4s Time] [2023-11-12 00:44:05,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-11-12 00:44:05,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 297. [2023-11-12 00:44:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 293 states have (on average 1.8225255972696246) internal successors, (534), 296 states have internal predecessors, (534), 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-12 00:44:05,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 534 transitions. [2023-11-12 00:44:05,189 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 534 transitions. Word has length 34 [2023-11-12 00:44:05,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:44:05,190 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 534 transitions. [2023-11-12 00:44:05,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.061224489795918) internal successors, (101), 49 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:44:05,190 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 534 transitions. [2023-11-12 00:44:05,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-12 00:44:05,192 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:44:05,192 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-12 00:44:05,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-12 00:44:05,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-12 00:44:05,399 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-12 00:44:05,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:44:05,400 INFO L85 PathProgramCache]: Analyzing trace with hash 456300757, now seen corresponding path program 2 times [2023-11-12 00:44:05,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:44:05,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972355673] [2023-11-12 00:44:05,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:05,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:44:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:44:08,200 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:44:08,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972355673] [2023-11-12 00:44:08,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972355673] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:44:08,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628030024] [2023-11-12 00:44:08,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:44:08,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:44:08,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:44:08,208 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:44:08,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87a47119-f0e8-41eb-8a76-d9ece78aa198/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:44:08,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-12 00:44:08,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:44:08,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-12 00:44:08,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:44:08,707 INFO L322 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-12 00:44:08,708 INFO L351 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 69 treesize of output 65 [2023-11-12 00:44:08,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:44:08,723 INFO L351 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-12 00:44:09,381 INFO L322 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-12 00:44:09,382 INFO L351 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-12 00:44:09,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:44:09,395 INFO L351 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-12 00:44:09,847 INFO L351 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-12 00:44:09,980 INFO L351 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-12 00:44:10,115 INFO L351 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-12 00:44:10,276 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:44:10,276 INFO L351 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 35 [2023-11-12 00:44:10,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:44:10,296 INFO L351 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 30 treesize of output 21 [2023-11-12 00:44:10,311 INFO L351 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 7 treesize of output 3 [2023-11-12 00:44:10,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:44:10,404 INFO L351 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 30 treesize of output 21 [2023-11-12 00:44:10,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:44:10,439 INFO L351 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 30 treesize of output 21 [2023-11-12 00:44:10,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:44:10,462 INFO L351 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 30 treesize of output 21 [2023-11-12 00:44:10,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:44:10,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:44:10,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:44:10,594 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:44:10,594 INFO L351 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 45 treesize of output 31 [2023-11-12 00:44:10,670 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:44:10,670 INFO L351 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 33 treesize of output 38 [2023-11-12 00:44:10,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:44:10,732 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:44:15,891 WARN L854 $PredicateComparison]: unable to prove that (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 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.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_#t~mem8#1.offset_130| Int)) (or (forall ((v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_549))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_130|) v_ArrVal_550))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_130| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_130| Int)) (or (forall ((v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_549))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_130|) v_ArrVal_550))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_130| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_130| Int)) (or (forall ((v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_549))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_130|) v_ArrVal_550))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_130| .cse3))))) is different from false [2023-11-12 00:44:15,962 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 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) (.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_ULTIMATE.start_main_#t~mem8#1.offset_130| Int)) (or (forall ((v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 Int)) (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_549))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_130|) v_ArrVal_550))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_130| .cse4))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_130| Int)) (or (forall ((v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_549))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_130|) v_ArrVal_550))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_130| .cse4))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_130| Int)) (or (forall ((v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_549))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_130|) v_ArrVal_550))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_130| .cse4)))))) is different from false