./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-race.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_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/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_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-race.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/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_0f48c305-191b-4596-bf50-30a19b3a276c/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 bdf6537ef41e6e97eaabcf1f32a2477c3eb925663d5b8e717e1252d54a113bc0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:53:17,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:53:17,875 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DataRace-32bit-Taipan_Default.epf [2023-11-12 00:53:17,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:53:17,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:53:17,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:53:17,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:53:17,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:53:17,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:53:17,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:53:17,914 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:53:17,915 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:53:17,916 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:53:17,916 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:53:17,917 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:53:17,918 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:53:17,918 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:53:17,919 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:53:17,920 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:53:17,920 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:53:17,921 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:53:17,922 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:53:17,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:53:17,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:53:17,924 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:53:17,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:53:17,925 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:53:17,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:53:17,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:53:17,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:53:17,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:53:17,927 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-12 00:53:17,928 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:53:17,929 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:53:17,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:53:17,930 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:53:17,930 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:53:17,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:53:17,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:53:17,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:53:17,934 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:53:17,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:53:17,936 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:53:17,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:53:17,936 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:53:17,936 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:53:17,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:53:17,937 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_0f48c305-191b-4596-bf50-30a19b3a276c/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_0f48c305-191b-4596-bf50-30a19b3a276c/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 -> bdf6537ef41e6e97eaabcf1f32a2477c3eb925663d5b8e717e1252d54a113bc0 [2023-11-12 00:53:18,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:53:18,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:53:18,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:53:18,303 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:53:18,304 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:53:18,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-race.i [2023-11-12 00:53:21,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:53:21,720 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:53:21,721 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-race.i [2023-11-12 00:53:21,748 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/data/f6ecdb921/460caa0a43594b4b80c63b826bd5f4d4/FLAGcad87e668 [2023-11-12 00:53:21,765 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/data/f6ecdb921/460caa0a43594b4b80c63b826bd5f4d4 [2023-11-12 00:53:21,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:53:21,770 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:53:21,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:53:21,771 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:53:21,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:53:21,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:53:21" (1/1) ... [2023-11-12 00:53:21,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17483815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:21, skipping insertion in model container [2023-11-12 00:53:21,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:53:21" (1/1) ... [2023-11-12 00:53:21,836 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:53:22,026 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-12 00:53:22,383 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:53:22,399 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:53:22,414 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-12 00:53:22,445 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:53:22,508 WARN L672 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 00:53:22,516 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:53:22,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:22 WrapperNode [2023-11-12 00:53:22,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:53:22,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:53:22,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:53:22,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:53:22,527 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:53:22" (1/1) ... [2023-11-12 00:53:22,557 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:53:22" (1/1) ... [2023-11-12 00:53:22,609 INFO L138 Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2023-11-12 00:53:22,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:53:22,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:53:22,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:53:22,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:53:22,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:22" (1/1) ... [2023-11-12 00:53:22,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:22" (1/1) ... [2023-11-12 00:53:22,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:22" (1/1) ... [2023-11-12 00:53:22,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:22" (1/1) ... [2023-11-12 00:53:22,663 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:22" (1/1) ... [2023-11-12 00:53:22,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:22" (1/1) ... [2023-11-12 00:53:22,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:22" (1/1) ... [2023-11-12 00:53:22,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:22" (1/1) ... [2023-11-12 00:53:22,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:53:22,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:53:22,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:53:22,677 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:53:22,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:22" (1/1) ... [2023-11-12 00:53:22,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:53:22,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:53:22,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/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:53:22,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/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:53:22,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:53:22,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:53:22,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:53:22,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:53:22,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:53:22,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:53:22,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:53:22,789 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-12 00:53:22,789 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-12 00:53:22,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:53:22,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:53:22,791 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:53:22,935 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:53:22,937 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:53:23,312 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:53:23,321 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:53:23,321 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 00:53:23,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:53:23 BoogieIcfgContainer [2023-11-12 00:53:23,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:53:23,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:53:23,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:53:23,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:53:23,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:53:21" (1/3) ... [2023-11-12 00:53:23,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f02e3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:53:23, skipping insertion in model container [2023-11-12 00:53:23,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:22" (2/3) ... [2023-11-12 00:53:23,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f02e3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:53:23, skipping insertion in model container [2023-11-12 00:53:23,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:53:23" (3/3) ... [2023-11-12 00:53:23,335 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-race.i [2023-11-12 00:53:23,345 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 00:53:23,357 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:53:23,357 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2023-11-12 00:53:23,358 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 00:53:23,453 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-12 00:53:23,490 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-12 00:53:23,507 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 103 transitions, 213 flow [2023-11-12 00:53:23,510 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 103 transitions, 213 flow [2023-11-12 00:53:23,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 213 flow [2023-11-12 00:53:23,584 INFO L124 PetriNetUnfolderBase]: 6/152 cut-off events. [2023-11-12 00:53:23,584 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-12 00:53:23,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 152 events. 6/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 316 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. [2023-11-12 00:53:23,593 INFO L119 LiptonReduction]: Number of co-enabled transitions 1792 [2023-11-12 00:53:40,335 INFO L134 LiptonReduction]: Checked pairs total: 7534 [2023-11-12 00:53:40,335 INFO L136 LiptonReduction]: Total number of compositions: 70 [2023-11-12 00:53:40,345 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 43 transitions, 93 flow [2023-11-12 00:53:40,387 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 296 states, 278 states have (on average 1.870503597122302) internal successors, (520), 295 states have internal predecessors, (520), 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:53:40,409 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:53:40,418 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;@3af036fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:53:40,418 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-12 00:53:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 296 states, 278 states have (on average 1.870503597122302) internal successors, (520), 295 states have internal predecessors, (520), 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:53:40,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:53:40,429 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:40,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:40,430 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-12 00:53:40,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:40,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1084151436, now seen corresponding path program 1 times [2023-11-12 00:53:40,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:40,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764797343] [2023-11-12 00:53:40,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:40,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:41,325 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:53:41,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:41,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764797343] [2023-11-12 00:53:41,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764797343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:41,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:41,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:53:41,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134042103] [2023-11-12 00:53:41,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:41,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:53:41,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:41,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:53:41,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:53:41,372 INFO L87 Difference]: Start difference. First operand has 296 states, 278 states have (on average 1.870503597122302) internal successors, (520), 295 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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:53:41,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:41,858 INFO L93 Difference]: Finished difference Result 435 states and 758 transitions. [2023-11-12 00:53:41,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:53:41,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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 7 [2023-11-12 00:53:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:41,889 INFO L225 Difference]: With dead ends: 435 [2023-11-12 00:53:41,889 INFO L226 Difference]: Without dead ends: 419 [2023-11-12 00:53:41,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:53:41,895 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 40 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:41,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 19 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:53:41,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-11-12 00:53:41,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 347. [2023-11-12 00:53:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 334 states have (on average 1.8502994011976048) internal successors, (618), 346 states have internal predecessors, (618), 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:53:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 618 transitions. [2023-11-12 00:53:41,972 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 618 transitions. Word has length 7 [2023-11-12 00:53:41,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:41,973 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 618 transitions. [2023-11-12 00:53:41,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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:53:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 618 transitions. [2023-11-12 00:53:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 00:53:41,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:41,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:41,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:53:41,976 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-12 00:53:41,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:41,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1920761363, now seen corresponding path program 1 times [2023-11-12 00:53:41,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:41,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548081419] [2023-11-12 00:53:41,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:41,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:42,317 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:53:42,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:42,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548081419] [2023-11-12 00:53:42,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548081419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:42,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:42,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:53:42,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301657554] [2023-11-12 00:53:42,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:42,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:53:42,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:42,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:53:42,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:53:42,321 INFO L87 Difference]: Start difference. First operand 347 states and 618 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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:53:42,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:42,658 INFO L93 Difference]: Finished difference Result 375 states and 664 transitions. [2023-11-12 00:53:42,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:53:42,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2023-11-12 00:53:42,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:42,661 INFO L225 Difference]: With dead ends: 375 [2023-11-12 00:53:42,661 INFO L226 Difference]: Without dead ends: 347 [2023-11-12 00:53:42,662 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:53:42,663 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:42,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 32 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:53:42,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-11-12 00:53:42,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 342. [2023-11-12 00:53:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 330 states have (on average 1.8636363636363635) internal successors, (615), 341 states have internal predecessors, (615), 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:53:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 615 transitions. [2023-11-12 00:53:42,712 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 615 transitions. Word has length 14 [2023-11-12 00:53:42,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:42,713 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 615 transitions. [2023-11-12 00:53:42,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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:53:42,714 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 615 transitions. [2023-11-12 00:53:42,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:53:42,716 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:42,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:42,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:53:42,717 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-12 00:53:42,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:42,719 INFO L85 PathProgramCache]: Analyzing trace with hash -407347437, now seen corresponding path program 1 times [2023-11-12 00:53:42,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:42,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245081791] [2023-11-12 00:53:42,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:42,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:43,133 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:53:43,134 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:43,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245081791] [2023-11-12 00:53:43,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245081791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:43,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:43,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:53:43,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839194129] [2023-11-12 00:53:43,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:43,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:53:43,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:43,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:53:43,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:53:43,149 INFO L87 Difference]: Start difference. First operand 342 states and 615 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:53:43,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:43,708 INFO L93 Difference]: Finished difference Result 440 states and 793 transitions. [2023-11-12 00:53:43,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:53:43,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2023-11-12 00:53:43,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:43,714 INFO L225 Difference]: With dead ends: 440 [2023-11-12 00:53:43,714 INFO L226 Difference]: Without dead ends: 428 [2023-11-12 00:53:43,714 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:53:43,716 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 64 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:43,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 53 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 00:53:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2023-11-12 00:53:43,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2023-11-12 00:53:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 416 states have (on average 1.8533653846153846) internal successors, (771), 427 states have internal predecessors, (771), 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:53:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 771 transitions. [2023-11-12 00:53:43,739 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 771 transitions. Word has length 15 [2023-11-12 00:53:43,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:43,739 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 771 transitions. [2023-11-12 00:53:43,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:53:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 771 transitions. [2023-11-12 00:53:43,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 00:53:43,742 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:43,742 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:43,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:53:43,742 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-12 00:53:43,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:43,743 INFO L85 PathProgramCache]: Analyzing trace with hash -223142855, now seen corresponding path program 1 times [2023-11-12 00:53:43,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:43,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200656909] [2023-11-12 00:53:43,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:43,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:44,232 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:53:44,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:44,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200656909] [2023-11-12 00:53:44,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200656909] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:53:44,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036086820] [2023-11-12 00:53:44,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:44,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:44,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:53:44,238 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:53:44,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:53:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:44,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-12 00:53:44,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:44,565 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:53:44,609 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:53:44,698 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:53:44,791 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:53:44,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:53:44,897 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:53:44,942 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:53:44,942 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:44,991 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_148 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_148) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_148 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_148) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_148 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_148) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_148 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_148) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false [2023-11-12 00:53:45,179 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_148 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_148) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_148 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_148) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_148 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_148) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_148 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_148) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1))))))) is different from false [2023-11-12 00:53:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-12 00:53:45,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036086820] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:45,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1910248377] [2023-11-12 00:53:45,321 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:53:45,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:53:45,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2023-11-12 00:53:45,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754276719] [2023-11-12 00:53:45,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:53:45,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-12 00:53:45,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:45,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-12 00:53:45,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=326, Unknown=7, NotChecked=78, Total=506 [2023-11-12 00:53:45,328 INFO L87 Difference]: Start difference. First operand 428 states and 771 transitions. Second operand has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:45,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:45,837 INFO L93 Difference]: Finished difference Result 398 states and 714 transitions. [2023-11-12 00:53:45,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:53:45,838 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-12 00:53:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:45,841 INFO L225 Difference]: With dead ends: 398 [2023-11-12 00:53:45,842 INFO L226 Difference]: Without dead ends: 384 [2023-11-12 00:53:45,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=417, Unknown=7, NotChecked=90, Total=650 [2023-11-12 00:53:45,844 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 170 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:45,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 40 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 241 Invalid, 0 Unknown, 148 Unchecked, 0.4s Time] [2023-11-12 00:53:45,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2023-11-12 00:53:45,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 323. [2023-11-12 00:53:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 317 states have (on average 1.8138801261829653) internal successors, (575), 322 states have internal predecessors, (575), 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:53:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 575 transitions. [2023-11-12 00:53:45,859 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 575 transitions. Word has length 18 [2023-11-12 00:53:45,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:45,860 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 575 transitions. [2023-11-12 00:53:45,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:45,860 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 575 transitions. [2023-11-12 00:53:45,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 00:53:45,862 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:45,863 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:45,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:46,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:46,071 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-12 00:53:46,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:46,071 INFO L85 PathProgramCache]: Analyzing trace with hash -681255214, now seen corresponding path program 1 times [2023-11-12 00:53:46,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:46,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937249442] [2023-11-12 00:53:46,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:46,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:46,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:46,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937249442] [2023-11-12 00:53:46,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937249442] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:53:46,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259204822] [2023-11-12 00:53:46,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:46,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:46,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:53:46,552 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:53:46,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:53:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:46,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-12 00:53:46,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:46,785 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:53:46,820 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 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-12 00:53:46,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:53:46,870 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 25 treesize of output 18 [2023-11-12 00:53:46,885 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:46,886 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 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-12 00:53:46,908 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:46,910 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-12 00:53:46,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:46,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:46,965 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_225 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_225) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_225 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_225) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-12 00:53:47,063 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:47,064 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 2 case distinctions, treesize of input 23 treesize of output 29 [2023-11-12 00:53:47,073 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:47,073 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 48 treesize of output 22 [2023-11-12 00:53:47,083 INFO L322 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-12 00:53:47,083 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2023-11-12 00:53:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-12 00:53:47,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259204822] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:47,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [847561307] [2023-11-12 00:53:47,151 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:53:47,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:53:47,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-11-12 00:53:47,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870328967] [2023-11-12 00:53:47,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:53:47,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-12 00:53:47,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:47,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-12 00:53:47,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=240, Unknown=7, NotChecked=32, Total=342 [2023-11-12 00:53:47,155 INFO L87 Difference]: Start difference. First operand 323 states and 575 transitions. Second operand has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 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:53:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:48,203 INFO L93 Difference]: Finished difference Result 309 states and 544 transitions. [2023-11-12 00:53:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 00:53:48,205 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 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 18 [2023-11-12 00:53:48,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:48,208 INFO L225 Difference]: With dead ends: 309 [2023-11-12 00:53:48,208 INFO L226 Difference]: Without dead ends: 282 [2023-11-12 00:53:48,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=389, Unknown=7, NotChecked=44, Total=600 [2023-11-12 00:53:48,210 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 281 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:48,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 92 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 654 Invalid, 0 Unknown, 189 Unchecked, 0.9s Time] [2023-11-12 00:53:48,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-11-12 00:53:48,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 227. [2023-11-12 00:53:48,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 222 states have (on average 1.7747747747747749) internal successors, (394), 226 states have internal predecessors, (394), 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:53:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 394 transitions. [2023-11-12 00:53:48,223 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 394 transitions. Word has length 18 [2023-11-12 00:53:48,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:48,224 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 394 transitions. [2023-11-12 00:53:48,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 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:53:48,224 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 394 transitions. [2023-11-12 00:53:48,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 00:53:48,229 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:48,230 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2023-11-12 00:53:48,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:48,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:48,437 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-12 00:53:48,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:48,438 INFO L85 PathProgramCache]: Analyzing trace with hash -495803365, now seen corresponding path program 1 times [2023-11-12 00:53:48,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:48,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199402916] [2023-11-12 00:53:48,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:48,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 00:53:48,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 00:53:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 00:53:48,556 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-12 00:53:48,557 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 00:53:48,558 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-12 00:53:48,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-11-12 00:53:48,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-11-12 00:53:48,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2023-11-12 00:53:48,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-11-12 00:53:48,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-11-12 00:53:48,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-11-12 00:53:48,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:53:48,564 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-12 00:53:48,568 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-12 00:53:48,568 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-12 00:53:48,609 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-12 00:53:48,613 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-12 00:53:48,614 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 121 transitions, 258 flow [2023-11-12 00:53:48,614 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 121 transitions, 258 flow [2023-11-12 00:53:48,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 121 transitions, 258 flow [2023-11-12 00:53:48,716 INFO L124 PetriNetUnfolderBase]: 11/271 cut-off events. [2023-11-12 00:53:48,716 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-12 00:53:48,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 271 events. 11/271 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 651 event pairs, 0 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 154. Up to 8 conditions per place. [2023-11-12 00:53:48,725 INFO L119 LiptonReduction]: Number of co-enabled transitions 4512 [2023-11-12 00:54:09,272 INFO L134 LiptonReduction]: Checked pairs total: 18839 [2023-11-12 00:54:09,273 INFO L136 LiptonReduction]: Total number of compositions: 71 [2023-11-12 00:54:09,274 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 54 transitions, 124 flow [2023-11-12 00:54:09,384 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2681 states, 2631 states have (on average 2.602812618776131) internal successors, (6848), 2680 states have internal predecessors, (6848), 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:54:09,385 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:54:09,386 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;@3af036fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:54:09,386 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-12 00:54:09,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 2681 states, 2631 states have (on average 2.602812618776131) internal successors, (6848), 2680 states have internal predecessors, (6848), 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:54:09,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:54:09,395 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:09,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:09,396 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-12 00:54:09,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:09,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1615737875, now seen corresponding path program 1 times [2023-11-12 00:54:09,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:09,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059304798] [2023-11-12 00:54:09,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:09,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:09,584 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:54:09,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:09,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059304798] [2023-11-12 00:54:09,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059304798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:09,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:09,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:54:09,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502381849] [2023-11-12 00:54:09,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:09,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:54:09,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:09,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:54:09,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:54:09,596 INFO L87 Difference]: Start difference. First operand has 2681 states, 2631 states have (on average 2.602812618776131) internal successors, (6848), 2680 states have internal predecessors, (6848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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:54:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:10,111 INFO L93 Difference]: Finished difference Result 4643 states and 11791 transitions. [2023-11-12 00:54:10,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:54:10,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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 7 [2023-11-12 00:54:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:10,158 INFO L225 Difference]: With dead ends: 4643 [2023-11-12 00:54:10,159 INFO L226 Difference]: Without dead ends: 4607 [2023-11-12 00:54:10,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:54:10,164 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 43 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:10,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 34 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:54:10,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4607 states. [2023-11-12 00:54:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4607 to 3472. [2023-11-12 00:54:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3472 states, 3429 states have (on average 2.6030912802566344) internal successors, (8926), 3471 states have internal predecessors, (8926), 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:54:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 8926 transitions. [2023-11-12 00:54:10,328 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 8926 transitions. Word has length 7 [2023-11-12 00:54:10,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:10,328 INFO L495 AbstractCegarLoop]: Abstraction has 3472 states and 8926 transitions. [2023-11-12 00:54:10,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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:54:10,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 8926 transitions. [2023-11-12 00:54:10,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 00:54:10,329 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:10,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:10,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 00:54:10,330 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-12 00:54:10,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:10,330 INFO L85 PathProgramCache]: Analyzing trace with hash -699659968, now seen corresponding path program 1 times [2023-11-12 00:54:10,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:10,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259804475] [2023-11-12 00:54:10,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:10,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:10,652 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:54:10,653 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:10,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259804475] [2023-11-12 00:54:10,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259804475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:10,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:10,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:54:10,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43085815] [2023-11-12 00:54:10,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:10,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:54:10,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:10,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:54:10,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:54:10,656 INFO L87 Difference]: Start difference. First operand 3472 states and 8926 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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:54:10,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:10,961 INFO L93 Difference]: Finished difference Result 3840 states and 9812 transitions. [2023-11-12 00:54:10,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:54:10,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2023-11-12 00:54:10,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:10,995 INFO L225 Difference]: With dead ends: 3840 [2023-11-12 00:54:10,995 INFO L226 Difference]: Without dead ends: 3777 [2023-11-12 00:54:10,995 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:54:10,997 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:10,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 36 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:54:11,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3777 states. [2023-11-12 00:54:11,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 3694. [2023-11-12 00:54:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3694 states, 3652 states have (on average 2.608707557502738) internal successors, (9527), 3693 states have internal predecessors, (9527), 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:54:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 9527 transitions. [2023-11-12 00:54:11,143 INFO L78 Accepts]: Start accepts. Automaton has 3694 states and 9527 transitions. Word has length 14 [2023-11-12 00:54:11,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:11,143 INFO L495 AbstractCegarLoop]: Abstraction has 3694 states and 9527 transitions. [2023-11-12 00:54:11,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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:54:11,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3694 states and 9527 transitions. [2023-11-12 00:54:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:54:11,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:11,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:11,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 00:54:11,146 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-12 00:54:11,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:11,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1719687841, now seen corresponding path program 1 times [2023-11-12 00:54:11,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:11,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250891491] [2023-11-12 00:54:11,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:11,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:11,442 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:54:11,443 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:11,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250891491] [2023-11-12 00:54:11,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250891491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:11,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:11,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:54:11,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649517540] [2023-11-12 00:54:11,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:11,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:54:11,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:11,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:54:11,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:54:11,445 INFO L87 Difference]: Start difference. First operand 3694 states and 9527 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:54:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:12,123 INFO L93 Difference]: Finished difference Result 4890 states and 12814 transitions. [2023-11-12 00:54:12,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:54:12,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2023-11-12 00:54:12,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:12,165 INFO L225 Difference]: With dead ends: 4890 [2023-11-12 00:54:12,165 INFO L226 Difference]: Without dead ends: 4872 [2023-11-12 00:54:12,166 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:54:12,167 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 96 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:12,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 88 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 00:54:12,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4872 states. [2023-11-12 00:54:12,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4872 to 4872. [2023-11-12 00:54:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4830 states have (on average 2.644513457556936) internal successors, (12773), 4871 states have internal predecessors, (12773), 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:54:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 12773 transitions. [2023-11-12 00:54:12,386 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 12773 transitions. Word has length 15 [2023-11-12 00:54:12,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:12,387 INFO L495 AbstractCegarLoop]: Abstraction has 4872 states and 12773 transitions. [2023-11-12 00:54:12,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:54:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 12773 transitions. [2023-11-12 00:54:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 00:54:12,388 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:12,389 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:12,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 00:54:12,390 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-12 00:54:12,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:12,390 INFO L85 PathProgramCache]: Analyzing trace with hash -683522887, now seen corresponding path program 1 times [2023-11-12 00:54:12,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:12,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609628716] [2023-11-12 00:54:12,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:12,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:54:12,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:12,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609628716] [2023-11-12 00:54:12,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609628716] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:54:12,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375695351] [2023-11-12 00:54:12,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:12,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:12,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:54:12,858 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:54:12,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:54:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:12,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-12 00:54:12,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:54:13,045 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:54:13,076 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 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-12 00:54:13,117 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:54:13,117 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 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-12 00:54:13,172 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:54:13,173 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-12 00:54:13,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:13,281 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 43 treesize of output 32 [2023-11-12 00:54:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:54:13,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:54:13,363 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_412 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_412) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_412 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_412) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_412 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_412) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_412 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_412) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false [2023-11-12 00:54:13,452 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_412 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_412) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_412 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_412) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_412 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_412) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_412 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_412) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-12 00:54:13,477 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_412 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_412) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_412 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_412) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_412 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_412) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_412 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_412) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-12 00:54:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-12 00:54:13,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375695351] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:54:13,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1808660243] [2023-11-12 00:54:13,585 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:54:13,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:54:13,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-11-12 00:54:13,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943430860] [2023-11-12 00:54:13,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:54:13,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-12 00:54:13,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:13,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-12 00:54:13,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=267, Unknown=3, NotChecked=108, Total=462 [2023-11-12 00:54:13,589 INFO L87 Difference]: Start difference. First operand 4872 states and 12773 transitions. Second operand has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 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:54:14,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:14,886 INFO L93 Difference]: Finished difference Result 5619 states and 14763 transitions. [2023-11-12 00:54:14,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 00:54:14,887 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 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 19 [2023-11-12 00:54:14,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:14,930 INFO L225 Difference]: With dead ends: 5619 [2023-11-12 00:54:14,930 INFO L226 Difference]: Without dead ends: 5607 [2023-11-12 00:54:14,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=431, Unknown=3, NotChecked=144, Total=756 [2023-11-12 00:54:14,931 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 533 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 1889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 915 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:14,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 168 Invalid, 1889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 878 Invalid, 0 Unknown, 915 Unchecked, 1.0s Time] [2023-11-12 00:54:14,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5607 states. [2023-11-12 00:54:15,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5607 to 4875. [2023-11-12 00:54:15,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4834 states have (on average 2.638394704178734) internal successors, (12754), 4874 states have internal predecessors, (12754), 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:54:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 12754 transitions. [2023-11-12 00:54:15,120 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 12754 transitions. Word has length 19 [2023-11-12 00:54:15,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:15,121 INFO L495 AbstractCegarLoop]: Abstraction has 4875 states and 12754 transitions. [2023-11-12 00:54:15,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 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:54:15,121 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 12754 transitions. [2023-11-12 00:54:15,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 00:54:15,122 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:15,122 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:15,129 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:54:15,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-12 00:54:15,328 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-12 00:54:15,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:15,329 INFO L85 PathProgramCache]: Analyzing trace with hash -2040282574, now seen corresponding path program 1 times [2023-11-12 00:54:15,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:15,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933951340] [2023-11-12 00:54:15,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:15,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:15,689 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:54:15,689 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:15,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933951340] [2023-11-12 00:54:15,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933951340] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:54:15,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362176379] [2023-11-12 00:54:15,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:15,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:15,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:54:15,691 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:54:15,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f48c305-191b-4596-bf50-30a19b3a276c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:54:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:15,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-12 00:54:15,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:54:15,828 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 18 treesize of output 16 [2023-11-12 00:54:15,853 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-12 00:54:15,947 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:54:15,977 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:54:16,006 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:54:16,044 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:54:16,045 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-12 00:54:16,090 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:54:16,091 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:54:16,177 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:54:16,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:54:16,264 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:54:16,264 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 1 case distinctions, treesize of input 18 treesize of output 19 [2023-11-12 00:54:16,267 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 30 treesize of output 22 [2023-11-12 00:54:16,275 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 5 treesize of output 3 [2023-11-12 00:54:16,301 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:54:16,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362176379] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:54:16,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1130348456] [2023-11-12 00:54:16,302 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:54:16,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:54:16,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 18 [2023-11-12 00:54:16,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469720673] [2023-11-12 00:54:16,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:54:16,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-12 00:54:16,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:16,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-12 00:54:16,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=298, Unknown=7, NotChecked=0, Total=380 [2023-11-12 00:54:16,307 INFO L87 Difference]: Start difference. First operand 4875 states and 12754 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 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)